English
Related papers

Related papers: On the cost of Bayesian posterior mean strategy fo…

200 papers

This paper presents a detailed theoretical analysis of the Langevin Monte Carlo sampling algorithm recently introduced in Durmus et al. (Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau, 2016)…

Methodology · Statistics 2017-05-26 Nicolas Brosse , Alain Durmus , Éric Moulines , Marcelo Pereyra

In order to solve tasks like uncertainty quantification or hypothesis tests in Bayesian imaging inverse problems, we often have to draw samples from the arising posterior distribution. For the usually log-concave but high-dimensional…

Computation · Statistics 2025-01-23 Matthias J. Ehrhardt , Lorenz Kuger , Carola-Bibiane Schönlieb

Modern imaging methods rely strongly on Bayesian inference techniques to solve challenging imaging problems. Currently, the predominant Bayesian computation approach is convex optimisation, which scales very efficiently to high dimensional…

Computation · Statistics 2016-12-23 Alain Durmus , Eric Moulines , Marcelo Pereyra

This paper presents a new accelerated proximal Markov chain Monte Carlo methodology to perform Bayesian inference in imaging inverse problems with an underlying convex geometry. The proposed strategy takes the form of a stochastic relaxed…

This paper proposes a novel diffusion-based posterior sampling method within a plug-and-play (PnP) framework. Our approach constructs a probability transport from an easy-to-sample terminal distribution to the target posterior, using a…

Machine Learning · Statistics 2025-12-10 Jinyuan Chang , Chenguang Duan , Yuling Jiao , Ruoxuan Li , Jerry Zhijian Yang , Cheng Yuan

In this paper, we investigate a continuous time version of the Stochastic Langevin Monte Carlo method, introduced in [WT11], that incorporates a stochastic sampling step inside the traditional over-damped Langevin diffusion. This method is…

Machine Learning · Statistics 2023-01-10 Marelys Crespo Navas , Sébastien Gadat , Xavier Gendre

We study the problem of approximate sampling from non-log-concave distributions, e.g., Gaussian mixtures, which is often challenging even in low dimensions due to their multimodality. We focus on performing this task via Markov chain Monte…

Machine Learning · Statistics 2024-05-30 Tim Tsz-Kit Lau , Han Liu , Thomas Pock

We present a highly efficient proximal Markov chain Monte Carlo methodology to perform Bayesian computation in imaging problems. Similarly to previous proximal Monte Carlo approaches, the proposed method is derived from an approximation of…

Computation · Statistics 2020-03-20 Luis Vargas , Marcelo Pereyra , Konstantinos C. Zygalakis

Generative diffusion models have recently emerged as a powerful strategy to perform stochastic sampling in Bayesian inverse problems, delivering remarkably accurate solutions for a wide range of challenging applications. However, diffusion…

Computation · Statistics 2025-05-15 Abdul-Lateef Haji-Ali , Marcelo Pereyra , Luke Shaw , Konstantinos Zygalakis

We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$. In this context, if no additional density information is available, the randomized midpoint…

Statistics Theory · Mathematics 2023-06-19 Lu Yu , Avetik Karagulyan , Arnak Dalalyan

The problem of Bayesian reduced rank regression is considered in this paper. We propose, for the first time, to use Langevin Monte Carlo method in this problem. A spectral scaled Student prior distrbution is used to exploit the underlying…

Computation · Statistics 2021-02-16 The Tien Mai

Stochastic approximation methods play a central role in maximum likelihood estimation problems involving intractable likelihood functions, such as marginal likelihoods arising in problems with missing or incomplete data, and in parametric…

Computation · Statistics 2020-06-02 Valentin De Bortoli , Alain Durmus , Marcelo Pereyra , Ana F. Vidal

A key task in Bayesian statistics is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). However, without any assumptions, sampling (even approximately) can be #P-hard, and few…

Machine Learning · Computer Science 2018-12-03 Rong Ge , Holden Lee , Andrej Risteski

We study functional inequalities (Poincar\'e, Cheeger, log-Sobolev) for probability measures obtained as perturbations. Several explicit results for general measures as well as log-concave distributions are given.The initial goal of this…

Probability · Mathematics 2021-01-28 Patrick Cattiaux , Arnaud Guillin

We study the problem of sampling from a distribution $\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the…

Computation · Statistics 2016-07-04 Thomas Bonis

Discretized Langevin diffusions are efficient Monte Carlo methods for sampling from high dimensional target densities that are log-Lipschitz-smooth and (strongly) log-concave. In particular, the Euclidean Langevin Monte Carlo sampling…

Statistics Theory · Mathematics 2020-02-12 Kelvin Shuangjian Zhang , Gabriel Peyré , Jalal Fadili , Marcelo Pereyra

Langevin Monte Carlo (LMC) is a popular Bayesian sampling method. For the log-concave distribution function, the method converges exponentially fast, up to a controllable discretization error. However, the method requires the evaluation of…

Machine Learning · Statistics 2025-03-07 Zhiyan Ding , Qin Li

Classically, the continuous-time Langevin diffusion converges exponentially fast to its stationary distribution $\pi$ under the sole assumption that $\pi$ satisfies a Poincar\'e inequality. Using this fact to provide guarantees for the…

Statistics Theory · Mathematics 2024-07-11 Sinho Chewi , Murat A. Erdogdu , Mufan Bill Li , Ruoqi Shen , Matthew Zhang

Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling…

Computation · Statistics 2016-12-06 Arnak S. Dalalyan

A frequent matter of debate in Bayesian inversion is the question, which of the two principle point-estimators, the maximum-a-posteriori (MAP) or the conditional mean (CM) estimate is to be preferred. As the MAP estimate corresponds to the…

Statistics Theory · Mathematics 2015-06-18 Martin Burger , Felix Lucka
‹ Prev 1 2 3 10 Next ›