No article text was recorded for this version.
curvature-dependent regret bounds
Version 2 of 295 papers136 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Logarithmic Switching Regret for Online Convex Optimization
- Blog: Fast Rates in Online Convex Optimization by Exploiting the Curvature of Feasible Sets
- Blog: Mind the Duality Gap: Logarithmic regret algorithms for online optimization
- Blog: Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities
- Blog: Online Sequential Decision-Making with Unknown Delays
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: Logarithmic regret algorithms for online convex optimization
- Blog: Online optimization in dynamic environments: Improved regret rates for strongly convex problems
- Blog: Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
- Blog: Fast Second-Order Online Kernel Learning Through Incremental Matrix Sketching and Decomposition
- Blog: Revisiting Projection-free Online Learning: the Strongly Convex Case
- Blog: Logarithmic Regret Bound in Partially Observable Linear Dynamical Systems
- Blog: FastAdaBelief: Improving Convergence Rate for Belief-Based Adaptive Optimizers by Exploiting Strong Convexity
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: Projection Free Online Learning over Smooth Sets
- Blog: Non-Stationary Contextual Pricing with Safety Constraints
- Blog: Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses
- Blog: Exploiting Curvature in Online Convex Optimization with Delayed Feedback
- Blog: Online Learning in Changing Environments
- Blog: Projection-Free Optimization on Uniformly Convex Sets
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: Dynamic Regret Reduces to Kernelized Static Regret
- Blog: Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
- Blog: The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains
- Blog: Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses
- Blog: Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities
- Blog: Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements
- Blog: Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
- Blog: Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity
- Blog: Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
- Blog: Dynamic Regret of Convex and Smooth Functions
- Blog: Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
- Blog: Differentially Private Online Learning
- Blog: Dynamic Regret of Strongly Adaptive Methods
- Blog: An Online Algorithm for Smoothed Regression and LQR Control
- Blog: Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
- Blog: Optimal Dynamic Regret in LQR Control
- Blog: The Pareto Regret Frontier
- Blog: Linear Bandits on Uniformly Convex Sets
- Blog: Logarithmic Regret for Online Control
- Blog: Online Learning for Global Cost Functions
- Blog: Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
- Blog: Minimizing Dynamic Regret and Adaptive Regret Simultaneously
- Blog: Improved Regret for Bandit Convex Optimization with Delayed Feedback
- Blog: Online Learning with a Hint
- Blog: Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
- Blog: Lazy OCO: Online Convex Optimization on a Switching Budget
- Blog: An Ellipsoid Algorithm for Online Convex Optimization
- Blog: CLASP: Online learning algorithms for Convex Losses And Squared Penalties
- Blog: Multitask Online Mirror Descent
- Blog: Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond
- Blog: Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
- Blog: A Stochastic View of Optimal Regret through Minimax Duality
- Blog: Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
- Blog: Prediction with expert advice for the Brier game
- Blog: Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
- Blog: Online Optimization : Competing with Dynamic Comparators
- Blog: Online Convex Optimization with Continuous Switching Constraint
- Blog: Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond
Showing 60 of 95 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_curvature_dependent_regret_bounds_cddc5e41,
title = {curvature-dependent regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/curvature-dependent-regret-bounds/rdr_cddc5e4108424324bf6a1a66d27eadb9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_curvature_dependent_regret_bounds_cddc5e41_v2,
title = {curvature-dependent regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/curvature-dependent-regret-bounds/rdr_cddc5e4108424324bf6a1a66d27eadb9/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}