Paper recorded by Signals 4 on 2026-10-07 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-07 on arXiv · recorded by Signals 4 on 2026-10-08
Category: cs.LG · 机器学习 · first seen 2026-10-08
We study the best arm identification problem in a stochastic environment with a novel form of adversarial perturbations, which we coin Shifting Means. While classically the mean rewards of the $K$ arms are stable in time, in Shifting Means only the gaps $\boldsymbolΔ$ between mean rewards are stable, while their common shift may be determined adversarially in each round. The objective of the learn