In this paper, we propose a method to learn a minimizing geodesic within a data manifold. Along the learned geodesic, our method can generate high-quality interpolations between two given data samples. Specifically, we use an autoencoder network to map data samples into latent space and perform interpolation via an int…
Interpolating between points is a problem connected simultaneously with finding geodesics and study of generative models. In the case of geodesics, we search for the curves with the shortest length, while in the case of generative models we typically apply linear interpolation in the latent space. However, this interpo…
Generative models learn manifold structure; new approach uses atlas and geodesic interpolation.
problem Challenges in representing manifolds with topology different from Euclidean space.
method Atlas Generative Models (AGMs) with hybrid latent spaces and geodesic interpolation.
result Geodesic interpolation can be extended to AGMs, improving manifold representation.
Proposes robust model through Wasserstein geodesic interpolation of training data.
problem Improving model robustness through data augmentation.
method Augment data by finding worst-case Wasserstein barycenter on geodesic path.
result Improves robustness on CIFAR-10 up to 7.7% and on CIFAR-100 up to 16.8%.
In this article, a proof of the interpolation inequality along geodesics in p-Wasserstein spaces is given. This interpolation inequality was the main ingredient to prove the Borel-Brascamp-Lieb inequality for general Riemannian and Finsler manifolds and led Lott-Villani and Sturm to define an abstract Ricci curvature…
RNGI model bridges two probability densities on Riemannian manifolds efficiently.
problem Limited applicability of Euclidean stochastic interpolants to Riemannian manifolds.
method Introduces RNGI model interpolating between Riemannian manifold probability densities along geodesics.
result Proves temporal marginal density solves transport equation on Riemannian manifold.
Improves latent space structure for better data representation.
problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.
We propose Gaussian optimal transport for Image style transfer in an Encoder/Decoder framework. Optimal transport for Gaussian measures has closed forms Monge mappings from source to target distributions. Moreover interpolates between a content and a style image can be seen as geodesics in the Wasserstein Geometry. Usi…
MFM improves generative model interpolations by learning approximate geodesics on data manifolds.
problem Straight interpolations fail to capture dynamics on data manifolds.
method Metric Flow Matching (MFM) learns approximate geodesics by minimizing kinetic energy of a data-induced Riemannian metric.
result MFM outperforms Euclidean baselines, achieving SOTA on single-cell trajectory prediction.
Introduces mobility algebra for modeling geodesics on n-spheres.
problem Modeling geodesics on n-spheres using algebraic structures.
method Introduces mobility algebra and mobility spaces, showing connections to modules and affine spaces.
result Shows geodesics on n-spheres as mobility spaces over unit interval mobility algebra.
SLERP interpolation optimizes dynamic weight rebalancing in AMMs.
problem Optimizing dynamic weight rebalancing in automated market makers (AMMs).
method Riemannian geometry and SLERP interpolation.
result SLERP interpolation minimizes the KL divergence loss in dynamic weight rebalancing.
In this paper, we propose a nonlinear distance metric learning scheme based on the fusion of component linear metrics. Instead of merging displacements at each data point, our model calculates the velocities induced by the component transformations, via a geodesic interpolation on a Lie transfor- mation group. Such vel…
Exploiting the deep generative model's remarkable ability of learning the data-manifold structure, some recent researches proposed a geometric data interpolation method based on the geodesic curves on the learned data-manifold. However, this interpolation method often gives poor results due to a topological difference …
Simpler algorithms for morphing planar and toroidal graphs.
problem Constructing smooth transitions between isomorphic drawings of planar and toroidal graphs.
method Barycentric interpolation and scaling strategy.
result Simplified and more natural morphs with improved computational efficiency.
This research solves Hermite interpolation on manifolds using retractions.
problem Interpolating data on non-Euclidean spaces with matching derivatives.
method Proposes a novel procedure using retractions for Hermite interpolation on various manifolds.
result Establishes the well-posedness of the method and extends Hermite interpolation results to manifolds.
New quasi-geodesics for Stiefel manifold simplify complex computations.
problem Efficiently solving geodesic endpoint problem on Stiefel manifold.
method Derived new representations of quasi-geodesics for large-scale computations.
result New quasi-geodesics are closer to Riemannian geodesics.
We consider geodesic flows between hypersurfaces in Rn. However, rather than consider using geodesics in Rn, which are straight lines, we consider an induced flow using geodesics between the tangent spaces of the hypersurfaces viewed as affine hyperplanes. For naturality, we want the geodesic flow to be invaria…
Magnetic Brunn-Minkowski inequalities on Riemannian manifolds
problem Establishing equivalence between Brunn-Minkowski inequalities and magnetic Ricci curvature
method Using magnetic geodesics
result Proving a sharp, undistorted Brunn-Minkowski inequality
This work proposes a model for geodesic distances and flows on manifolds.
problem Geodesic distances and flows on differentiable manifolds.
method Manifold-augmented Eikonal equation solutions.
result Geodesic flow provides globally length-minimizing curves.
This paper develops optimal transport methods on the roto-translation group SE2.
problem Optimal transport on the roto-translation group SE2 for image analysis.
method Develops a computational framework for optimal transportation over Lie groups, focusing on SE2. Uses Sinkhorn-like algorithm with efficient distance approximations.
result Advances in image barycentric interpolation, orientation field interpolation, and Wasserstein flows on SE2.
We construct geodesics in the Wasserstein space of probability measure along which all the measures have an upper bound on their density that is determined by the densities of the endpoints of the geodesic. Using these geodesics we show that a local Poincaré inequality and the measure contraction property follow from t…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface interpolating a given curve as the geodesic curve of it. Also, we analyze the con…
Paper proves Hölder continuity of tangent cones in RCD(K,N) spaces.
problem Understanding the geometry of metric measure spaces with curvature-dimension condition.
method Developed a second order interpolation formula for distance function.
result Tangent cones from rescalings are Hölder continuous along geodesics.
Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the di…
Non-ergodic geodesic flow on Cantor tree surfaces found.
problem Determining when geodesic flow on Cantor tree surfaces is non-ergodic.
method Interpolating between two rates of convergence of cuff lengths to zero to prove non-ergodicity.
result Cantor tree surfaces with certain rates of cuff length convergence are non-parabolic.
We create a smooth manifold of triangular meshes with a geodesically complete metric.
problem Representing and manipulating 2D shapes as triangular meshes.
method Developed a geodesically complete Riemannian metric for triangular meshes.
result The metric preserves mesh connectivity and avoids mesh degradation.
GAGA learns a warped metric for geometry-aware data generation and interpolation.
problem Challenges in generating data with meaningful geometry in high-dimensional datasets.
method Combines manifold learning with generative modeling to learn a warped Riemannian metric.
result GAGA improves trajectory inference by 30% in single-cell population-level data.
A new geometry for comparing signals, overcoming traditional limitations.
problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.
Unified framework for human motion generation on Riemannian manifolds.
problem Learning valid human motion in Euclidean spaces.
method Riemannian Motion Generation (RMG) on product manifolds, Riemannian flow matching.
result Achieves state-of-the-art FID (0.043) on HumanML3D and surpasses strong baselines on MotionMillion.
Study the geometry of hydrodynamics equations using diffeomorphism groups.
problem Investigate the Euler equations and surface quasi-geostrophic equation family.
method Realize equations as geodesic equations on diffeomorphism groups and analyze Riemannian exponential maps.
result Show precise conditions for non-linear Fredholm maps of index 0.
Study contractibility of boundaries in convex sets and limit sets of subgroups.
problem Understanding contractibility of boundaries and wildness of limit sets in geometric structures.
method Use sufficient conditions for contractibility, study coarse upper curvature bounds, and analyze interpolation in geodesic metric spaces.
result Conditions for contractibility of boundaries and properties of limit sets are established.
Let (M.F) be a complete Finsler manifold and P be a minimal and compact submanifold of M. Ric_k(x), x in M is a differential invariant that interpolates between the flag curvature and the Ricci curvature. We prove that if on any geodesic c(t) emanating orthogonally from P we have \int_{0}^{\infty}\mathbf{Ric}_{k}(t)>0,…
The paper analyzes discrete approximations to minimize curve length in Euclidean space.
problem Minimizing the length of curves between two sets in Euclidean space.
method Finite differences and numerical integration for discrete approximations.
result The squared length of the reconstructed curve converges to the squared minimal length with rate O(N−1/2). We prove a couple of new endpoint geodesic restriction estimates for eigenfunctions. In the case of general 3-dimensional compact manifolds, after a TT∗ argument, simply by using the L2-boundedness of the Hilbert transform on R, we are able to improve the corresponding L2-restriction bounds of Burq, Gérard …
Optimal transport learns Riemannian metrics for evolving probability measures.
problem Learning metrics for evolving probability measures on Riemannian manifolds.
method Neural parametrization of a metric tensor via optimal transport, alternating optimization scheme.
result Improved trajectory inference on scRNA and bird migration data.
Study magnetic geodesics on odd spheres, computing critical energy values.
problem Understanding magnetic geodesics on odd-dimensional spheres.
method Explicit computation and analysis of submanifolds and symmetries.
result Energy values determine magnetic geodesic connectivity on spheres.
This paper improves probabilistic latent models on hyperbolic spaces.
problem Uncertainty in predictions due to geodesics crossing low-data regions.
method Augmenting hyperbolic manifold with a pullback metric for probabilistic pullback metrics.
result Geodesics on pullback metric respect both geometry and data distribution, reducing uncertainty.
The study classifies surfaces with specific curvature properties.
problem Classifying surfaces with a particular curvature equation.
method Analyzing surfaces in 3D Euclidean space with a specific curvature equation.
result A one-parameter family of surfaces meeting the unit ball orthogonally.
We prove that ideal sub-Riemannian manifolds (i.e., admitting no non-trivial abnormal minimizers) support interpolation inequalities for optimal transport. A key role is played by sub-Riemannian Jacobi fields and distortion coefficients, whose properties are remarkably different with respect to the Riemannian case. As …
Lower bounds for geodesically convex optimization show curvature negatively impacts complexity.
problem Understanding the impact of curvature on the query complexity of geodesically convex optimization.
method Building on recent lower bounds, the study proposes and proves new lower bounds for various settings of geodesically convex optimization.
result Negative curvature is detrimental to the complexity of geodesically convex optimization.
{\em Riemannian cubics} are curves in a manifold M that satisfy a variational condition appropriate for interpolation problems. When M is the rotation group SO(3), Riemannian cubics are track-summands of {\em Riemannian cubic splines}, used for motion planning of rigid bodies. Partial integrability results are know…
This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.
problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.
We present a definition of null G-structures on Lorentzian manifolds and investigate their geometric properties. This definition includes the Robinson structure on 4-dimensional black holes as well as the null structures that appear in all supersymmetric solutions of supergravity theories. We also identify the induced …
RG-VFM extends VFM to curved manifolds for better material and protein design.
problem Designing materials and proteins on curved manifolds.
method Riemannian Gaussian Variational Flow Matching (RG-VFM) for generative modeling on manifolds.
result RG-VFM more effectively captures manifold structure and improves performance.
EntroPath learns manifold geometry from diffusion paths.
problem Learning geodesic geometry from data graphs with spurious shortcuts.
method Maximum Entropy Path Ensemble Embedding (MERW) with k-step diffusion paths.
result EntroPath converges to squared geodesic distance in the short-time limit.
Establishes a link between heat diffusion and manifold distances in data.
problem No theoretical link between diffusion-based manifold learning and geodesic distances.
method Formulates heat geodesic embeddings based on Riemannian geometry.
result Method outperforms state-of-the-art in preserving manifold distances and cluster structure.
About 15 years ago, Bismut gave a natural construction of a Hodge theory for a hypoelliptic Laplacian acting on the total space of the cotangent bundle of a Riemannian manifold. This operator interpolates between the classical elliptic Laplacian on the base and the generator of the geodesic flow. We will describe recen…
New FX option interpolations impact implied volatilities.
problem Different interpolations of FX option quotes lead to varying implied volatilities.
method Analysis of various exact interpolations of broker quotes.
result Different interpolations result in different implied volatilities.