Toroidal Coordinates: Decorrelating Circular Coordinates With Lattice Reduction

• URL: http://arxiv.org/abs/2212.07201v1
• Date: Wed, 14 Dec 2022 12:59:25 GMT
• Title: Toroidal Coordinates: Decorrelating Circular Coordinates With Lattice Reduction
• Abstract summary: We describe a systematic procedure for constructing low energy torus-valued maps on data, starting from a set of linearly independent cohomology classes. Our main algorithm is based on the Lenstra--stra--Lov'asz algorithm from computational number theory.
• Score: 1.9437538125261753
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The circular coordinates algorithm of de Silva, Morozov, and Vejdemo-Johansson takes as input a dataset together with a cohomology class representing a $1$-dimensional hole in the data; the output is a map from the data into the circle that captures this hole, and that is of minimum energy in a suitable sense. However, when applied to several cohomology classes, the output circle-valued maps can be "geometrically correlated" even if the chosen cohomology classes are linearly independent. It is shown in the original work that less correlated maps can be obtained with suitable integer linear combinations of the cohomology classes, with the linear combinations being chosen by inspection. In this paper, we identify a formal notion of geometric correlation between circle-valued maps which, in the Riemannian manifold case, corresponds to the Dirichlet form, a bilinear form derived from the Dirichlet energy. We describe a systematic procedure for constructing low energy torus-valued maps on data, starting from a set of linearly independent cohomology classes. We showcase our procedure with computational examples. Our main algorithm is based on the Lenstra--Lenstra--Lov\'asz algorithm from computational number theory.

Related papers

• Selecting Interpretable Circular Coordinates from Data [2.8802622551493773]
  We propose a method for selecting interpretable circle-valued coordinates from a user-supplied dictionary of scientifically meaningful candidates explaining the detected cohomology.<n>We prove that the introduced cochain inner product is a consistent estimator of the $L2$ inner product of fixed smooth 1-forms under non-uniform sampling.
  arXiv  Detail & Related papers  (2026-07-09T08:26:48Z)
• 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)
• Metric Graph Kernels via the Tropical Torelli Map [0.0]
  We propose new graph kernels grounded in the study of metric graphs via tropical algebraic geometry.<n>Our graph kernels are based on the geometry and topology of the underlying metric space.<n> Empirically, our kernels outperform existing methods in label-free settings.
  arXiv  Detail & Related papers  (2025-05-17T20:00:50Z)
• A Relative Homology Theory of Representation in Neural Networks [0.0]
  Previous research has proven that the set of maps implemented by neural networks with a ReLU activation function is identical to the set of piecewise linear continuous maps. We leverage these properties to define the equivalence class of inputs $sim_Phi$, which can be split into two sets related to the local rank of $Phi_J$ and the intersections $cap textImPhi_J_i$. We refer to the latter as the overlap decomposition $O_Phi$ and prove that if the intersections between each polyhedron and the input manifold are
  arXiv  Detail & Related papers  (2025-02-03T13:52:17Z)
• Subsampling, aligning, and averaging to find circular coordinates in recurrent time series [3.8214695776749013]
  We introduce a new algorithm for finding robust circular coordinates on data that is expected to exhibit recurrence. We validate our technique on both synthetic data sets and neuronal activity recordings.
  arXiv  Detail & Related papers  (2024-12-24T15:52:51Z)
• Boundary Detection Algorithm Inspired by Locally Linear Embedding [8.259071011958254]
  We propose a method for detecting boundary points inspired by the widely used locally linear embedding algorithm. We implement this method using two nearest neighborhood search schemes: the $epsilon$-radius ball scheme and the $K$-nearest neighbor scheme.
  arXiv  Detail & Related papers  (2024-06-26T16:05:57Z)
• 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)
• Topological Learning for Motion Data via Mixed Coordinates [2.5955102874701517]
  Topology can extract structural information in a dataset efficiently. We propose to incorporate topological information into a multiple output Gaussian process model. We put forward a unified framework using topological information in time and motion series.
  arXiv  Detail & Related papers  (2023-10-30T19:20:48Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• 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)
• Study of Manifold Geometry using Multiscale Non-Negative Kernel Graphs [32.40622753355266]
  We propose a framework to study the geometric structure of the data. We make use of our recently introduced non-negative kernel (NNK) regression graphs to estimate the point density, intrinsic dimension, and the linearity of the data manifold (curvature)
  arXiv  Detail & Related papers  (2022-10-31T17:01:17Z)
• 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)
• A singular Riemannian geometry approach to Deep Neural Networks II. Reconstruction of 1-D equivalence classes [78.120734120667]
  We build the preimage of a point in the output manifold in the input space. We focus for simplicity on the case of neural networks maps from n-dimensional real spaces to (n - 1)-dimensional real spaces.
  arXiv  Detail & Related papers  (2021-12-17T11:47:45Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian [5.076419064097734]
  The null space of the $k$-th order Laplacian $mathbfmathcal L_k$ encodes the non-trivial topology of a manifold or a network. We propose an algorithm to factorize the homology embedding into subspaces corresponding to a manifold's simplest topological components.
  arXiv  Detail & Related papers  (2021-07-23T00:40:01Z)
• Generalized Penalty for Circular Coordinate Representation [4.054792094932801]
  Topological Data Analysis (TDA) provides novel approaches to analyze the geometrical shapes and topological structures of a dataset. We propose a method to adapt the circular coordinate framework to take into account the roughness of circular coordinates in change-point and high-dimensional applications.
  arXiv  Detail & Related papers  (2020-06-03T22:01:10Z)

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.