English
Related papers

Related papers: Scalable inference for crossed random effects mode…

200 papers

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

In this paper, we analyze the convergence rate of a collapsed Gibbs sampler for crossed random effects models. Our results apply to a substantially larger range of models than previous works, including models that incorporate missingness…

Computation · Statistics 2021-10-22 Swarnadip Ghosh , Chenyang Zhong

We develop sampling algorithms to fit Bayesian hierarchical models, the computational complexity of which scales linearly with the number of observations and the number of parameters in the model. We focus on crossed random effect and…

Computation · Statistics 2025-01-03 Omiros Papaspiliopoulos , Timothée Stumpf-Fétizon , Giacomo Zanella

We develop a framework for approximating collapsed Gibbs sampling in generative latent variable cluster models. Collapsed Gibbs is a popular MCMC method, which integrates out variables in the posterior to improve mixing. Unfortunately for…

Machine Learning · Statistics 2018-07-23 Christopher Aicher , Emily B. Fox

Sparse regression based on global-local shrinkage priors are increasingly used for Bayesian modeling of modern high-dimensional data, but scaling up the Gibbs sampler for posterior inference remains a challenge. While much effort has gone…

Methodology · Statistics 2026-05-08 Andrew Chin , Xiyu Ding , Akihiko Nishimura

Regression models with crossed random effect errors can be very expensive to compute. The cost of both generalized least squares and Gibbs sampling can easily grow as $N^{3/2}$ (or worse) for $N$ observations. Papaspiliopoulos et al. (2020)…

Methodology · Statistics 2021-03-22 Swarnadip Ghosh , Trevor Hastie , Art B. Owen

For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of…

Machine Learning · Statistics 2018-01-30 Vadim Smolyakov , Qiang Liu , John W. Fisher

We consider various versions of adaptive Gibbs and Metropolis within-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run, by learning as they go in an attempt to…

Computation · Statistics 2010-01-19 Krzysztof Latuszynski , Jeffrey S. Rosenthal

Finite mixture models are frequently used to uncover latent structures in high-dimensional datasets (e.g.\ identifying clusters of patients in electronic health records). The inference of such structures can be performed in a Bayesian…

The cumulative shrinkage process is an increasing shrinkage prior that can be employed within models in which additional terms are supposed to play a progressively negligible role. A natural application is to Gaussian factor models, where…

Computation · Statistics 2020-08-13 Sirio Legramanti

The theory of two projections is utilized to study two-component Gibbs samplers. Through this theory, previously intractable problems regarding the asymptotic variances of two-component Gibbs samplers are reduced to elementary matrix…

Statistics Theory · Mathematics 2024-03-11 Qian Qin

We consider various versions of adaptive Gibbs and Metropolis-within-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run by learning as they go in an attempt to…

Computation · Statistics 2013-02-28 Krzysztof Łatuszyński , Gareth O. Roberts , Jeffrey S. Rosenthal

The crossed random effects model is widely used, finding applications in various fields such as longitudinal studies, e-commerce, and recommender systems, among others. However, these models encounter scalability challenges, as the…

Methodology · Statistics 2025-10-21 Disha Ghandwani , Swarnadip Ghosh , Trevor Hastie , Art B. Owen

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…

Computation · Statistics 2016-04-20 Olivier Féron , François Orieux , Jean-François Giovannelli

The popularity of Adaptive MCMC has been fueled on the one hand by its success in applications, and on the other hand, by mathematically appealing and computationally straightforward optimisation criteria for the Metropolis algorithm…

Computation · Statistics 2018-01-30 Cyril Chimisov , Krzysztof Latuszynski , Gareth Roberts

Bayesian inference for graphical models has received much attention in the literature in recent years. It is well known that when the graph G is decomposable, Bayesian inference is significantly more tractable than in the general…

Methodology · Statistics 2015-05-05 Kshitij Khare , Bala Rajaratnam , Abhishek Saha

The Gibbs sampler (GS) is a crucial algorithm for approximating complex calculations, and it is justified by Markov chain theory, the alternating projection theorem, and $I$-projection, separately. We explore the equivalence between these…

Computation · Statistics 2024-10-15 Kun-Lin Kuo , Yuchung J. Wang

Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm for hidden Markov models, in a…

Machine Learning · Statistics 2015-12-08 Pengyu Wang , Phil Blunsom

We study the convergence properties of the Gibbs Sampler in the context of posterior distributions arising from Bayesian analysis of conditionally Gaussian hierarchical models. We develop a multigrid approach to derive analytic expressions…

Computation · Statistics 2019-06-27 Giacomo Zanella , Gareth Roberts

The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this paper, we introduce a herding variant of this algorithm, called herded Gibbs, that is entirely deterministic. We prove that herded Gibbs…

Machine Learning · Computer Science 2013-03-19 Luke Bornn , Yutian Chen , Nando de Freitas , Mareija Eskelin , Jing Fang , Max Welling
‹ Prev 1 2 3 10 Next ›