3 papers
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
When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses
Antoine Moulin, Emmanuel Esposito, Dirk van der Hoeven
We consider the problem setting of prediction with expert advice with possibly heavy-tailed losses, i.e. the only assumption on the losses is an upper bound on their second moments…
cs.LG2025
Exploiting Curvature in Online Convex Optimization with Delayed Feedback
Hao Qiu, Emmanuel Esposito, Mengxiao Zhang
In this work, we study the online convex optimization problem with curved losses and delayed feedback. When losses are strongly convex, existing approaches obtain regret bounds of…