arXiv Machine Learning September 3, 2026 By Ming Tan, Xiyun Jiao

HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC

Read the original on arXiv Machine Learning →

HyperMC is a multi‑fidelity hyperparameter tuning framework for stochastic gradient Markov chain Monte Carlo (SGMCMC) that combines Hyperband-style resource allocation with kernel Stein discrepancy (KSD) evaluation. It uses successive‑halving brackets to explore a continuous hyperparameter space while progressively refining promising configurations within a fixed computational budget. Robust HyperMC further introduces global grid initialization and elite‑guided local refinement to reduce sensitivity to random candidate generation and noisy evaluations, and theoretical analysis shows that the successive‑halving component selects a near‑optimal configuration with high probability under suitable conditions.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 2

Efficient Weighted Sampling via Score-based Generative Models

arXiv:2502. 04646v2 Announce Type: replace-cross Abstract: Weighted sampling -- sampling from a probability density function (PDF) proportional to the product of a base PDF and a weight function -- is a fundamental technique with wide-ranging applications in variance reduction, biased sampling, data augmentation, and more.

By Heasung Kim, Taekyun Lee, Hyeji Kim, Gustavo de Veciana

diffusion benchmarks

arXiv AI

Aug 26

Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity

The paper introduces KENDO, a unified framework that combines Ensemble Gaussian Processes with disagreement‑aware acquisition strategies to address hyperparameter selection in Bayesian optimization and active learning. By replacing costly hyperparameter sampling with a kernel ensemble and adaptive Bayesian weighting, KENDO‑BO and KENDO‑AL provide self‑correcting mechanisms tailored to their respective tasks. Experiments on synthetic and real‑world benchmarks show that KENDO‑BO matches or outperforms state‑of‑the‑art methods while cutting computational cost up to fivefold, and KENDO‑AL delivers better predictive calibration with up to 27‑times speedup compared to MCMC‑based baselines.

By Heng Zhang, Haotian Xiang, Qin Lu, Konstantinos D. Polyzos, Tara Javidi

benchmarks

arXiv Machine Learning

Jun 9

Large-scale empirical tuning and comparison of default optimizers for variational inference

arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.

By Trevor Campbell, Jonathan H. Huggins, Kyurae Kim, Charles C. Margossian

benchmarks

arXiv Machine Learning

Aug 7

Kastor: An efficient fine-tuning strategy for generative emulation of PDE simulations

arXiv:2608. 06107v1 Announce Type: new Abstract: Machine learning offers a promising avenue to accelerate physical simulations by replacing computationally expensive traditional Partial Differential Equation (PDE) solvers with fast, differentiable surrogate models.

By Guillaume Couairon, Alexis Jacq, Yu-Han Wu, Renu Singh, Yana Hasson, Quentin Berthet, Romuald Elie

diffusion fine-tuning benchmarks

arXiv AI

Jun 2

Computation-Aware Kalman Filtering with Model Selection for Neural Dynamics

arXiv:2606. 01468v1 Announce Type: cross Abstract: Due to their explicit priors and ability to model uncertainty, Bayesian methods have played a major role in dynamical latent variable modeling of single-cell neural recordings.

By JR Huml, Jonathan Wenger, John P. Cunningham

arXiv Machine Learning

Oct 7

Direct Regret Optimization in Bayesian Optimization

arXiv:2507.06529v2 Announce Type: replace Abstract: Bayesian optimization (BO) is a powerful paradigm for optimizing expensive black-box functions. Traditional BO methods typically rely on separate h...

By Fengxue Zhang, Yuxin Chen

llms benchmarks

One email a morning, machine-written

Related stories

Efficient Weighted Sampling via Score-based Generative Models

Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity

Large-scale empirical tuning and comparison of default optimizers for variational inference

Kastor: An efficient fine-tuning strategy for generative emulation of PDE simulations

Computation-Aware Kalman Filtering with Model Selection for Neural Dynamics

Direct Regret Optimization in Bayesian Optimization