arXiv Machine Learning
Recommender regret for improving regularised RL estimation with bandits and MCTS
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 15
When Greedy Sampling Explores: KL-Regularized Contextual Bandits without Eluder-Dimension Dependence
arXiv:2609.13564v1 Announce Type: new Abstract: We study KL-regularized contextual bandits under both reward and preference feedback. We show that greedy sampling can achieve logarithmic regret witho...
arXiv Machine Learning
Jun 5
Exploration via linearly perturbed loss minimisation
arXiv:2311. 07565v3 Announce Type: replace Abstract: We introduce exploration via linear loss perturbations (EVILL), a randomised exploration method for structured stochastic bandit problems that works by solving for the minimiser of a linearly perturbed regularised negative log-likelihood function.
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
Aug 5
In-Context Pure Exploration in Continuous Decision Spaces
arXiv:2602. 17976v2 Announce Type: replace-cross Abstract: In active sequential testing, also termed pure exploration, a learner is tasked with the goal to adaptively acquire information so as to identify an unknown ground-truth hypothesis with as few queries as possible.
arXiv Machine Learning
Aug 4
Characterizing Bias in Post-Bandit Inference under Index Algorithms
arXiv:2608. 01069v1 Announce Type: new Abstract: Bandit algorithms generate data for downstream inference, but adaptive sampling biases post-bandit sample means.
arXiv Machine Learning
Sep 23
Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices
arXiv:2609.25645v1 Announce Type: new Abstract: Exhaustively evaluating every candidate LLM configuration on every benchmark item to identify a high-performing one is costly. We formulate configurati...