English
Related papers

Related papers: Bregman geometry-aware split Gibbs sampling for Ba…

200 papers

By formulating the inverse problem of partial differential equations (PDEs) as a statistical inference problem, the Bayesian approach provides a general framework for quantifying uncertainties. In the inverse problem of PDEs, parameters are…

Numerical Analysis · Mathematics 2026-02-10 Haoyu Lu , Junxiong Jia , Deyu Meng

Uncertainty quantification for large-scale inverse problems remains a challenging task. For linear inverse problems with additive Gaussian noise and Gaussian priors, the posterior is Gaussian but sampling can be challenging, especially for…

Numerical Analysis · Mathematics 2026-05-14 Elle Buser , Julianne Chung

We consider posterior sampling in the very common Bayesian hierarchical model in which observed data depends on high-dimensional latent variables that, in turn, depend on relatively few hyperparameters. When the full conditional over the…

Computation · Statistics 2016-10-24 Richard A. Norton , J. Andres Christen , Colin Fox

This paper considers the objective comparison of stochastic models to solve inverse problems, more specifically image restoration. Most often, model comparison is addressed in a supervised manner, that can be time-consuming and partly…

Computation · Statistics 2020-10-14 Benjamin Harroué , Jean-François Giovannelli , Marcelo Pereyra

The Hamiltonian Monte Carlo (HMC) method allows sampling from continuous densities. Favorable scaling with dimension has led to wide adoption of HMC by the statistics community. Modern auto-differentiating software should allow more…

Computation · Statistics 2022-08-17 Ian Langmore , Michael Dikovsky , Scott Geraedts , Peter Norgaard , Rob von Behren

Bayesian max-margin models have shown superiority in various practical applications, such as text categorization, collaborative prediction, social network link prediction and crowdsourcing, and they conjoin the flexibility of Bayesian…

Machine Learning · Statistics 2016-10-19 Wenbo Hu , Jun Zhu , Bo Zhang

Gibbs sampling is one of the most commonly used Markov Chain Monte Carlo (MCMC) algorithms due to its simplicity and efficiency. It cycles through the latent variables, sampling each one from its distribution conditional on the current…

Machine Learning · Computer Science 2024-08-26 Yanbo Wang , Wenyu Chen , Shimin Shan

This paper studies a new Bayesian algorithm for the joint reconstruction and classification of reflectance confocal microscopy (RCM) images, with application to the identification of human skin lentigo. The proposed Bayesian approach takes…

Machine Learning · Statistics 2017-03-07 Abdelghafour Halimi , Hadj Batatia , Jimmy Le Digabel , Gwendal Josse , Jean-Yves Tourneret

In recent years, the shortcomings of Bayesian posteriors as inferential devices have received increased attention. A popular strategy for fixing them has been to instead target a Gibbs measure based on losses that connect a parameter of…

Statistics Theory · Mathematics 2025-04-24 David T. Frazier , Jeremias Knoblauch , Jack Jewson , Christopher Drovandi

In Bayesian statistics, many problems can be expressed as the evaluation of the expectation of a quantity of interest with respect to the posterior distribution. Standard Monte Carlo method is often not applicable because the encountered…

Computation · Statistics 2011-10-11 James L. Beck , Konstantin M. Zuev

Sequential optimization methods are often confronted with the curse of dimensionality in high-dimensional spaces. Current approaches under the Gaussian process framework are still burdened by the computational complexity of tracking…

Machine Learning · Computer Science 2024-01-08 Zeji Yi , Yunyue Wei , Chu Xin Cheng , Kaibo He , Yanan Sui

Approximate Bayesian computation methods are useful for generative models with intractable likelihoods. These methods are however sensitive to the dimension of the parameter space, requiring exponentially increasing resources as this…

Computation · Statistics 2026-02-09 Grégoire Clarté , Christian P. Robert , Robin Ryder , Julien Stoehr

Hamiltonian Monte Carlo and underdamped Langevin Monte Carlo are state-of-the-art methods for taking samples from high-dimensional distributions with a differentiable density function. To generate samples, they numerically integrate…

Computation · Statistics 2025-05-20 Jakob Robnik , Reuben Cohn-Gordon , Uroš Seljak

This paper introduces a stochastic plug-and-play (PnP) sampling algorithm that leverages variable splitting to efficiently sample from a posterior distribution. The algorithm based on split Gibbs sampling (SGS) draws inspiration from the…

Machine Learning · Statistics 2023-04-24 Florentin Coeurdoux , Nicolas Dobigeon , Pierre Chainais

We propose a multilevel Monte Carlo-FEM algorithm to solve elliptic Bayesian inverse problems with "Besov random tree prior". These priors are given by a wavelet series with stochastic coefficients, and certain terms in the expansion…

Numerical Analysis · Mathematics 2023-02-03 Andreas Stein , Viet Ha Hoang

The use of non-differentiable priors in Bayesian statistics has become increasingly popular, in particular in Bayesian imaging analysis. Current state of the art methods are approximate in the sense that they replace the posterior with a…

Methodology · Statistics 2021-03-17 Jacob Vorstrup Goldman , Torben Sell , Sumeetpal Sidhu Singh

Hybrid Monte-Carlo (HMC) sampling smoother is a fully non-Gaussian four-dimensional data assimilation algorithm that works by directly sampling the posterior distribution formulated in the Bayesian framework. The smoother in its original…

Numerical Analysis · Computer Science 2016-12-21 Ahmed Attia , Razvan Stefanescu , Adrian Sandu

In this chapter we provide a thorough overview of the use of energy-based models (EBMs) in the context of inverse imaging problems. EBMs are probability distributions modeled via Gibbs densities $p(x) \propto \exp{-E(x)}$ with an…

Image and Video Processing · Electrical Eng. & Systems 2025-09-17 Andreas Habring , Martin Holler , Thomas Pock , Martin Zach

Bayesian inference in deep neural networks is challenging due to the high-dimensional, strongly multi-modal parameter posterior density landscape. Markov chain Monte Carlo approaches asymptotically recover the true posterior but are…

Various Markov chain Monte Carlo (MCMC) methods are studied to improve upon random walk Metropolis sampling, for simulation from complex distributions. Examples include Metropolis-adjusted Langevin algorithms, Hamiltonian Monte Carlo, and…

Computation · Statistics 2020-05-19 Zexi Song , Zhiqiang Tan
‹ Prev 1 4 5 6 7 8 10 Next ›