arXiv (All)
open access
Small Gradient Norm Regret for Online Convex Optimization
This paper introduces a new problem-dependent regret measure for online convex optimization with smooth losses. The notion, which we call the $G^\star$ regret, depends on the cumulative squared gradient norm evaluated at the decision in hindsight. We show that the $G^\star$ regret strictly refines t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convex Optimization Is Free When Accuracy Is Expensive#1130006
- Lower Bounds for Linear-Oracle Online Learning#1142976
- Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization#1154877
- Next-token functional estimation#1014122
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
Record · ID 1049744
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive