← Back to all news
arXiv AI By Louis Abraham, Tuan-Anh Nguyen, Nicolas Devatine

Bandits in Prod: Hyperparameter Optimization at Inference Time

Read the original on arXiv AI →

The paper introduces Online Hyperparameter Optimization (OHPO), framing it as an infinitely many‑armed bandit problem over mixed and conditional search spaces. It proposes the IMABO framework, which couples any bandit policy with any oracle for proposing new configurations, and presents IMOSS—a restart‑free anytime policy with provable regret bounds. Experiments show that IMABO, combined with practical oracles such as TPE, an incumbent‑mutation oracle, and a pretrained tabular foundation model, outperforms random search across a range of settings from classical ML models to LLM‑based agents.

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

Related stories

Hugging Face Trending Papers
Oct 5

Dynamic Minimax Regret Optimization for Robust LLM Post-Training

The paper introduces DUCB-OGD, an algorithm that couples a Discounted Upper‑Confidence‑Bound sampler with Online Gradient Descent to address dynamic minimax regret in robust large‑language‑model post‑training. It operates under instantaneous mini‑batch‑only bandit feedback, tracking worst‑source performance without re‑evaluating historical data. Experiments on fine‑tuning, preference optimization, and reinforcement learning demonstrate that DUCB‑OGD improves worst‑group robustness with negligible computational overhead.

llmsreinforcement-learningfine-tuning
More like this →
arXiv Machine Learning
Oct 12

Accelerating Linear Bandits with Persistent Candidate Sets

The paper introduces Persistent Candidate LinUCB (PC‑LinUCB), a variant of the LinUCB algorithm for linear bandits that reduces per‑round score evaluations from ≥×K to ≥×(k+q) by maintaining a small set of active actions and sampling challengers from the remaining actions. It provides high‑probability regret bounds that include a standard learning term and an additive discovery cost of order ≥×((K-k)×log(K-k))/q, which does not grow with the horizon. Experiments demonstrate that PC‑LinUCB accelerates LinUCB while keeping regret comparable, and the persistent candidate approach can be applied beyond LinUCB.

By Bingkui Tong, Daria Korovaitceva, Marina Sheshukova, Sergey Samsonov, Junpei Komiyama
reinforcement-learning
More like this →
arXiv Machine Learning
Sep 14

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution

The paper introduces SELECT, an algorithmic framework for satisficing regret minimization in bandit problems, achieving constant expected satisficing regret when a satisficing arm exists. A variant, SELECT‑LITE, further ensures a light‑tailed satisficing regret distribution while maintaining constant expected regret in the realizable case and sub‑linear standard regret otherwise. Experiments on synthetic data and a real‑world dynamic pricing scenario demonstrate the practical effectiveness of both algorithms.

By Qing Feng, Tianyi Ma, Ruihao Zhu
reinforcement-learning
More like this →
arXiv Machine Learning
Aug 3

Parameter-Free Heavy-Tailed Bandits

arXiv:2607. 29460v1 Announce Type: new Abstract: Heavy-tailed distributions arise naturally in sequential decision-making problems such as financial investment, online advertising, and network management, where rare but extreme outcomes can dominate performance.

By Gianmarco Genalti, Alberto Maria Metelli
More like this →