Metraipolis › archive › dc_4cdbf32a06f0

Direct Message Approximation (DMA): A Consistency-Based Framework for Tractable Approximate Inference on Factor Graphs — arXiv:2609.29466

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29466
License (as archived)
CC0-1.0
Archived
2026-10-08T04:27:32.293Z
SHA-256 of the archived text
6a0dbd064ae93835b474cd10eca3f3409ef9eda19651e28c993c97804639244d
Stable URL of this page
https://metraipolis.com/documento/dc_4cdbf32a06f0

How to cite

Direct Message Approximation (DMA): A Consistency-Based Framework for Tractable Approximate Inference on Factor Graphs — arXiv:2609.29466 — arXiv (en), https://arxiv.org/abs/2609.29466 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4cdbf32a06f0 (Metraipolis archive dc_4cdbf32a06f0, sha256 6a0dbd064ae93835b474cd10eca3f3409ef9eda19651e28c993c97804639244d)
BibTeX
@misc{dc4cdbf32a06f0,
  title = {Direct Message Approximation (DMA): A Consistency-Based Framework for Tractable Approximate Inference on Factor Graphs — arXiv:2609.29466},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29466},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4cdbf32a06f0; sha256 6a0dbd064ae93835b474cd10eca3f3409ef9eda19651e28c993c97804639244d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29466. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Approximate message passing on factor graphs underlies two dominant families of probabilistic inference algorithms: expectation propagation (EP) and variational message passing (VMP). Both methods approximate the marginal at each factor edge, forcing an iterative round-robin schedule, risking negative-precision messages, and, for VMP, collapsing to point estimates at Dirac-delta factors. We introduce Direct Message Approximation (DMA), which approximates factor-to-variable messages directly rather than the marginal. For normalisable factors, we define a consistency condition (requiring exactness when all other incoming messages are Dirac deltas) to guide message construction. We prove a master theorem (proper messages, any graph) bounding marginal KL from message KL, with three structural corollaries: Dirac-input consistency, no EP-style inner-loop iteration, and no negative-precision messages. Further, we prove a complementary $O(1/r^2)$ guarantee for the inherently improper backward message of the product factor, whose closed-form treatment has resisted prior work. As a concrete instantiation, we derive explicit DMA messages for the product and leaky-ReLU factors and assemble a Bayesian neural network (BNN) inference algorithm with one forward/backward sweep per training example and no gradient learning-rate hyperparameter, validating that the structural guarantees translate to predictive uncertainty that widens in data-sparse regions, including under model mismatch.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-25 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.29466 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:50:58.072Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).