paper-with-me

Papers

Preferential Subsampling for Stochastic Gradient Langevin Dynamics

2022-10-28 · Srshti Putcha, Christopher Nemeth, Paul Fearnhead

Stochastic gradient MCMC (SGMCMC) offers a scalable alternative to traditional MCMC, by constructing an unbiased estimate of the gradient of the log-posterior with a small, uniformly-weighted subsample of the data. While efficient to compute, the resulting gradient estimator may exhibit a high variance and impact sampler performance. The problem of variance control has been traditionally addressed by constructing a better stochastic gradient estimator, often using control variates. We propose to use a discrete, non-uniform probability distribution to preferentially subsample data points that have a greater impact on the stochastic gradient. In addition, we present a method of adaptively adjusting the subsample size at each iteration of the algorithm, so that we increase the subsample size in areas of the sample space where the gradient is harder to estimate. We demonstrate that such an approach can maintain the same level of accuracy while substantially reducing the average subsample size that is used.

📄 PDF Abstract BibTeX arXiv:2210.16189

Code (1)

srshtiputcha/sgmcmc_preferential_subsampling 공식 구현 jax

Similar Papers 제목 키워드 기반

Subsampling Error in Stochastic Gradient Langevin Diffusions

2023-05-23 · Kexin Jin, ChenGuang Liu, Jonas Latz

The Stochastic Gradient Langevin Dynamics (SGLD) are popularly used to approximate Bayesian posterior distributions in statistical learning procedures with large-scale data. As opposed to many usual Markov chain Monte Ca…

Safe, Scalable, and Accurate Bayes Posterior Sampling for Large-Data Generalized Linear Mixed Models

2026-04-28 · Youngsoo Baek, Samuel I. Berchuck arxiv

We consider the problem of scalable sampling algorithms to fit Bayesian generalized linear mixed models on large datasets. Stochastic gradient Langevin dynamics, coupled with smooth re-parameterizations of variance param…

Bayesian Inference

Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization

2017-07-20 · NeurIPS 2018 12 · Pan Xu, Jinghui Chen, Difan Zou, Quanquan Gu

We present a unified framework to analyze the global convergence of Langevin dynamics based algorithms for nonconvex finite-sum optimization with $n$ component functions. At the core of our analysis is a direct analysis …

Variance Reduction in Stochastic Gradient Langevin Dynamics

2016-12-01 · NeurIPS 2016 12 · Kumar Avinava Dubey, Sashank J. Reddi, Sinead A. Williamson, Barnabas Poczos 외

Stochastic gradient-based Monte Carlo methods such as stochastic gradient Langevin dynamics are useful tools for posterior inference on large scale datasets in many machine learning applications. These methods scale to l…

BIG-bench Machine Learning

Federated Stochastic Gradient Langevin Dynamics

2020-04-23 · Khaoula El Mekkaoui, Diego Mesquita, Paul Blomstedt, Samuel Kaski

Stochastic gradient MCMC methods, such as stochastic gradient Langevin dynamics (SGLD), employ fast but noisy gradient estimates to enable large-scale posterior sampling. Although we can easily extend SGLD to distributed…

Federated LearningMetric Learning