Continuous Noisy-Loop Models
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 $Θ(\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(Θ(\sqrt d))$ nodes for fixed total-variation error below one, even when each leaf uses at most $αd$ coordinates, $0<α<1$. Optimal Kullback--Leibler (KL) approximation error is $Θ(d/\max\{\log d,\sqrt\ell\})$ in either direction with at most $d^r$ nodes and leaf scopes $\ell\leqαd$, for fixed $r>1$ and $0<α<2/3$. Node counts exclude leaf computation. For three fixed masks, optimal joint conditional KL has order $d/\log d$ when $\ell\leq(\log d)^2$. Local cycle identities relate joint divergence to identifiable channel products and separate weak-channel recovery from density estimation. Factorized evidence preserves a planar zero-field Ising model: given local integrals, exact queries cost $O(d^{3/2})$ arithmetic operations and one root extraction.
Authors
- An T. Le
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24213
- Primary Topic
- Bayesian Modeling and Causal Inference
- Type
- preprint