Saved in:
| Main Authors: | Jacobsen, Andrew, Orabona, Francesco |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.01577 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Modern Introduction to Online Learning
by: Orabona, Francesco
Published: (2019)
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)
by: Orabona, Francesco
Published: (2026)
Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)
by: Jacobsen, Andrew, et al.
Published: (2025)
New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
by: Orabona, Francesco, et al.
Published: (2025)
by: Orabona, Francesco, et al.
Published: (2025)
A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
by: Lee, Wei-Cheng, et al.
Published: (2025)
by: Lee, Wei-Cheng, et al.
Published: (2025)
A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)
by: Lee, Wei-Cheng, et al.
Published: (2025)
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)
by: Cutkosky, Ashok, et al.
Published: (2023)
New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
by: Saad, El Mehdi, et al.
Published: (2025)
by: Saad, El Mehdi, et al.
Published: (2025)
Beyond the Ideal: Analyzing the Inexact Muon Update
by: Shulgin, Egor, et al.
Published: (2025)
by: Shulgin, Egor, et al.
Published: (2025)
Parameter-free Mirror Descent
by: Jacobsen, Andrew, et al.
Published: (2022)
by: Jacobsen, Andrew, et al.
Published: (2022)
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)
by: Park, Sungwoo, et al.
Published: (2024)
Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)
by: Barakat, Anas, et al.
Published: (2026)
ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
by: Maranjyan, Artavazd, et al.
Published: (2025)
by: Maranjyan, Artavazd, et al.
Published: (2025)
Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer
by: Xie, Yan-Feng, et al.
Published: (2026)
by: Xie, Yan-Feng, et al.
Published: (2026)
Regret Analysis: a control perspective
by: Gibson, Travis E., et al.
Published: (2025)
by: Gibson, Travis E., et al.
Published: (2025)
Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)
by: Hua, Youqing, et al.
Published: (2024)
Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)
Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)
by: Lu, Yiwen, et al.
Published: (2023)
Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)
by: Weber, Lucas, et al.
Published: (2024)
Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)
by: Khodadadian, Sajad, et al.
Published: (2025)
Regret Minimization in Scalar, Static, Non-linear Optimization Problems
by: Wang, Ying, et al.
Published: (2024)
by: Wang, Ying, et al.
Published: (2024)
Learning Decentralized Linear Quadratic Regulators with $\sqrt{T}$ Regret
by: Ye, Lintao, et al.
Published: (2022)
by: Ye, Lintao, et al.
Published: (2022)
Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)
by: Tan, Samuel, et al.
Published: (2024)
No-Regret Gaussian Process Optimization of Time-Varying Functions
by: Mauduit, Eliabelle, et al.
Published: (2025)
by: Mauduit, Eliabelle, et al.
Published: (2025)
Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)
by: Gao, Wenzhi, et al.
Published: (2026)
Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)
by: Boone, Victor, et al.
Published: (2024)
Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
by: Xu, Wenhao, et al.
Published: (2024)
by: Xu, Wenhao, et al.
Published: (2024)
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)
by: Di, Qiwei, et al.
Published: (2023)
Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
by: Ziemann, Ingvar, et al.
Published: (2022)
by: Ziemann, Ingvar, et al.
Published: (2022)
Causal LLM Routing: End-to-End Regret Minimization from Observational Data
by: Tsiourvas, Asterios, et al.
Published: (2025)
by: Tsiourvas, Asterios, et al.
Published: (2025)
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)
by: Tran-The, Hung, et al.
Published: (2022)
Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)
by: Mukhopadhyay, Samrat, et al.
Published: (2025)
Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)
by: Zhao, Peng, et al.
Published: (2025)
Regret of exploratory policy improvement and $q$-learning
by: Tang, Wenpin, et al.
Published: (2024)
by: Tang, Wenpin, et al.
Published: (2024)
Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)
by: Chang, Ting-Jui, et al.
Published: (2024)
Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)
by: Sattar, Yahya, et al.
Published: (2021)
Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets
by: Taha, Feras Al, et al.
Published: (2025)
by: Taha, Feras Al, et al.
Published: (2025)
Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares
by: Pai, Chih-Fan, et al.
Published: (2026)
by: Pai, Chih-Fan, et al.
Published: (2026)
Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)
by: Li, Hao, et al.
Published: (2024)
Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)
by: Liu, Zijian
Published: (2025)
Similar Items
-
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) -
Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025) -
New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
by: Orabona, Francesco, et al.
Published: (2025) -
A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
by: Lee, Wei-Cheng, et al.
Published: (2025)