arXiv (OAI Expanded)
open access
Optimization over covariance matrices with a parameterized metric
The choice of Riemannian metric can strongly influence the convergence of gradient-based optimization over covariance matrices. Euclidean, Bures-Wasserstein and affine-invariant metrics are common choices, but their relative effectiveness depends on the objective. We introduce a two-parameter family
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
- Optimization over covariance matrices with a parameterized metric#919406
- Retraction-Based Gradient Projection Algorithms on Manifolds#1105444
- Warp-Geo: Differentiable Geometry Representation for Dynamic-Boundary Simulation and Shape Optimization#1034936
- Scalar Curvature Lower Bounds and Convergence in Measure#1119214
- Efficient Unlearning through Maximizing Relearning Convergence Delay#5964
Record · ID 1123481
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