arXiv (All)
open access
Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader
Online gradient descent is usually studied through external regret, where the learner competes with fixed alternatives. Recent work shows that first-order methods control richer action-dependent deviations. We ask for a geometric characterization of the deviations with respect to which online gradie
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
- Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs#422276
- Continuity-Free Near-Minimax Leading-Order Regret for CVaR-UCBVI#793188
- Continuity-Free Near-Minimax Leading-Order Regret for CVaR-UCBVI#789184
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#677345
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#674148
Record · ID 987210
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