Pages that link to "Item:Q2251474"
From MaRDI portal
The following pages link to Regret bounded by gradual variation for online convex optimization (Q2251474):
Displaying 10 items.
- Lower bounds on individual sequence regret (Q285930) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds (Q2290691) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- Logarithmic regret in online linear quadratic control using Riccati updates (Q2674833) (← links)
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints (Q2679238) (← links)
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (Q6056047) (← links)
- Time-Variation in Online Nonconvex Optimization Enables Escaping From Spurious Local Minima (Q6137492) (← links)
- The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs (Q6157294) (← links)
- Regret bounds for online-learning-based linear quadratic control under database attacks (Q6163981) (← links)