2 papers
cs.LG2026
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
Mengxiao Zhang
We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most times. When is known, an optimal expected…
math.OC2026
An LP-Based Approach for Bilinear Saddle Point Problem with Instance-dependent Guarantee and Noisy Feedback
Jiashuo Jiang, Mengxiao Zhang
In this work, we study the sample complexity of obtaining a Nash equilibrium (NE) estimate in two-player zero-sum matrix games with noisy feedback. Specifically, we propose a novel…