Minimax Adaptive Online Nonparametric Regression over Besov Spaces

We study online adversarial regression with convex losses against a rich class of continuous yet highly irregular prediction rules, modeled by Besov spaces Bpqs with general parameters 1 ≤ p,q ≤ ∞ and smoothness s > tfracdp. We introduce an adaptive wavelet-based algorithm that performs sequential prediction without prior knowledge of (s,p,q), and establish minimax-optimal regret bounds against any comparator in Bpqs. We further design a locally adaptive extension capable of dynamically tracking spatially inhomogeneous smoothness. This adaptive mechanism adjusts the resolution of the predictions over both time and space, yielding refined regret bounds in terms of local regularity. Consequently, in heterogeneous environments, our adaptive guarantees can significantly surpass those obtained by standard global methods.