Related papers: Efficient Quasi-Geodesics on the Stiefel Manifold

Reformulating computer vision problems over Riemannian manifolds has demonstrated superior performance in various computer vision applications. This is because visual data often forms a special structure lying on a lower dimensional space…

The Riemannian manifold of curves with a Sobolev metric is an important and frequently studied model in the theory of shape spaces. Various numerical approaches have been proposed to compute geodesics, but so far elude a rigorous…

We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to…

Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is…

We propose a new strong Riemannian metric on the manifold of (parametrized) embedded curves of regularity $H^s$, $s\in(3/2,2)$. We highlight its close relationship to the (generalized) tangent-point energies and employ it to show that this…

We first derive the relation between the eikonal approximation to the Maxwell wave equations in an inhomogeneous anisotropic medium and geodesic motion in a three dimensional Riemannian manifold using a method which identifies the…

A Riemannian manifold is said to be uniformly secure if there is a finite number $s$ such that all geodesics connecting an arbitrary pair of points in the manifold can be blocked by $s$ point obstacles. We prove that the number of geodesics…

We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal $r$- frames in $\mathbf{R}^n$), which has applications in high-dimensional semi-supervised classification tasks. To reduce the…

We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…

Point cloud completion seeks to recover geometrically consistent shapes from partial or sparse 3D observations. Although recent methods have achieved reasonable global shape reconstruction, they often rely on Euclidean proximity and…

We explore two properties of backward orbits under semigroups of holomorphic self-maps in the unit disk. First, we prove that regular backward orbits are quasi-geodesics for the hyperbolic distance of the unit disk. Then, we show that…

Deep generative models are tremendously successful in learning low-dimensional latent representations that well-describe the data. These representations, however, tend to much distort relationships between points, i.e. pairwise distances…

We investigate the geometry of a family of equations in two dimensions which interpolate between the Euler equations of ideal hydrodynamics and the inviscid surface quasi-geostrophic equation. This family can be realised as geodesic…

Optimization under the symplecticity constraint is an approach for solving various problems in quantum physics and scientific computing. Building on the results that this optimization problem can be transformed into an unconstrained problem…

In this work, we propose to study the global geometrical properties of generative models. We introduce a new Riemannian metric to assess the similarity between any two data points. Importantly, our metric is agnostic to the parametrization…

Meta-learning, or "learning to learn," aims to enable models to quickly adapt to new tasks with minimal data. While traditional methods like Model-Agnostic Meta-Learning (MAML) optimize parameters in Euclidean space, they often struggle to…

Accurate quantification of complex human movements, such as gait, is essential for clinical diagnosis and rehabilitation but is often limited by traditional linear models rooted in Euclidean geometry. These frameworks frequently fail to…

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…

We consider a distributed non-convex optimization where a network of agents aims at minimizing a global function over the Stiefel manifold. The global function is represented as a finite sum of smooth local functions, where each local…

We propose a Riemannian limited-memory BFGS method for optimization problems with Euclidean bounds. The method combines a limited-memory quasi-Newton update in the tangent space with a Riemannian adaptation of the generalized Cauchy point…