arXiv Machine Learning
Bandits with Probing: Optimal Regret and the Limits of Winner Feedback
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
Jun 2
Finite-Time Regret Analysis of Retry-Aware Bandits
arXiv:2605. 20854v2 Announce Type: replace Abstract: We study a stochastic bandit algorithm motivated by retry-aware objectives that value the best outcome among multiple attempts, such as pass@$k$ and max@$k$.
arXiv Machine Learning
3d ago
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...
arXiv Machine Learning
Aug 11
Information Routing across Batch Boundaries: Memory--Batch Tradeoffs in Lipschitz Bandits
arXiv:2608. 07922v1 Announce Type: new Abstract: Adaptive learning needs both a state that preserves what observations imply and opportunities to act on that state.
arXiv Machine Learning
Jun 15
Online Convex Optimization with Sublinear Noisy Probes
arXiv:2606. 14640v1 Announce Type: new Abstract: We study Online Convex Optimization (OCO) over a convex set $K\subseteq \mathbb R^d$, where in each round $t$ the learner selects $x_t\in K$ and then observes a convex loss $f_t:K\to[0,1]$, with the goal of minimizing regret to the best fixed decision in hindsight.
arXiv Machine Learning
Aug 18
Last-Iterate Analyses of FTRL with the 1/2-Tsallis Entropy in Stochastic Bandits
arXiv:2510. 22819v3 Announce Type: replace Abstract: The convergence analysis of online learning algorithms is central to machine learning theory, where the last-iterate convergence is particularly important, as it captures the learner's actual decisions and describes the evolution of the learning process over time.
arXiv Machine Learning
1d ago
Prior-Free Competitive Ratios for Improving Bandits: Scale, Curvature and Horizon Are Free, but Not Jointly Under Noise
arXiv:2609.17595v1 Announce Type: new Abstract: In the improving multi-armed bandits problem, each of $k$ arms has an unknown nondecreasing, discretely concave reward curve $f_i$, and pulling arm $i$...