cs.LGNov 18, 2026

Continuous Noisy-Loop Models

Authors: An T. Le

Organizations: Center for AI Research, VinUniversity Vinhomes Ocean Park, Gia Lam, Hanoi, Vietnam · Intelligent Autonomous Systems, TU Darmstadt Hochschulstrasse 10, 64289 Darmstadt, Germany

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 dd edges. With known margins and bounded Lipschitz channels, minimax squared Hellinger risk is Θ(min⁡{1,dN−2/3})Θ(\min\{1,dN^{-2/3}\}) from NN 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⁡(Θ(d))\exp(Θ(\sqrt d)) nodes for fixed total-variation error below one, even when each leaf uses at most αdαd coordinates, 0<α<10<α<1. Optimal Kullback--Leibler (KL) approximation error is Θ(d/max⁡{log⁡d,ℓ})Θ(d/\max\{\log d,\sqrt\ell\}) in either direction with at most drd^r nodes and leaf scopes ℓ≤αd\ell\leqαd, for fixed r>1r>1 and 0<α<2/30<α<2/3. Node counts exclude leaf computation. For three fixed masks, optimal joint conditional KL has order d/log⁡dd/\log d when ℓ≤(log⁡d)2\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(d3/2)O(d^{3/2}) arithmetic operations and one root extraction.

Figures & tables

Appendix figures & tables12 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Computationally sufficient statistics for Ising models

    Feb 12, 2026Abhijith Jayakumar, Shreya Shukla, Marc Vuffray +2Markov Random FieldsStatistical Physics of Learning

  2. Learning by Compression: Risk Estimates Attain the Law-of-Large-Numbers Rate

    Oct 9, 2026Simone Garatti, Marco C. CampiSample CompressionStatistical Learning Theory

  3. Statistical Gains from Looped Estimation under Parameter Budgets

    Sep 22, 2026Xinyu Tian, Xiaotong ShenParameter EstimationParameter Sharing