Research1 min read
arXiv:2609.05572v1 Announce Type: new Abstract: We prove that every strictly positive probability distribution on \(\{-1,1\}^n\) is represented exactly by a sigmoid belief network with finite parameters. This answers a question of Sutske...
By OpenSmartRoute editorial · attributed excerpt
From arXiv cs.AI
arXiv:2609.05572v1 Announce Type: new Abstract: We prove that every strictly positive probability distribution on ({-1,1}^n) is represented exactly by a sigmoid belief network with finite parameters. This answers a question of Sutskever and Hinton. The proof upgrades their probability-sharing approximation to exact representation using Brouwer's fixed-point theorem.
Read the original at arXiv cs.AI: Deep belief networks are exact
Source: https://arxiv.org/abs/2609.05572
Keep reading
Research1 min read
arXiv:2609.09589v1 Announce Type: new Abstract: Deep neural networks exhibit regular macroscopic behavior despite highly nonlinear dynamics in vast parameter spaces. We develop a statistical-mechanical description of learning directly in...
Research1 min read
Researchers introduced Cros, a risk-constrained stopping layer for clinical diagnosis agents, achieving improved exploratory performance and reduced error rates compared to existing methods. The system provides a finite-sample guarantee and offers insights into autonomous stopping reliability.
Research1 min read
Experiments with a 63.9M-parameter student model using correctness-gated multi-teacher distillation showed minimal accuracy gains compared to hard filtering. The audit of the weighted arm revealed significant label loss and failed to establish a grounding effect, indicating no incremental decision benefit.
