Efficient and generalizable tuning strategies for stochastic gradient MCMC

Coullon, Jeremie and South, Leah and Nemeth, Christopher (2023) Efficient and generalizable tuning strategies for stochastic gradient MCMC. Statistics and Computing, 33 (3): 66. ISSN 0960-3174

Full text not available from this repository.

Abstract

Stochastic gradient Markov chain Monte Carlo (SGMCMC) is a popular class of algorithms for scalable Bayesian inference. However, these algorithms include hyperparameters such as step size or batch size that influence the accuracy of estimators based on the obtained posterior samples. As a result, these hyperparameters must be tuned by the practitioner and currently no principled and automated way to tune them exists. Standard Markov chain Monte Carlo tuning methods based on acceptance rates cannot be used for SGMCMC, thus requiring alternative tools and diagnostics. We propose a novel bandit-based algorithm that tunes the SGMCMC hyperparameters by minimizing the Stein discrepancy between the true posterior and its Monte Carlo approximation. We provide theoretical results supporting this approach and assess various Stein-based discrepancies. We support our results with experiments on both simulated and real datasets, and find that this method is practical for a wide range of applications.

Item Type:
Journal Article
Journal or Publication Title:
Statistics and Computing
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2614
Subjects:
?? hyperparameter optimizationmarkov chain monte carlostein discrepancystochastic gradienttheoretical computer sciencestatistics and probabilitystatistics, probability and uncertaintycomputational theory and mathematics ??
ID Code:
195374
Deposited By:
Deposited On:
06 Jun 2023 08:55
Refereed?:
Yes
Published?:
Published
Last Modified:
13 Sep 2024 14:45