arXiv (OAI Expanded)
open access
Block-Norm Geometries for Online Mirror Descent with Sparse Losses
The performance of online mirror descent depends critically on the geometry induced by its mirror map, yet standard algorithms largely rely on two canonical choices: Euclidean and entropic geometry. We show that these two geometries can both be substantially suboptimal when loss gradients are sparse
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
- A New Kernel Regularity Condition for Distributed Mirror Descent: Broader Coverage and Simpler Analysis#973091
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- Linesearch-Free Nonlinearly Preconditioned GD with Semiautomatic Geometry Design#1119361
- Anon: Extrapolating Adaptivity Beyond SGD and Adam#1062898
- Bilinear Optimization Divergence: Diagnosing Factor-Constrained LoRA Continual Learning#1049333
Record · ID 1069746
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