arXiv Machine Learning By Maren Mahsereci, Toni Karvonen

Bayesian Quadrature

Read the original on arXiv Machine Learning →

This survey article reviews Bayesian quadrature, a probabilistic, model‑based method for numerical integration and expectation estimation. It provides a systematic taxonomy of Bayesian quadrature techniques across modelling, inference, and sampling, presents theoretical guarantees, and includes a controlled numerical study illustrating the impact of different methodological choices. The paper also discusses practical challenges, limitations, and offers an extensive bibliography covering machine learning, statistics, mathematics, and engineering applications.

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 Machine Learning.

arXiv Machine Learning
Jul 14

Hierarchical Bayesian Quadrature

arXiv:2607. 10793v1 Announce Type: new Abstract: Numerical integration is a cornerstone of various scientific computing applications, such as engineering simulations and model evidence computations in probabilistic machine learning.

By Tim Weiland, Toni Karvonen, Philipp Hennig
arXiv Statistics ML
Aug 28

A Two-step Metropolis Hastings Method for Bayesian Empirical Likelihood Computation with Application to Quantile Regression and Bayesian Model Selection

The paper introduces a two-step Metropolis–Hastings algorithm designed to efficiently sample from Bayesian empirical likelihood (BayesEL) posterior distributions, addressing challenges posed by the complex, often non‑convex support of empirical likelihood. The method leverages current parameter values and estimating equations to propose new values for remaining parameters, making it suitable for problems with discontinuous estimating equations such as simultaneous quantile regression. Additionally, the approach extends naturally to BayesEL model selection via reversible‑jump MCMC, and the authors demonstrate its utility through several real‑life applications.

By Sanjay Chaudhuri, Teng Yin, Snehashis Chakraborty, Rupsa Roy
arXiv Machine Learning
Sep 25

Nuclear Norm-Regularized Bayesian Matrix Completion

The paper introduces a Bayesian approach to matrix completion that uses a nuclear norm-based prior and addresses the challenge of unknown noise variance by placing a prior on it. It presents the first sampler for this model, providing a non‑asymptotic polynomial‑time guarantee in terms of matrix dimensions and desired accuracy. The method discretizes the noise precision and employs thermodynamic integration to construct a categorical posterior, offering a feasibility result for Bayesian sampling in non‑log‑concave settings.

By Calvin Tolbert