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.05505v1 Announce Type: new Abstract: Systematic reviews require sustained human judgment across thousands of records, yet existing evaluations of large language models (LLMs) typically examine review stages in isolation. We in...
Research1 min read
ARC-Bench identifies a fundamental flaw in frozen JEPA-style world models: predicted action rankings based on latent space distances consistently fail to align with true cost. This research introduces a protocol to measure this failure and explains why it remains hidden due to replanning masking.
Research1 min read
Research found that LLM-based agents consistently adopted incorrect tool returns, with overtrust exceeding 68% across web search and code execution. Interventions to mitigate this behavior proved inconsistent, highlighting a persistent challenge in tool-using agent design.
