arXiv (All)
open access
Centered Weak Discrete Riemannian Gradients: A Unified Framework for Riemannian Optimization
We introduce the centered weak discrete Riemannian gradient (c-wDRG) framework for the unified analysis of optimization methods on Riemannian manifolds. The framework uses a center point to represent the relevant logarithmic differences in a common tangent space and covers Riemannian steepest descen
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
- Decentralized SGD under Heavy-Tailed Noise: Optimal Convergence Rates and the Role of Gradient Clipping#1234952
- Decentralized SGD under Heavy-Tailed Noise: Optimal Convergence Rates and the Role of Gradient Clipping#1227312
- Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks#1014982
- Optimal Sobolev Approximation by Deterministic and Random Shallow Sigmoidal Networks#658912
- Optimal Sobolev Approximation by Deterministic and Random Shallow Sigmoidal Networks#656776
Record · ID 1198988
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