Backend
Continuous Noisy-Loop Models
arXiv math.IT0 views
arXiv:2611.24213v1 Announce Type: cross 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<\alpha<1$. Optimal Kullback--Leibler (KL) approximation error is $\Theta(d/\max\{\log d,\sqrt\ell\})$ in either direction with at most $d^r$ nodes and leaf scopes $\ell\leq\alpha d$, for fixed $r>1$ and $0<\alpha<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.
Source:https://arxiv.org/abs/2611.24213PreviousDOA Estimation in Antenna Arrays: Super-Resolution Methods in a Common SpaceNextEfficiency of ANS Entropy Encoders
Related posts
What Jobs Can a Fresher Get After Learning Python? A Practical Guide
0dev.to
Defensive Coding for Real-Time Scoreboard Components
0dev.to
Dev News Digest: 19 Nov 2026, 06:00
0dev.to News
Download Website as HTML: Get a Runnable Project From a Figma Capture
0dev.to Design
A bilingual article’s canonical URL changes from a draft decision to an API result
0dev.to Discuss
Signs of Wear: Evaluating Intelligent Speed Assistance Under Synthetic Adverse Conditions
0arXiv eess.IV