← 研踪 PaperTrailarXiv:2611.24213 · v1
Continuous Noisy-Loop Models
首次提交 2026-11-18 18:52
版本更新 2026-11-18 18:52
雷达观测 2026-11-19 15:04
摘要
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 edges. With known margins and bounded Lipschitz channels, minimax squared Hellinger risk is from 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 nodes for fixed total-variation error below one, even when each leaf uses at most coordinates, . Optimal Kullback--Leibler (KL) approximation error is in either direction with at most nodes and leaf scopes , for fixed and . Node counts exclude leaf computation. For three fixed masks, optimal joint conditional KL has order when . 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 arithmetic operations and one root extraction.
作者备注:51 pages, 7 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 18:52 · 最新观测版本
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 edges. With known margins and bounded Lipschitz channels, minimax squared Hellinger risk is from 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 nodes for fixed total-variation error below one, even when each leaf uses at most coordinates, . Optimal Kullback--Leibler (KL) approximation error is in either direction with at most nodes and leaf scopes , for fixed and . Node counts exclude leaf computation. For three fixed masks, optimal joint conditional KL has order when . 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 arithmetic operations and one root extraction.
查看此版本解读 →查看此版本原文 ↗