arXiv:2601. 07944v2 Announce Type: replace-cross Abstract: Since the turn of the century, approximate Bayesian inference has steadily evolved as new computational techniques have been incorporated to handle increasingly complex, large-scale predictive problems.
By Roy Shivam Ram Shreshtth, Arnab Hazra, Gourab Mukherjee
arXiv:2310.04363v3 Announce Type: replace
Abstract: Autoregressive large language models (LLMs) compress knowledge from their training data through next-token conditional distributions. This limits t...
By Edward J. Hu, Moksh Jain, Eric Elmoznino, Younesse Kaddar, Guillaume Lajoie, Yoshua Bengio, Esmeralda S. Whitammer
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
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: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
arXiv:2610.18945v1 Announce Type: cross
Abstract: Amortized Bayesian inference uses simulations to perform Bayesian estimation when likelihoods are expensive or analytically unavailable. However, lea...
By Niek Stevenson, Paul-Christian B\"urkner, Andrew Heathcote, Stefan T. Radev
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
arXiv:2606. 09856v1 Announce Type: cross Abstract: Post-training Large Language Models (LLMs) for reasoning typically focuses on deductive tasks such as mathematics and coding where correctness is verifiable.
By Liyi Zhang, Akshay K. Jagadish, Brenden M. Lake, Thomas L. Griffiths
The paper introduces a two-way guidance framework that jointly learns summary statistics and posterior distributions for Bayesian simulation-based inference. By imposing a structural restriction on the learned summary, the method ensures that the posterior remains sufficient, while the posterior objective simultaneously steers the summary toward sufficiency. The authors provide theoretical guarantees on posterior estimation error and the deviation of the learned summary from sufficiency, outlining conditions on simulation budgets needed to recover increasingly concentrated posteriors as observation size grows.
By Percy S. Zhai, Max Pachman, Peverel D. Shipley, Jungeum Kim
arXiv:2609.37381v1 Announce Type: new
Abstract: Neural simulation-based inference (SBI) has been widely successful in inferring a relatively small number of interpretable parameters from potentially...
By Lars K\"uhmichel, Stefan T. Radev, Bhanu Prasanna Koppolu, Masoumeh Davoudi, Jerry M. Huang, Paul-Christian B\"urkner
The paper introduces LB-MCTS, a trajectory-structured optimization framework that combines Monte Carlo Tree Search, Bayesian Optimization, and Large Language Models to address the CASH problem in AutoML. It uses a shared tree state for algorithm selection, hyperparameter refinement, and synergy between BO and LLM proposals, with a reliability-aware policy that shifts from LLM-driven to BO-driven suggestions as the surrogate model improves. Experiments on 104 AMLB datasets show that LB-MCTS consistently outperforms existing BO-based, LLM-based, and hybrid baselines.
By Beicheng Xu, Weitong Qian, Lingching Tung, Yupeng Lu, Bin Cui
arXiv:2610.09886v1 Announce Type: cross
Abstract: Bayesian neural networks need not be fully stochastic to be universal conditional density approximators, but it remains open which parameters should...
By Marius P Linhard, Maurizio Filippone