arXiv (All)
open access
Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning
Tracking changing comparators is a central problem in online learning. For exp-concave losses, previous work established the $T^{1/3}P_T^{2/3}$ dependence on the horizon $T$ and Euclidean path length $P_T$ for fixed dimension, while the optimal cost of dimension remained unresolved. We resolve this
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
- The Curvature of Regret in Contextual Linear Optimization#1161053
- The Curvature of Regret in Contextual Linear Optimization#1157328
- Dead Directions: Geometric Singular Learning#996911
- Online learning with Erdős-Rényi side-observation graphs#141509
- Stochastic recursive optimal control problem with monotonicity conditions under G-framework#609814
Record · ID 1355119
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