Cover Image

Gradient-Variation Regret Bounds for Unconstrained Online Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Yuheng, Jacobsen, Andrew, Cesa-Bianchi, Nicolò, Zhao, Peng
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
by: Zhao, Yuheng, et al.
Published: (2025)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

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

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

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

Gradient-Variation Online Learning under Generalized Smoothness
by: Xie, Yan-Feng, et al.
Published: (2024)

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
by: Yan, Yu-Hu, et al.
Published: (2023)

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

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
by: Zhang, Yu-Jie, et al.
Published: (2025)

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

Learning Conditional Averages
by: Bressan, Marco, et al.
Published: (2026)

Fully Unconstrained Online Learning
by: Cutkosky, Ashok, et al.
Published: (2024)

Logarithmic Regret for Online KL-Regularized Reinforcement Learning
by: Zhao, Heyang, et al.
Published: (2025)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)

Linear Gradient Prediction with Control Variates
by: Ciosek, Kamil, et al.
Published: (2025)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
by: Li, Mingyi, et al.
Published: (2026)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
by: Lugosi, Gábor, et al.
Published: (2023)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

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

Online Linear Regression in Dynamic Environments via Discounting
by: Jacobsen, Andrew, et al.
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)