Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
Hao Qiu, Andrew Jacobsen, Emmanuel Esposito +1
In this paper, we study dynamic regret in unconstrained online convex optimization (OCO) with movement costs. Specifically, we generalize the standard setting by allowing the movem…
cs.LG2026
Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
Hao Qiu, Mengxiao Zhang, Nicolò Cesa-Bianchi
We study distributed adversarial bandits, where agents cooperate to minimize the global average loss while observing only their own local losses. We show that the minimax regre…