REVIEW 2 cited by
Manifold learning and optimization using tangent space proxies
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Manifold learning and optimization using tangent space proxies
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
Riemannian Archetypal Analysis: Interpretable non-linear data analysis on deformed star distributions
Riemannian archetypal analysis projects data onto a manifold of geodesically convex archetype combinations via pullback geometry on deformed star distributions.
-
Iso-Riemannian Optimization on Learned Data Manifolds
Iso-Riemannian descent algorithm with convergence analysis under iso-convexity, iso-monotonicity and iso-Lipschitz conditions for optimization on learned Riemannian manifolds from data.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.