This source only provides a headline — there is no body to show. Use “Read the original” below to read it at the source.
Continuous Noisy-Loop Models
arXiv:2611.24213v1 Announce Type: new Abstract: Efficient learning and inference need not imply a compact probabilistic circuit. We quantify this distinction for continuous noisy readings of agreement between adjacent latent spins on a known square grid with $d$ edges. With known margins and bounded Lipschitz channels, minimax squared Hellinger risk is $\Theta(\min\{1,dN^{-2/3}\})$ from $N$ independent vectors, without a reliability lower bound. A spline estimator reaches this rate in polynomial arithmetic time given a fixed positive reliability bound; an exponential-size mixture removes that requirement. At fixed positive reliability, nonnegative decomposable circuits need $\exp(\Theta(\sqrt d))$ nodes for fixed total-variation error below one, even when each leaf uses at most $\alpha d$ coordinates, $0 1$ and $0