Riemannian Zeroth-Order Gradient Estimation with Structure-Preserving Metrics for Geodesically Incomplete Manifolds
Shaocong Ma, Heng Huang
Abstract
In this paper, we study Riemannian zeroth-order optimization in settings where the underlying Riemannian metric is geodesically incomplete, and the goal is to approximate stationary points with respect to this incomplete metric. To address this challenge, we construct structure-preserving metrics that are geodesically complete while ensuring that every stationary point under the new metric remains stationary under the original one. Building on this foundation, we revisit the classical symmetric two-point zeroth-order estimator and analyze its mean-squared error from an intrinsic perspective, depending only on the manifold’s geometry rather than any ambient embedding. Leveraging this intrinsic analysis, we establish convergence guarantees for stochastic gradient descent (SGD) with this intrinsic estimator. Under additional suitable conditions, an -stationary point under the constructed metric also corresponds to an -stationary point under the original metric , thereby matching the best-known complexity in the geodesically complete setting. Empirical studies on synthetic problems confirm our theoretical findings, and experiments on a practical mesh optimization task demonstrate that our framework maintains stable convergence even in the absence of geodesic completeness.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4c341712-974b-47dc-9754-10a2fbd234beBuilds on8
- Combining Differentiable PDE Solvers and Graph Neural Networks for Fluid Flow PredictionFilipe de Avila Belbute-Peres, Thomas D. Economon, J. Zico KolterICML 2020 · 271 citations
- Random Reshuffling: Simple Analysis with Vast ImprovementsKonstantin Mishchenko, Ahmed Khaled, Peter RichtárikNeurIPS 2020 · 172 citations
- Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence AnalysisJungbin Kim, Insoon YangICML 2022 · 26 citations
- No-regret Online Learning over Riemannian ManifoldsXi Wang, Zhipeng Tu, Yiguang Hong, Yingyi Wu et al.NeurIPS 2021 · 14 citations
- A No-go Theorem for Robust Acceleration in the Hyperbolic PlaneLinus Hamilton, Ankur MoitraNeurIPS 2021 · 13 citations
Related papers
- Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query ComplexityChang He, Zhaoye Pan, Xiao Wang, Bo JiangICML 2024 · 8 citations
- Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian ManifoldsEmre Sahinoglu, Youbang Sun, Shahin ShahrampourNeurIPS 2025 · 4 citations
- Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal PointDavid Martínez-Rubio, Christophe Roux, Sebastian PokuttaICML 2024 · 3 citations
- Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentJason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. StrommeNeurIPS 2021 · 60 citations
- First-Order Algorithms for Min-Max Optimization in Geodesic Metric SpacesMichael I. Jordan, Tianyi Lin, Emmanouil V. Vlatakis-GkaragkounisNeurIPS 2022 · 25 citations
