arXiv Statistics ML By Hans Olischl\"ager, Svenja Jedhoff, \v{S}imon Kucharsk\'y, Aayush Mishra, Stefan T. Radev, Paul B\"urkner

Mitigating Representation Gaps in Amortized Bayesian Inference with Auxiliary Supervision

Read the original on arXiv Statistics ML →

The Flow has not summarised this story yet — read it at arXiv Statistics ML.

arXiv AI
Oct 31

Learning to Bound: Monotonic, Calibrated Neural Upper Bounds for MPE Inference

The paper introduces Learning to Bound (L2B), a data‑driven framework that trains a neural predictor to produce admissible, monotonic upper bounds for Most Probable Explanation (MPE) inference in probabilistic graphical models. L2B achieves admissibility through statistical calibration and ensures progressive tightening via architectural constraints that enforce monotonicity. Experiments on challenging benchmarks show that L2B delivers tighter, monotonic bounds at orders‑of‑magnitude lower cost than classical methods and improves branch‑and‑bound performance on high‑treewidth instances.

By Akshay Vyas, Hailiang Dong, Shivvrat Arya, Brij Malhotra, Tahrima Rahman, Vibhav Gogate, Nicholas Ruozzi
arXiv Machine Learning
Oct 16

Amortized Factor Inference Networks for Posterior Inference

The paper introduces Amortized Factor Inference Networks (AFINs), a single inference network that can generalize across varying priors, likelihoods, latent dimensions, and observation counts. AFINs represent a model as a list of typed prior and likelihood factors and use an encode–merge–decode architecture to produce a Gaussian posterior approximation, with learned parameters independent of latent dimensionality or observation count. Experiments on synthetic and real datasets demonstrate that a single trained AFIN achieves competitive posterior approximations at significantly lower test‑time cost than NUTS and per‑task variational inference, with optional importance sampling further improving accuracy.

By Joohwan Ko, Justin Domke
arXiv Machine Learning
Jun 15

Minimum Distance Summaries for Robust Neural Posterior Estimation

arXiv:2602. 09161v2 Announce Type: replace-cross Abstract: Simulation-based inference (SBI) enables amortized Bayesian inference by first training a neural posterior estimator (NPE) on prior-simulator pairs, typically through low-dimensional summary statistics, which can then be cheaply reused for fast inference by querying it on new test observations.

By Sherman Khoo, Dennis Prangle, Song Liu, Mark Beaumont