arXiv AI September 25, 2026 By Ralf Herbrich, Rainer Schlosser, Jan Lemcke, Johann Ukrow, Anna Kazachkova, Nicolas Alder, Leonhard Hennicke, Theo Bardey, Nico Grimm, Luca Kleinschmidt, Philipp Kolbe, Cezary Kujath, Johanna Schlimme, Karl Matti Sch\"utz

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

Read the original on arXiv AI →

arXiv:2609. 29466v1 Announce Type: cross Abstract: Approximate message passing on factor graphs underlies two dominant families of probabilistic inference algorithms: expectation propagation (EP) and variational message passing (VMP).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning

Sep 1

Delta-AI: Local objectives for amortized inference in sparse graphical models

arXiv:2310.02423v3 Announce Type: replace Abstract: We present a new algorithm for amortized inference in sparse probabilistic graphical models (PGMs), which we call $\Delta$-amortized inference ($\D...

By Jean-Pierre Falet, Hae Beom Lee, Esmeralda S. Whitammer, Chen Sun, Dragos Secrieru, Thomas Jiralerspong, Dinghuai Zhang, Guillaume Lajoie, Yoshua Bengio

agents efficiency

arXiv AI

Aug 18

Information Geometry of Message Passing

arXiv:2608. 15922v1 Announce Type: cross Abstract: We show that the natural-gradient stationary condition of variational inference has an edge-local form on a Forney-style factor graph.

By Mykola Lukashchuk, Kyrylo Yemets, Alex Ledbetter, \.{I}smail \c{S}en\"oz

arXiv Machine Learning

Jun 4

In-Context Graphical Inference

arXiv:2606. 05042v1 Announce Type: new Abstract: Marginal inference in discrete graphical models forces a choice between exactness and scalability: exact algorithms are intractable for high-treewidth graphs, while iterative approximations (Belief Propagation, variational methods) sacrifice convergence guarantees on frustrated topologies.

By Zehua Cheng, Wei Dai, Jiahao Sun

llms benchmarks safety

arXiv AI

Jun 19

Information Lattice Learning as Probabilistic Graphical Model Structure Learning

arXiv:2606. 19366v1 Announce Type: cross Abstract: Information lattice learning (ILL) learns interpretable rules of a signal by alternately projecting the signal onto a partition lattice that encodes a hierarchy of abstractions and lifting selected rules back to the signal domain.

By Haizi Yu, Lav R. Varshney

arXiv AI

Jul 21

Uncovering Latent Reasoning Strategies in Language Models

arXiv:2607. 17674v1 Announce Type: cross Abstract: A language model $p_\theta(y \mid x)$ trained on reasoning tasks learns to solve problems via multiple distinct strategies, yet these strategies are implicit and entangled within the model's response distribution.

By Awni Altabaa, John Lafferty

llms benchmarks

arXiv AI

Jul 21

Breaking the Factorization Barrier in Diffusion Language Models

arXiv:2603. 00045v3 Announce Type: replace-cross Abstract: Diffusion language models theoretically allow for efficient parallel generation but are practically hindered by the ``factorization barrier'': the assumption that simultaneously predicted tokens are independent.

By Ian Li, Zilei Shao, Benjie Wang, Rose Yu, Guy Van den Broeck, Anji Liu

llms diffusion reinforcement-learning

One email a morning, machine-written

Related stories

Delta-AI: Local objectives for amortized inference in sparse graphical models

Information Geometry of Message Passing

In-Context Graphical Inference

Information Lattice Learning as Probabilistic Graphical Model Structure Learning

Uncovering Latent Reasoning Strategies in Language Models

Breaking the Factorization Barrier in Diffusion Language Models