English
Related papers

Related papers: Low Rank Independence Samplers in Bayesian Inverse…

200 papers

Bayesian hierarchical models have been demonstrated to provide efficient algorithms for finding sparse solutions to ill-posed inverse problems. The models comprise typically a conditionally Gaussian prior model for the unknown, augmented by…

Numerical Analysis · Mathematics 2023-03-31 Daniela Calvetti , Erkki Somersalo

The posterior probability distribution for a set of model parameters encodes all that the data have to tell us in the context of a given model; it is the fundamental quantity for Bayesian parameter estimation. In order to infer the…

Instrumentation and Methods for Astrophysics · Physics 2015-06-16 Rupert Allison , Joanna Dunkley

Inverse problems are prevalent in both scientific research and engineering applications. In the context of Bayesian inverse problems, sampling from the posterior distribution can be particularly challenging when the forward models are…

Computation · Statistics 2026-02-17 Zhihang Xu , Xiaoyu Zhu , Daoji Li , Qifeng Liao

We study Bayesian estimation of mixture models and argue in favor of fitting the marginal posterior distribution over component assignments directly, rather than Gibbs sampling from the joint posterior on components and parameters as is…

Computation · Statistics 2025-11-03 M. E. J. Newman

This paper considers properties of an optimization based sampler for targeting the posterior distribution when the likelihood is intractable and auxiliary statistics are used to summarize information in the data. Our reverse sampler…

Methodology · Statistics 2015-12-02 Jean-Jacques Forneron , Serena Ng

A simple and efficient adaptive Markov Chain Monte Carlo (MCMC) method, called the Metropolized Adaptive Subspace (MAdaSub) algorithm, is proposed for sampling from high-dimensional posterior model distributions in Bayesian variable…

Methodology · Statistics 2023-01-04 Christian Staerk , Maria Kateri , Ioannis Ntzoufras

Doubly intractable models are encountered in a number of fields, e.g. social networks, ecology and epidemiology. Inference for such models requires the evaluation of a likelihood function, whose normalising factor depends on the model…

Methodology · Statistics 2025-08-25 Yu Yang , Matias Quiroz , Robert Kohn , Scott A. Sisson

Posterior sampling by Monte Carlo methods provides a more comprehensive solution approach to inverse problems than computing point estimates such as the maximum posterior using optimization methods, at the expense of usually requiring many…

Numerical Analysis · Mathematics 2024-11-28 Paolo Villani , Daniel Andrés-Arcones , Jörg F. Unger , Martin Weiser

Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for Bayesian exponential random graph models. Different forms of adaptive Metropolis-Hastings proposals (vertical, horizontal and…

Computation · Statistics 2014-09-18 Alberto Caimo , Antonietta Mira

We develop a new method to sample from posterior distributions in hierarchical models without using Markov chain Monte Carlo. This method, which is a variant of importance sampling ideas, is generally applicable to high-dimensional models…

Computation · Statistics 2015-03-19 Michael Braun , Paul Damien

We propose a very fast approximate Markov Chain Monte Carlo (MCMC) sampling framework that is applicable to a large class of sparse Bayesian inference problems, where the computational cost per iteration in several models is of order…

Computation · Statistics 2021-08-17 Yves Atchadé , Liwei Wang

Many inverse problems focus on recovering a quantity of interest that is a priori known to exhibit either discontinuous or smooth behavior. Within the Bayesian approach to inverse problems, such structural information can be encoded using…

Computation · Statistics 2024-07-16 Angelina Senchukova , Felipe Uribe , Lassi Roininen

We propose an efficient way to sample from a class of structured multivariate Gaussian distributions which routinely arise as conditional posteriors of model parameters that are assigned a conditionally Gaussian prior. The proposed…

Computation · Statistics 2016-06-28 Anirban Bhattacharya , Antik Chakraborty , Bani K. Mallick

We propose an algorithm for the efficient and robust sampling of the posterior probability distribution in Bayesian inference problems. The algorithm combines the local search capabilities of the Manifold Metropolis Adjusted Langevin…

Achieving robust uncertainty quantification for deep neural networks represents an important requirement in many real-world applications of deep learning such as medical imaging where it is necessary to assess the reliability of a neural…

Machine Learning · Computer Science 2024-03-15 Tim Rensmeyer , Oliver Niggemann

We present Bayesian techniques for solving inverse problems which involve mean-square convergent random approximations of the forward map. Noisy approximations of the forward map arise in several fields, such as multiscale problems and…

Numerical Analysis · Mathematics 2021-11-08 Giacomo Garegnani

We study Bayesian inference methods for solving linear inverse problems, focusing on hierarchical formulations where the prior or the likelihood function depend on unspecified hyperparameters. In practice, these hyperparameters are often…

Numerical Analysis · Mathematics 2018-08-01 Qingping Zhou , Wenqing Liu , Jinglai Li , Youssef M. Marzouk

Bayesian inference with deep generative prior has received considerable interest for solving imaging inverse problems in many scientific and engineering fields. The selection of the prior distribution is learned from, and therefore an…

Machine Learning · Statistics 2023-10-30 Jiayu Qian , Yuanyuan Liu , Jingya Yang , Qingping Zhou

Bayesian neural learning feature a rigorous approach to estimation and uncertainty quantification via the posterior distribution of weights that represent knowledge of the neural network. This not only provides point estimates of optimal…

Machine Learning · Computer Science 2018-11-13 Rohitash Chandra , Konark Jain , Ratneel V. Deo , Sally Cripps

A significant part of MCMC methods can be considered as the Metropolis-Hastings (MH) algorithm with different proposal distributions. From this point of view, the problem of constructing a sampler can be reduced to the question - how to…

Machine Learning · Statistics 2019-06-11 Kirill Neklyudov , Evgenii Egorov , Pavel Shvechikov , Dmitry Vetrov