相关论文: Computing distances and means on manifolds with a …

Approximating a manifold-valued function from samples of input-output pairs consists of modeling the relationship between an input from a vector space and an output on a Riemannian manifold. We propose a function approximation method that…

In this paper, we consider the problem of minimizing a smooth function on a Riemannian manifold and present a Riemannian gradient method with momentum. The proposed algorithm represents a substantial and nontrivial extension of a recently…

This paper considers fundamental issues related to Finslerian isometries, submetries, distance and geodesics. It is shown that at each point of a Finsler manifold there is a distance coordinate system. Using distance coordinates, a simple…

The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM)…

The continuous Frechet distance between two polygonal curves is classically computed by exploring their free space diagram. Recently, Har-Peled, Raichel, and Robson [SoCG'25] proposed a radically different approach: instead of directly…

The isometric embedding problem for Riemannian manifolds, which connects intrinsic and extrinsic geometry, is a central question in differential geometry with deep theoretical significance and wide-ranging applications. Despite extensive…

Many machine learning applications are naturally formulated as optimization problems on Riemannian manifolds. The main idea behind Riemannian optimization is to maintain the feasibility of the variables while moving along a descent…

In this paper, we consider a non-local approximation of the time-dependent Eikonal equation defined on a Riemannian manifold. We show that the local and the non-local problems are well-posed in the sense of viscosity solutions and we prove…

There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…

Multidimensional scaling (MDS) is a dimensionality reduction tool used for information analysis, data visualization and manifold learning. Most MDS procedures embed data points in low-dimensional Euclidean (flat) domains, such that…

Representing, comparing, and measuring the distance between probability distributions is a key task in computational statistics and machine learning. The choice of representation and the associated distance determine properties of the…

We propose a robust and scalable procedure for general optimization and inference problems on manifolds leveraging the classical idea of `median-of-means' estimation. This is motivated by ubiquitous examples and applications in modern data…

For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…

We start by considering the problem of estimating intrinsic distances on a smooth submanifold. We show that minimax optimality can be obtained via a reconstruction of the surface, and discuss the use of a particular mesh construction -- the…

Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…

In this paper we prove the equivalence between some known notions of solutions to the eikonal equation and more general analogs of the Hamilton-Jacobi equations in complete and rectifiably connected metric spaces. The notions considered are…

We determine the Euclidean distance degrees of the three most common manifolds arising in manifold optimization: flag, Grassmann, and Stiefel manifolds. For the Grassmannian, we will also determine the Euclidean distance degree of an…

Let $M$ be a complete Riemannian manifold and $F\subset M$ a set with a nonempty interior. For every $x\in M$, let $D_x$ denote the function on $F\times F$ defined by $D_x(y,z)=d(x,y)-d(x,z)$ where $d$ is the geodesic distance in $M$. The…

This paper is devoted to Riemann-Hilbert problems with constraints. We obtain results characterizing the existence of solutions as well as the dimension of the solution space in terms of certain indices. As an application, we show how such…

We address the problem of testing hypotheses about a specific value of the Fr\'echet mean in metric spaces, extending classical mean testing from Euclidean spaces to more general settings. We extend an Euclidean testing procedure…