Related papers: General Riemannian SOM
Computing geodesics for Riemannian manifolds is a difficult task that often relies on numerical approximations. However, these approximations tend to be either numerically unstable, have slow convergence, or scale poorly with manifold…
The local geometry of a Riemannian symmetric space is described completely by the Riemannian metric and the Riemannian curvature tensor of the space. In the present article I describe how to compute these tensors for any Riemannian…
Physically-based overland flow models are computationally demanding, hindering their use for real-time applications. Therefore, the development of fast (and reasonably accurate) overland flow models is needed if they are to be used to…
We examine a general framework for visualizing datasets of high (> 2) dimensionality, and demonstrate it using the morphology of galaxies at moderate redshifts. The distributions of various populations of such galaxies are examined in a…
In our paper, we introduce special-generic-like maps or SGL maps as smooth maps and study their several algebraic topological and differential topological properties. The new class generalize the class of so-called special generic maps.…
This paper introduces the concept of a bi-scale metric for use in the cooperative phase of the self-organizing map (SOM) algorithm. Use of a bi-scale metric allows segmentation of the map into a number of regions, corresponding to…
In this work, we investigate Riemannian geometry based dimensionality reduction methods that respect the underlying manifold structure of the data. In particular, we focus on Principal Geodesic Analysis (PGA) as a nonlinear generalization…
Special generic maps are smooth maps at each singular point of which we can represent as $(x_1, \cdots, x_m) \mapsto (x_1,\cdots,x_{n-1},\sum_{k=n}^{m}{x_k}^2)$ for suitable coordinates. Morse functions with exactly two singular points on…
Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
An increasingly common viewpoint is that protein dynamics data sets reside in a non-linear subspace of low conformational energy. Ideal data analysis tools for such data sets should therefore account for such non-linear geometry. The…
We provide an intrinsic notion of curved cosets for arbitrary Cartan geometries, simplifying the existing construction of curved orbits for a given holonomy reduction. To do this, we define an intrinsic holonomy group, which is shown to…
This paper describes an approach for fitting an immersed submanifold of a finite-dimensional Euclidean space to random samples. The reconstruction mapping from the ambient space to the desired submanifold is implemented as a composition of…
The Parameter-Less Self-Organizing Map (PLSOM) is a new neural network algorithm based on the Self-Organizing Map (SOM). It eliminates the need for a learning rate and annealing schemes for learning rate and neighbourhood size. We discuss…
Projection-based model reduction is among the most widely adopted methods for constructing parametric Reduced-Order Models (ROM). Utilizing the snapshot data from solving full-order governing equations, the Proper Orthogonal Decomposition…
Latent space geometry provides a rigorous and empirically valuable framework for interacting with the latent variables of deep generative models. This approach reinterprets Euclidean latent spaces as Riemannian through a pull-back metric,…
Subspace-valued functions arise in a wide range of problems, including parametric reduced order modeling (PROM). In PROM, each parameter point can be associated with a subspace, which is used for Petrov-Galerkin projections of large system…
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…
Computational optimal transport (OT) offers a principled framework for generative modeling. Neural OT methods, which use neural networks to learn an OT map (or potential) from data in an amortized way, can be evaluated out of sample after…
Spatiotemporally chaotic systems, such as the solutions of some nonlinear partial differential equations, are dynamical systems that evolve toward a lower dimensional manifold. This manifold has an intricate geometry with heterogeneous…