arXiv Machine Learning
HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
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.
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.
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.
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.
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.
arXiv AI
2d ago
Efficiently Estimating Optimal Hyperparameter Scaling Laws through Power-Law Entropy Search
The paper introduces Power‑Law Entropy Search (PLES), a computational‑cost‑aware acquisition function that uses multi‑fidelity Bayesian optimization to efficiently estimate optimal hyperparameter scaling laws for large language model training. PLES focuses on reducing the overall uncertainty of scaling law estimates rather than optimizing a single objective, selecting configurations that maximize uncertainty reduction per unit computational cost. Experiments on synthetic benchmarks, surrogate models, and real LLM pre‑training runs show that PLES converges to accurate scaling laws using less than one‑tenth of the computational budget required by conventional grid search and other baselines.