Skip to content
DraconiticResearch
Search Sources API
181,686 studies31 sourcesUpdated 20 min ago
PreprintarXiv licencearXiv

HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC

Abstract

Stochastic gradient Markov chain Monte Carlo (SGMCMC) methods enable scalable Bayesian inference, but their performance depends strongly on hyperparameters such as the step size, mini-batch size, and number of leapfrog steps. Since most SGMCMC algorithms lack a Metropolis-Hastings acceptance rate, standard acceptance-based tuning methods are not directly applicable. We propose HyperMC, a multi-fidelity tuning framework that combines Hyperband-style resource allocation with kernel Stein discrepancy (KSD) evaluation. By running multiple successive-halving brackets, HyperMC balances broad exploration of a continuous hyperparameter space with increasingly accurate evaluation of promising configurations under a fixed computational budget. We further introduce Robust HyperMC, which uses global grid initialization followed by elite-guided local refinement to reduce sensitivity to random candidate generation and noisy finite-budget evaluations. Under suitable approximation and concentration conditions for the estimated KSD, we establish that the successive-halving component selects a near-optimal configuration among the sampled candidates with high probability and derive a sufficient computational budget for successful selection. Experiments on logistic regression, probabilistic matrix factorization, and Bayesian neural networks show that HyperMC improves posterior approximation or predictive calibration relative to MAMBA, grid search, and heuristic baselines, while Robust HyperMC yields more stable and reproducible tuning results.

Related

  1. Distributed Grid Search for Hyperparameter Tuning
    Constança De Herdeiro Cachim, Andrea Martin, Nicola Bastianello
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Statistically Valid Post-Training Hyperparameter Selection: From Tuning to Guarantees
    Amirmohammad Farzaneh, Osvaldo Simeone
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. The Challenges of Hyperparameter Tuning for Accurate Causal Effect Estimation.
    Damian Machlanski, Spyridon Samothrakis, Paul Clarke
    Machine learningPeer-reviewedCC BYFull text1 citedStatisticsEurope PMC
  4. Self-Supervised Tuning of Low-Fidelity Optimization Models via High-Fidelity Feedback
    Gonzalo E. Constante-Flores, André H. Quisaguano-Paredes, Asha Ramanujam +2
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Active Pilot Sampling for Multi-fidelity Estimation in Stochastic Optimization
    Thomas E. Coons, Aniket Jivani, Xun Huan
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{tan2026hypermc,
  title = {{HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC}},
  author = {Ming Tan and Xiyun Jiao},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.02138},
  eprint = {2609.02138},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.02138},
}
RIS
TY  - UNPB
TI  - HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC
AU  - Ming Tan
AU  - Xiyun Jiao
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.02138
UR  - https://arxiv.org/abs/2609.02138
AB  - Stochastic gradient Markov chain Monte Carlo (SGMCMC) methods enable scalable Bayesian inference, but their performance depends strongly on hyperparameters such as the step size, mini-batch size, and number of leapfrog steps. Since most SGMCMC algorithms lack a Metropolis-Hastings acceptance rate, standard acceptance-based tuning methods are not directly applicable. We propose HyperMC, a multi-fidelity tuning framework that combines Hyperband-style resource allocation with kernel Stein discrepancy (KSD) evaluation. By running multiple successive-halving brackets, HyperMC balances broad exploration of a continuous hyperparameter space with increasingly accurate evaluation of promising configurations under a fixed computational budget. We further introduce Robust HyperMC, which uses global grid initialization followed by elite-guided local refinement to reduce sensitivity to random candidate generation and noisy finite-budget evaluations. Under suitable approximation and concentration conditions for the estimated KSD, we establish that the successive-halving component selects a near-optimal configuration among the sampled candidates with high probability and derive a sufficient computational budget for successful selection. Experiments on logistic regression, probabilistic matrix factorization, and Bayesian neural networks show that HyperMC improves posterior approximation or predictive calibration relative to MAMBA, grid search, and heuristic baselines, while Robust HyperMC yields more stable and reproducible tuning results.
ER  -