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

Manifold learning has been proven to be an effective method for capturing the implicitly intrinsic structure of non-Euclidean data, in which one of the primary challenges is how to maintain the distortion-free (isometry) of the data…

Manifold learning is a fundamental task at the core of data analysis and visualisation. It aims to capture the simple underlying structure of complex high-dimensional data by preserving pairwise dissimilarities in low-dimensional…

A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured…

We consider a region $M$ in $\mathbb{R}^n$ with boundary $\partial M$ and a metric $g$ on $M$ conformal to the Euclidean metric. We analyze the inverse problem, originally formulated by Dix, of reconstructing $g$ from boundary measurements…

The class of statistical manifolds with divisible cubic forms arises from affine differential geometry. We examine the geodesic connectedness of affine connections on this class of statistical manifolds. In information geometry, the…

In recent decades, advancements in motion learning have enabled robots to acquire new skills and adapt to unseen conditions in both structured and unstructured environments. In practice, motion learning methods capture relevant patterns and…

We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions.…

This paper shows how to use the shooting method, a classical numerical algorithm for solving boundary value problems, to compute the Riemannian distance on the Stiefel manifold $ \mathrm{St}(n,p) $, the set of $ n \times p $ matrices with…

Parametrizations of data manifolds in shape spaces can be computed using the rich toolbox of Riemannian geometry. This, however, often comes with high computational costs, which raises the question if one can learn an efficient neural…

Manifold-learning techniques are routinely used in mining complex spatiotemporal data to extract useful, parsimonious data representations/parametrizations; these are, in turn, useful in nonlinear model identification tasks. We focus here…

We explore the geometric implications of introducing a spectral cut-off on Riemannian manifolds. This is naturally phrased in the framework of non-commutative geometry, where we work with spectral triples that are \emph{truncated} by…

Nonlinear dimensionality reduction methods provide a valuable means to visualize and interpret high-dimensional data. However, many popular methods can fail dramatically, even on simple two-dimensional manifolds, due to problems such as…

The knowledge that data lies close to a particular submanifold of the ambient Euclidean space may be useful in a number of ways. For instance, one may want to automatically mark any point far away from the submanifold as an outlier or to…

Reasoning about rolling and sliding contact, or roll-slide contact for short, is critical for dexterous manipulation tasks that involve intricate geometries. But existing works on roll-slide contact mostly focus on continuous shapes with…

We solve explicitly the geodesic equation for a wide class of (pseudo)-Riemannian homogeneous manifolds (G/H,m), including those with G compact, as well as non-compact semisimple Lie groups, under a simple algebraic condition for the metric…

Geodesics become an essential element of the geometry of a semi-Riemannian manifold. In fact, their differences and similarities with the (positive definite) Riemannian case, constitute the first step to understand semi-Riemannian Geometry.…

Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…

The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…

The geodesics for a sub-Riemannian metric on a three-dimensional contact manifold $M$ form a 1-parameter family of curves along each contact direction. However, a collection of such contact curves on $M$, locally equivalent to the solutions…

We study inverse boundary problems for first order perturbations of the biharmonic operator on a conformally transversally anisotropic Riemannian manifold of dimension $n \ge 3$. We show that a continuous first order perturbation can be…