Manifold learning and optimization using tangent space proxies
Not on the map. Why?
Abstract (arXiv)
We present a framework for efficiently approximating differential-geometric primitives on arbitrary manifolds via construction of an atlas graph representation, which leverages the canonical characterization of a manifold as a finite collection, or atlas, of overlapping coordinate charts. We first show the utility of this framework in a setting where the manifold is expressed in closed form, specifically, a runtime advantage, compared with state-of-the-art approaches, for first-order optimization over the Grassmann manifold. Moreover, using point cloud data for which a complex manifold structure was previously established, i.e., high-contrast image patches, we show that an atlas graph with the correct geometry can be directly learned from the point cloud. Finally, we demonstrate that learning an atlas graph enables downstream key machine learning tasks. In particular, we implement a Riemannian generalization of support vector machines that uses the learned atlas graph to approximate complex differential-geometric primitives, including Riemannian logarithms and vector transports. These settings suggest the potential of this framework for even more complex settings, where ambient dimension and noise levels may be much higher.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 50 references that are in the map. First posted on arXiv 22 Jan 2025.
Builds on
11 of 50 references.
References · 11
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2019Parameterized quantum circuits as machine learning modelscited by 330
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 115
- 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 93
- 2016The non-convex Burer-Monteiro approach works on smooth semidefinite programscited by 44
- 2017Riemannian Optimization via Frank-Wolfe Methodscited by 21
- 2017An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimizationcited by 20
- 2015Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?cited by 12
- 2021On the Optimality of the Oja's Algorithm for Online PCAcited by 11
- 2019On the Burer-Monteiro method for general semidefinite programscited by 8
- 2017Principal Boundary on Riemannian Manifoldscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.