arXiv (All)
open access
Deep belief networks are exact
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 Brouwe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Training-Free Uncertainty Estimation for Embedding Models#1118355
- Bayesian belief nets#957221
- Deep Q-Learning on Hölder Spaces#280216
- Belief-Credence Interaction Beyond Arbitrary Partitions: Locating Relevant Partitions Within Belief Networks#167290
- Conceptualizing Embeddings: Sparse Disentanglement for Vision-Language Models#216838
Record · ID 972628
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive