Related papers: Stitching Data: Recovering a Manifold's Geometry f…

We prove that knowing the length of geodesics joining points on the boundary of a two-dimensional, compact, simple Riemannian manifold with boundary, we can determine uniquely the Riemannian metric up to the natural obstruction.

We analyze the inverse problem, originally formulated by Dix in geophysics, of reconstructing the wave speed inside a domain from boundary measurements associated with the single scattering of seismic waves. We consider a domain $\tilde M$…

Real world data often lie on low-dimensional Riemannian manifolds embedded in high-dimensional spaces. This motivates learning degenerate normalizing flows that map between the ambient space and a low-dimensional latent space. However, if…

For robots to work alongside humans and perform in unstructured environments, they must learn new motion skills and adapt them to unseen situations on the fly. This demands learning models that capture relevant motion patterns, while…

Dix formulated the inverse problem of recovering an elastic body from the measurements of wave fronts of point sources. We geometrize this problem in the context of seismology, leading to the geometrical inverse problem of recovering a…

Modern machine learning increasingly leverages the insight that high-dimensional data often lie near low-dimensional, non-linear manifolds, an idea known as the manifold hypothesis. By explicitly modeling the geometric structure of data…

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…

We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

Representing a manifold of very high-dimensional data with generative models has been shown to be computationally efficient in practice. However, this requires that the data manifold admits a global parameterization. In order to represent…

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…

Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…

High-dimensional data with intrinsic low-dimensional structure is ubiquitous in machine learning and data science. While various approaches allow one to learn a data manifold with a Riemannian structure from finite samples, performing…

The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in…

Assume that $M$ is a compact Riemannian manifold of bounded geometry given by restrictions on its diameter, Ricci curvature and injectivity radius. Assume we are given, with some error, the first eigenvalues of the Laplacian $\Delta_g$ on…

Let $(N,g)$ be a Riemannian manifold with the distance function $d(x,y)$ and an open subset $M\subset N$. For $x\in M$ we denote by $D_x$ the distance difference function $D_x:F\times F\to \mathbb R$, given by…

In this paper, we leverage the properties of non-Euclidean Geometry to define the Geodesic distance (GD) on the space of statistical manifolds. The Geodesic distance is a real and intuitive similarity measure that is a good alternative to…

In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover man…

This paper introduces a novel approach to statistics and data analysis, departing from the conventional assumption of data residing in Euclidean space to consider a Riemannian Manifold. The challenge lies in the absence of vector space…

We study the boundary rigidity problem with partial data consisting of determining locally the Riemannian metric of a Riemannian manifold with boundary from the distance function measured at pairs of points near a fixed point on the…