arXiv Machine Learning
Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Sep 22
Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices
Exhaustively evaluating every candidate LLM configuration on every benchmark item to identify a high-performing one is costly. We formulate configuration selection as a cost-aware Bayesian bandit prob...
arXiv AI
Sep 2
Bandits in Prod: Hyperparameter Optimization at Inference Time
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.
arXiv Machine Learning
Jul 8
No-Regret Gaussian Process Optimization of Time-Varying Functions
arXiv:2512. 00517v3 Announce Type: replace-cross Abstract: Sequential optimization of black-box functions from noisy evaluations has been widely studied, with Gaussian Process bandit algorithms such as GP-UCB guaranteeing no-regret in stationary settings.
arXiv AI
Aug 3
RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
arXiv:2607. 29241v1 Announce Type: cross Abstract: Optimizing modern recommender models still depends heavily on engineers manually iterating over architectural, objective, and training-strategy changes.
arXiv Machine Learning
4d ago
Learning When to Update: A Near-Optimal Timing Bandit Approach
arXiv:2609.37932v1 Announce Type: new Abstract: Systems operating in dynamic environments require timely updates to sustain performance. For resource-intensive systems such as machine learning models...
arXiv Machine Learning
Aug 12
Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
arXiv:2307. 03587v4 Announce Type: replace Abstract: In non-stationary linear contextual bandits, existing efficient algorithms typically rely on the Weighted Regularized Least-Squares (WRLS) estimator.