Dynamic Regret Reduces to Kernelized Static Regret
Andrew Jacobsen, Alessandro Rudi, Francesco Orabona, Nicolo Cesa-Bianchi

TL;DR
This paper presents a novel reduction of dynamic regret minimization in online convex optimization to a static regret problem in a Reproducing Kernel Hilbert Space, enabling optimal guarantees and broad applicability beyond linear losses.
Contribution
It introduces a new dynamic-to-static regret reduction using RKHS, extending guarantees to general loss sequences and enabling practical algorithms in infinite-dimensional spaces.
Findings
Achieves optimal dynamic regret bounds in linear loss settings.
Provides scale-free and directionally-adaptive regret guarantees.
Extends reduction validity to arbitrary loss sequences beyond linear losses.
Abstract
We study dynamic regret in online convex optimization, where the objective is to achieve low cumulative loss relative to an arbitrary benchmark sequence. By observing that competing with an arbitrary sequence of comparators in is equivalent to competing with a fixed comparator function , we frame dynamic regret minimization as a static regret problem in a function space. By carefully constructing a suitable function space in the form of a Reproducing Kernel Hilbert Space (RKHS), our reduction enables us to recover the optimal dynamic regret guarantee in the setting of linear losses, and yields new scale-free and directionally-adaptive dynamic regret guarantees. Moreover, unlike prior dynamic-to-static reductions -- which are valid…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
