Topologically-Informed Atlas Learning

• URL: http://arxiv.org/abs/2110.00429v1
• Date: Fri, 1 Oct 2021 14:11:57 GMT
• Title: Topologically-Informed Atlas Learning
• Authors: Thomas Cohn, Nikhil Devraj, Odest Chadwicke Jenkins
• Abstract summary: We present a new technique that enables manifold learning to accurately embed data manifold that contain holes, without discarding any topological information. Manhole learning aims to embed high dimensional data into a lower dimensional Euclidean space by learning a coordinate chart, but it requires that the entire manifold can be embedded in a single chart. In such cases, it is necessary to learn an atlas: a collection of charts that collectively cover the entire manifold.
• Score: 5.76237098216801
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a new technique that enables manifold learning to accurately embed data manifolds that contain holes, without discarding any topological information. Manifold learning aims to embed high dimensional data into a lower dimensional Euclidean space by learning a coordinate chart, but it requires that the entire manifold can be embedded in a single chart. This is impossible for manifolds with holes. In such cases, it is necessary to learn an atlas: a collection of charts that collectively cover the entire manifold. We begin with many small charts, and combine them in a bottom-up approach, where charts are only combined if doing so will not introduce problematic topological features. When it is no longer possible to combine any charts, each chart is individually embedded with standard manifold learning techniques, completing the construction of the atlas. We show the efficacy of our method by constructing atlases for challenging synthetic manifolds; learning human motion embeddings from motion capture data; and learning kinematic models of articulated objects.

Related papers

• Learning Tangent Bundles and Characteristic Classes with Autoencoder Atlases [4.265353613980049]
  We introduce a theoretical framework that connects multi-chart autoencoders in manifold learning with the classical theory of vector bundles and characteristic classes.<n>We show that any reconstruction-consistent autoencoder atlas canonically defines transition maps satisfying the cocycle condition.<n>We also show that non-trivial characteristic classes provide obstructions to single-chart representations, and that the minimum number of autoencoder charts is determined by the good cover structure of the manifold.
  arXiv  Detail & Related papers  (2026-02-26T11:10:35Z)
• Manifold learning and optimization using tangent space proxies [1.7068557927955381]
  We present a framework for efficiently approximating differential-geometric primitives on arbitrary manifold. We first show the utility of this framework in a setting where the manifold is expressed in closed form. Using point cloud data for which a complex manifold structure was previously established, we show that an atlas graph with the correct geometry can be directly learned from the point cloud.
  arXiv  Detail & Related papers  (2025-01-22T06:42:12Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive Learning [69.6810940330906]
  We propose a novel contrastive learning framework to learn high-quality graph embedding. Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information. We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
  arXiv  Detail & Related papers  (2023-10-27T15:31:42Z)
• FMGNN: Fused Manifold Graph Neural Network [102.61136611255593]
  Graph representation learning has been widely studied and demonstrated effectiveness in various graph tasks. We propose the Fused Manifold Graph Neural Network (NN), a novel GNN architecture that embeds graphs into different Manifolds during training. Our experiments demonstrate that NN yields superior performance over strong baselines on the benchmarks of node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2023-04-03T15:38:53Z)
• Manifold Learning by Mixture Models of VAEs for Inverse Problems [1.5749416770494704]
  We learn a mixture model of variational autoencoders to represent a manifold of arbitrary topology. We use it for solving inverse problems by minimizing a data fidelity term restricted to the learned manifold. We demonstrate the performance of our method for low-dimensional toy examples as well as for deblurring and electrical impedance tomography.
  arXiv  Detail & Related papers  (2023-03-27T14:29:04Z)
• G-MSM: Unsupervised Multi-Shape Matching with Graph-based Affinity Priors [52.646396621449]
  G-MSM is a novel unsupervised learning approach for non-rigid shape correspondence. We construct an affinity graph on a given set of training shapes in a self-supervised manner. We demonstrate state-of-the-art performance on several recent shape correspondence benchmarks.
  arXiv  Detail & Related papers  (2022-12-06T12:09:24Z)
• Semi-Supervised Manifold Learning with Complexity Decoupled Chart Autoencoders [45.29194877564103]
  This work introduces a chart autoencoder with an asymmetric encoding-decoding process that can incorporate additional semi-supervised information such as class labels. We discuss the approximation power of such networks and derive a bound that essentially depends on the intrinsic dimension of the data manifold rather than the dimension of ambient space.
  arXiv  Detail & Related papers  (2022-08-22T19:58:03Z)
• Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
  This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL) GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures. Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
  arXiv  Detail & Related papers  (2022-06-25T03:54:53Z)
• Multi-chart flows [0.0]
  We present a flow-based model for concurrently learning non-trivial topologically non-trivial manifold operations. Our model learns the local manifold topology piecewise by "gluing" it back together through a collection of learned coordinate charts. We show better sample efficiency and competitive or superior performance against current state-of-the-art.
  arXiv  Detail & Related papers  (2021-06-07T10:37:06Z)
• Quadric hypersurface intersection for manifold learning in feature space [52.83976795260532]
  manifold learning technique suitable for moderately high dimension and large datasets. The technique is learned from the training data in the form of an intersection of quadric hypersurfaces. At test time, this manifold can be used to introduce an outlier score for arbitrary new points.
  arXiv  Detail & Related papers  (2021-02-11T18:52:08Z)
• Manifold Learning via Manifold Deflation [105.7418091051558]
  dimensionality reduction methods provide a valuable means to visualize and interpret high-dimensional data. Many popular methods can fail dramatically, even on simple two-dimensional Manifolds. This paper presents an embedding method for a novel, incremental tangent space estimator that incorporates global structure as coordinates. Empirically, we show our algorithm recovers novel and interesting embeddings on real-world and synthetic datasets.
  arXiv  Detail & Related papers  (2020-07-07T10:04:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.