Home > Research > Publications & Outputs > Efficient and generalizable tuning strategies f...

Links

Text available via DOI:

View graph of relations

Efficient and generalizable tuning strategies for stochastic gradient MCMC

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Efficient and generalizable tuning strategies for stochastic gradient MCMC. / Coullon, Jeremie; South, Leah; Nemeth, Christopher.
In: Statistics and Computing, Vol. 33, No. 3, 66, 30.06.2023.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Coullon J, South L, Nemeth C. Efficient and generalizable tuning strategies for stochastic gradient MCMC. Statistics and Computing. 2023 Jun 30;33(3):66. Epub 2023 Apr 4. doi: 10.1007/s11222-023-10233-3

Author

Bibtex

@article{49d24bb940a041e8bc4ffb11d5267784,
title = "Efficient and generalizable tuning strategies for stochastic gradient MCMC",
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.",
keywords = "Hyperparameter optimization, Markov chain Monte Carlo, Stein discrepancy, Stochastic gradient",
author = "Jeremie Coullon and Leah South and Christopher Nemeth",
year = "2023",
month = jun,
day = "30",
doi = "10.1007/s11222-023-10233-3",
language = "English",
volume = "33",
journal = "Statistics and Computing",
issn = "0960-3174",
publisher = "Springer Netherlands",
number = "3",

}

RIS

TY - JOUR

T1 - Efficient and generalizable tuning strategies for stochastic gradient MCMC

AU - Coullon, Jeremie

AU - South, Leah

AU - Nemeth, Christopher

PY - 2023/6/30

Y1 - 2023/6/30

N2 - 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.

AB - 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.

KW - Hyperparameter optimization

KW - Markov chain Monte Carlo

KW - Stein discrepancy

KW - Stochastic gradient

U2 - 10.1007/s11222-023-10233-3

DO - 10.1007/s11222-023-10233-3

M3 - Journal article

AN - SCOPUS:85152680433

VL - 33

JO - Statistics and Computing

JF - Statistics and Computing

SN - 0960-3174

IS - 3

M1 - 66

ER -