Finite-Time Regret Analysis of Retry-Aware Bandits
arXiv:2605.20854v1 Announce Type: new 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