Riemannian Optimization
Overview
Riemannian optimization studies how to minimize objectives when parameters lie on curved spaces such as spheres, Stiefel manifolds, and spaces of low-rank matrices. Common methods project gradients onto tangent spaces and take feasible steps with retractions or geodesics; natural-gradient, mirror-descent, and second-order methods adapt updates to the chosen metric. These techniques are used for orthogonality-constrained learning, low-rank model adaptation, covariance and probability optimization, tensor networks, and robotics. A central tension is balancing geometric fidelity and convergence guarantees against the cost of computing geometric updates, while empirical gains over well-tuned Euclidean optimizers are not consistent across settings.
Latest papers
76 papers8 papers in the last four weeks, down 47% on the four weeks before. 0.0% of all new papers.