English
Related papers

Related papers: Annealing in variational inference mitigates mode …

200 papers

Inverse problems, i.e., estimating parameters of physical models from experimental data, are ubiquitous in science and engineering. The Bayesian formulation is the gold standard because it alleviates ill-posedness issues and quantifies…

Machine Learning · Statistics 2024-05-28 Sharmila Karumuri , Ilias Bilionis

A new unimodal distribution family indexed by the mode and three other parameters is derived from a mixture of a Gumbel distribution for the maximum and a Gumbel distribution for the minimum. Properties of the proposed distribution are…

Methodology · Statistics 2024-07-02 Qingyang Liu , Xianzheng Huang , Haiming Zhou

A pre-trained unconditional diffusion model, combined with posterior sampling or maximum a posteriori (MAP) estimation techniques, can solve arbitrary inverse problems without task-specific training or fine-tuning. However, existing…

Machine Learning · Computer Science 2026-02-09 Sai Bharath Chandra Gutha , Ricardo Vinuesa , Hossein Azizpour

We develop an automated variational method for inference in models with Gaussian process (GP) priors and general likelihoods. The method supports multiple outputs and multiple latent functions and does not require detailed knowledge of the…

Machine Learning · Statistics 2018-11-06 Edwin V. Bonilla , Karl Krauth , Amir Dezfouli

We describe an adaptation of the simulated annealing algorithm to nonparametric clustering and related probabilistic models. This new algorithm learns nonparametric latent structure over a growing and constantly churning subsample of…

Machine Learning · Statistics 2019-10-25 Fritz Obermeyer , Jonathan Glidden , Eric Jonas

For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For…

Machine Learning · Statistics 2019-10-30 Robert S. MacKay

Sampling from multimodal distributions is a central challenge in Bayesian inference and machine learning. In light of hardness results for sampling -- classical MCMC methods, even with tempering, can suffer from exponential mixing times --…

Machine Learning · Statistics 2025-12-23 Holden Lee , Matheau Santana-Gijzen

Recently, 3D Gaussian Splatting has emerged as a promising approach for modeling 3D scenes using mixtures of Gaussians. The predominant optimization method for these models relies on backpropagating gradients through a differentiable…

Computer Vision and Pattern Recognition · Computer Science 2025-09-24 Toon Van de Maele , Ozan Catal , Alexander Tschantz , Christopher L. Buckley , Tim Verbelen

We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our…

Machine Learning · Computer Science 2012-12-05 James Hensman , Magnus Rattray , Neil D. Lawrence

Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational…

Machine Learning · Computer Science 2019-05-17 Ben Poole , Sherjil Ozair , Aaron van den Oord , Alexander A. Alemi , George Tucker

In Bayesian statistics, exploring high-dimensional multimodal posterior distributions poses major challenges for existing MCMC approaches. This paper introduces the Annealed Leap-Point Sampler (ALPS), which augments the target distribution…

Methodology · Statistics 2026-02-10 Nicholas G. Tawn , Matthew T. Moores , Hugo Queniat , Gareth O. Roberts

We propose a hybrid generative model for efficient sampling of high-dimensional, multimodal probability distributions for Bayesian inference. Traditional Monte Carlo methods, such as the Metropolis-Hastings and Langevin Monte Carlo sampling…

Machine Learning · Statistics 2025-05-14 Hoang Tran , Zezhong Zhang , Feng Bao , Dan Lu , Guannan Zhang

In the context of statistical learning, the Information Bottleneck method seeks a right balance between accuracy and generalization capability through a suitable tradeoff between compression complexity, measured by minimum description…

Information Theory · Computer Science 2021-02-16 Mohammad Mahdi Mahvari , Mari Kobayashi , Abdellatif Zaidi

Deep generative models for anomaly detection in multivariate time-series are typically trained by maximizing data likelihood. However, likelihood in observation space measures marginal density rather than conformity to structured temporal…

Artificial Intelligence · Computer Science 2026-03-13 David Baumgartner , Eliezer de Souza da Silva , Iñigo Urteaga

Generative Adversarial Networks (GANs) can achieve state-of-the-art sample quality in generative modelling tasks but suffer from the mode collapse problem. Variational Autoencoders (VAE) on the other hand explicitly maximize a…

Machine Learning · Computer Science 2019-09-30 Apratim Bhattacharyya , Mario Fritz , Bernt Schiele

Bayesian neural networks (BNNs) provide a formalism to quantify and calibrate uncertainty in deep learning. Current inference approaches for BNNs often resort to few-sample estimation for scalability, which can harm predictive performance,…

Machine Learning · Computer Science 2024-02-14 Zhe Zeng , Guy Van den Broeck

In this paper, we develop an unsupervised generative clustering framework that combines the Variational Information Bottleneck and the Gaussian Mixture Model. Specifically, in our approach, we use the Variational Information Bottleneck…

Machine Learning · Computer Science 2020-04-22 Yigit Ugur , George Arvanitakis , Abdellatif Zaidi

This paper is concerned with Bayesian inference when the likelihood is analytically intractable but can be unbiasedly estimated. We propose an annealed importance sampling procedure for estimating expectations with respect to the posterior.…

Methodology · Statistics 2014-02-26 M. -N. Tran , C. Strickland , M. K. Pitt , R. Kohn

The design of effective cooling strategies is a crucial component in simulated annealing algorithms based on the Metropolis method. Traditionally, this is achieved through inverse logarithmic decays of the temperature to ensure convergence…

Optimization and Control · Mathematics 2025-12-16 Frédéric Blondeel , Lorenzo Pareschi , Giovanni Samaey

Normalizing flows are tractable density models that can approximate complicated target distributions, e.g. Boltzmann distributions of physical systems. However, current methods for training flows either suffer from mode-seeking behavior,…