Cover Image

Dynamic Regret Reduces to Kernelized Static Regret

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jacobsen, Andrew, Rudi, Alessandro, Orabona, Francesco, Cesa-Bianchi, Nicolo
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
by: Di Gennaro, Federico, et al.
Published: (2025)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

A Regret Analysis of Bilateral Trade
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
by: Qiu, Hao, et al.
Published: (2026)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
by: Qian, Jian, et al.
Published: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Improved Kernel Alignment Regret Bound for Online Kernel Learning
by: Li, Junfan, et al.
Published: (2022)

Online Linear Regression with Paid Stochastic Features
by: Merlis, Nadav, et al.
Published: (2025)

Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)

Distributed Online Optimization with Stochastic Agent Availability
by: Achddou, Juliette, et al.
Published: (2024)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

Multitask Online Learning: Listen to the Neighborhood Buzz
by: Achddou, Juliette, et al.
Published: (2023)

Adaptive maximization of social welfare
by: Cesa-Bianchi, Nicolo, et al.
Published: (2023)

From Betting to Empirical Bernstein LIL
by: Orabona, Francesco
Published: (2026)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023)

Invariance-Based Dynamic Regret Minimization
by: Lazzaretto, Margherita, et al.
Published: (2026)

A Modern Introduction to Online Learning
by: Orabona, Francesco
Published: (2019)

A Note on How to Remove the $\ln\ln T$ Term from the Squint Bound
by: Orabona, Francesco
Published: (2026)

Beyond Bandit Feedback in Online Multiclass Classification
by: van der Hoeven, Dirk, et al.
Published: (2021)

Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Improved Dynamic Regret for Online Frank-Wolfe
by: Wan, Yuanyu, et al.
Published: (2023)

Solving Robust MDPs through No-Regret Dynamics
by: Guha, Etash Kumar
Published: (2023)

Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024)

No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery
by: Rutherford, Alexander, et al.
Published: (2024)

Improving Regret Approximation for Unsupervised Dynamic Environment Generation
by: Mead, Harry, et al.
Published: (2026)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis
by: Li, Junfan, et al.
Published: (2024)