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.

Federated Edge Intelligence and Edge Caching Mechanisms

“…Efficient sampling schemes, as suggested in [59][60][61][62], could further enhance the clientbalancing method, although additional research is required. Lastly, the peer-to-peer scenarios presented for side processing and P2P-FL, in conjunction with [63], merit further scrutiny for potential optimization fine-tuning.…”