Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

20406080 · May 202619922001200920172026
48 results for geodesic interpolation

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…

2020-02-12abs ↗pdf ↗

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.

In this article, a proof of the interpolation inequality along geodesics in pp-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…

2013-11-21abs ↗pdf ↗

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…

2019-05-30abs ↗pdf ↗

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.

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.

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.

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.

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,…

2013-04-10abs ↗pdf ↗

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(N1/2)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 TTTT^* argument, simply by using the L2L^2-boundedness of the Hilbert transform on R\R, we are able to improve the corresponding L2L^2-restriction bounds of Burq, Gérard …

2012-10-28abs ↗pdf ↗

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.

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 …

2017-05-15abs ↗pdf ↗

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 MM that satisfy a variational condition appropriate for interpolation problems. When MM 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…

2011-04-13abs ↗pdf ↗

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 …

2018-11-08abs ↗pdf ↗

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.

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.