English
Related papers

Related papers: Fast Parallel SAME Gibbs Sampling on General Discr…

200 papers

We consider Bayesian inference from multiple time series described by a common state-space model (SSM) structure, but where different subsets of parameters are shared between different submodels. An important example is disease-dynamics,…

Methodology · Statistics 2022-10-17 Anna Wigren , Fredrik Lindsten

This paper derives two new optimization-driven Monte Carlo algorithms inspired from variable splitting and data augmentation. In particular, the formulation of one of the proposed approaches is closely related to the alternating direction…

Methodology · Statistics 2019-03-27 Maxime Vono , Nicolas Dobigeon , Pierre Chainais

Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvantages: collapsed Gibbs sampling is unbiased but is also…

Machine Learning · Computer Science 2012-06-18 Max Welling , Yee Whye Teh , Hilbert Kappen

We consider Particle Gibbs (PG) as a tool for Bayesian analysis of non-linear non-Gaussian state-space models. PG is a Monte Carlo (MC) approximation of the standard Gibbs procedure which uses sequential MC (SMC) importance sampling inside…

Computation · Statistics 2018-04-18 Oliver Grothe , Tore Selland Kleppe , Roman Liesenfeld

Bayesian feature allocation models are a popular tool for modelling data with a combinatorial latent structure. Exact inference in these models is generally intractable and so practitioners typically apply Markov Chain Monte Carlo (MCMC)…

Computation · Statistics 2020-01-28 Alexandre Bouchard-Côté , Andrew Roth

This paper develops a slice sampler for Bayesian linear regression models with arbitrary priors. The new sampler has two advantages over current approaches. One, it is faster than many custom implementations that rely on auxiliary latent…

Computation · Statistics 2018-06-18 P. Richard Hahn , Jingyu He , Hedibert Lopes

Gibbs sampling is a Markov chain Monte Carlo method that is often used for learning and inference on graphical models. Minibatching, in which a small random subset of the graph is used at each iteration, can help make Gibbs sampling scale…

Machine Learning · Computer Science 2019-11-25 Ruqi Zhang , Christopher De Sa

The inadequate mixing of conventional Markov Chain Monte Carlo (MCMC) methods for multi-modal distributions presents a significant challenge in practical applications such as Bayesian inference and molecular dynamics. Addressing this, we…

Machine Learning · Statistics 2024-05-30 Wenlin Chen , Mingtian Zhang , Brooks Paige , José Miguel Hernández-Lobato , David Barber

Bayesian regression remains a simple but effective tool based on Bayesian inference techniques. For large-scale applications, with complicated posterior distributions, Markov Chain Monte Carlo methods are applied. To improve the well-known…

Computation · Statistics 2020-09-28 Joris Tavernier , Jaak Simm , Adam Arany , Karl Meerbergen , Yves Moreau

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

Inferring parameters and testing hypotheses from gravitational wave signals is a computationally intensive task central to modern astrophysics. Nested sampling, a Bayesian inference technique, has become an established standard for this in…

Instrumentation and Methods for Astrophysics · Physics 2025-09-30 David Yallup , Metha Prathaban , James Alvey , Will Handley

Sampling from the full posterior distribution of high-dimensional non-linear, non-Gaussian latent dynamical models presents significant computational challenges. While Particle Gibbs (also known as conditional sequential Monte Carlo) is…

Computation · Statistics 2025-03-05 Adrien Corenflos , Simo Särkkä

We consider Bayesian linear regression with sparsity-inducing prior and design efficient sampling algorithms leveraging posterior contraction properties. A quasi-likelihood with Gaussian spike-and-slab (that is favorable both statistically…

Computation · Statistics 2023-07-13 Qijia Jiang

This paper addresses the issue of inversion in cases where (1) the observation system is modeled by a linear transformation and additive noise, (2) the problem is ill-posed and regularization is introduced in a Bayesian framework by an a…

Machine Learning · Statistics 2026-02-12 Jean-François Giovannelli

This article presents new methodology for sample-based Bayesian inference when data are partitioned and communication between the parts is expensive, as arises by necessity in the context of "big data" or by choice in order to take…

Methodology · Statistics 2022-11-01 Marc Box

Bayesian hierarchical Poisson models are an essential tool for analyzing count data. However, designing efficient algorithms to sample from the posterior distribution of the target parameters remains a challenging task for this class of…

Methodology · Statistics 2025-02-10 Aldo Gardini , Fedele Greco , Carlo Trivisano

Sharpness-Aware Minimization (SAM) is an optimization method that improves generalization performance of machine learning models. Despite its superior generalization, SAM has not been actively used in real-world applications due to its…

Machine Learning · Computer Science 2025-03-17 Junhyuk Jo , Jihyun Lim , Sunwoo Lee

This paper presents parallel-in-time state estimation methods for systems with Slow-Rate inTegrated Measurements (SRTM). Integrated measurements are common in various applications, and they appear in analysis of data resulting from…

Computation · Statistics 2024-10-02 Fatemeh Yaghoobi , Simo Särkkä

The pairwise influence matrix of Dobrushin has long been used as an analytical tool to bound the rate of convergence of Gibbs sampling. In this work, we use Dobrushin influence as the basis of a practical tool to certify and efficiently…

Machine Learning · Statistics 2017-07-20 Ioannis Mitliagkas , Lester Mackey

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