Cover Image

On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mhaisen, Naram, Iosifidis, George
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

Partially Lazy Gradient Descent for Smoothed Online Learning
by: Mhaisen, Naram, et al.
Published: (2026)

Optimistic Online Non-stochastic Control via FTRL
by: Mhaisen, Naram, et al.
Published: (2024)

Optimistic Learning for Communication Networks
by: Iosifidis, George, et al.
Published: (2025)

Adaptive Online Non-stochastic Control
by: Mhaisen, Naram, et al.
Published: (2023)

SEArch: Optimistic Policy Selection Between Scene Noise and Drift for UAV Radar Search
by: Khial, Noor, et al.
Published: (2026)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
by: Lazarsfeld, John, et al.
Published: (2025)

Slicing for AI: An Online Learning Framework for Network Slicing Supporting AI Services
by: Helmy, Menna, et al.
Published: (2024)

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning
by: Kobayashi, Taisuke
Published: (2024)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
by: Ito, Shinji, et al.
Published: (2024)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem
by: Krishnamurthy, Vikram
Published: (2025)

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

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

Equitable Multi-Task Learning for AI-RANs
by: Raptis, Panayiotis, et al.
Published: (2026)

Explicit Dropout: Deterministic Regularization for Transformer Architectures
by: Agrawal, Vidhi, et al.
Published: (2026)

Directional Optimism for Safe Linear Bandits
by: Hutchinson, Spencer, et al.
Published: (2023)

Minimax Optimal Reinforcement Learning with Quasi-Optimism
by: Lee, Harin, et al.
Published: (2025)

Beyond Optimism: Exploration With Partially Observable Rewards
by: Parisi, Simone, et al.
Published: (2024)

Constrained Online Convex Optimization with Memory and Predictions
by: Abdullah, Mohammed, et al.
Published: (2026)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
by: Chen, Botao, et al.
Published: (2025)

CHOMET: Conditional Handovers via Meta-Learning
by: Kalntis, Michail, et al.
Published: (2025)

Adaptive Resource Allocation for Virtualized Base Stations in O-RAN with Online Learning
by: Kalntis, Michail, et al.
Published: (2023)

Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
by: Li, Mengmeng, et al.
Published: (2024)

On the Suboptimality of GP-UCB under Polynomial Effective Optimism
by: Wang, Wenjia, et al.
Published: (2023)

Theoretical Performance Guarantees for Partial Domain Adaptation via Partial Optimal Transport
by: Naram, Jayadev, et al.
Published: (2025)

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
by: Kim, Chaiwon, et al.
Published: (2025)

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

CoNNect: Connectivity-Based Regularization for Structural Pruning
by: Franssen, Christian, et al.
Published: (2025)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)

Geometric Deep Learning for Computer-Aided Design: A Survey
by: Heidari, Negar, et al.
Published: (2024)

MMA-DFER: MultiModal Adaptation of unimodal models for Dynamic Facial Expression Recognition in-the-wild
by: Chumachenko, Kateryna, 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)

Variational Graph Convolutional Neural Networks
by: Oleksiienko, Illia, et al.
Published: (2025)

Manifold Gaussian Variational Bayes on the Precision Matrix
by: Magris, Martin, et al.
Published: (2022)

Implicit Riemannian Optimism with Applications to Min-Max Problems
by: Roux, Christophe, et al.
Published: (2025)