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.

169,291 papers · 148 categories

Trend · papers per month

205409614818 · Jun 202019922001200920182026
48 results for Monge optimal transport

New framework for optimal transport with jumps over intermediate spaces.

problem Optimal transport with mass jumps over intermediate spaces.
method Hierarchical Jump multi-marginal transport (HJMOT) on Polish spaces.
result Existence and uniqueness of Monge solutions under sequential differentiability and twist condition.

Study optimal transport on simplex boundary, proving transport map and potential regularity.

problem Regularity of transport map and potential on simplex boundary.
method Boundary regularity results for optimal transport maps, exploiting simplex symmetries.
result Regularity properties of transport map and its convex potential.

Optimal transport adapted for contaminated probabilities, showing equivalence under specific conditions.

problem Adapting optimal transport for εε-contaminated sets.
method Generalized optimal transport problems with lower probabilities, showing equivalence under εε-contaminations.
result Monge's and Kantorovich's problems coincide under εε-contaminated sets, but not always.

Optimal transport explored on a specific geometric space.

problem Optimal transport problem in sub-Lorentzian Heisenberg group.
method Synthetic metric spacetime structure analysis and sub-Lorentzian version of Brenier's theorem.
result Established sub-Lorentzian version of Brenier's theorem and derived Monge-Ampère equation.

New method calculates cut locus on Riemannian manifolds using optimal transport.

problem Computing the cut locus on compact Riemannian manifolds.
method Characterization via optimal transport density solution of Monge-Kantorovich equations, numerical approximation.
result Proposed novel framework for numerical approximation of cut locus.

Study optimal transport in 4D sub-Riemannian spaces with many singular geodesics.

problem Existence and uniqueness of optimal transport maps in sub-Riemannian structures.
method Analysis of Monge optimal transport problem in sub-Riemannian manifolds.
result Extension of previous results to sub-Riemannian structures of rank two in 4D.

Solves a general class of free boundary Monge-Ampère equations.

problem Optimal transport with degenerate densities and geometric problems.
method Analyzes a specific class of Monge-Ampère equations and their applications.
result Solves the equations for a general class, including applications to optimal transport and geometric problems.

This work explains GAN mode collapse and convergence issues via optimal transportation theory.

problem GANs struggle with convergence and mode collapse due to discontinuous optimal transportation mappings.
method The study connects GANs to optimal transportation theory, testing hypotheses about discontinuity and proposing a new method to approximate continuous Brenier potentials.
result The supports of real data distributions are often non-convex, leading to discontinuous optimal transportation mappings and mode collapse in GANs.

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

SOS programming verifies MTW tensor non-negativity for optimal transport maps.

problem Verifying MTW tensor non-negativity for general cost functions is difficult.
method Sum-of-Squares (SOS) programming for verifying and approximating MTW non-negativity.
result SOS programming provides certificates and approximations of MTW non-negativity.

Research shows no dual solutions for Lorentzian cost functions in general, but proves their existence under certain conditions.

problem Existence of dual solutions for Lorentzian cost functions in optimal transportation problems.
method Analyzes dual problem in Lorentz-Finsler geometry, proves existence under natural assumptions, and shows implications for optimal transport.
result Existence of dual solutions under specific conditions, implying timelike optimal transport on a set of full measure.

Paper explores Monge-Ampère in deep learning and quantum geometry.

problem Understanding the Monge-Ampère equation in deep learning.
method Review of Boltzmann learning, connection to optimal transport, insights from quantum geometry, renormalization group flow.
result Space of covariance matrices in learning dynamics coincides with the CAH cone.

New bounds on optimal transport regularization show faster convergence rates than previously known.

problem Understanding the localization rate of Quadratically Regularized Optimal Transport (QOT) optimizers.
method Established lower bounds and derived mean-squared deviation controls for QOT optimizers.
result Lower bound of support concentration rate ε1d+2\varepsilon^{\frac{1}{d+2}} in directed Hausdorff distance.

These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures endowed with the distances WpW_p induced by optimal transport are detailed. The ke…

2010-09-20abs ↗pdf ↗

New theorem connects probabilistic permanental point processes to Monge-Ampère equation.

problem Probabilistic interpretation of Monge-Ampère equation boundary value problem.
method Large deviation principles and optimal transport theory.
result Explicit rate function for permanental point processes large deviation.

The paper provides a concentration result and sample complexity for linear Monge mapping estimation and its application in domain adaptation.

problem Estimating the linear Monge mapping between distributions and its application in domain adaptation.
method The approach involves proving a concentration result and sample complexity for the linear mapping operator, and using it to derive a generalization bound for domain adaptation with optimal transport.
result The method achieves a sample complexity of n1/2n^{-1/2} and approaches the performance of theoretical Bayes predictor under mild conditions.

The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of the transport paths is studied. These results generalize parts of Bertrand & Puel…

2016-01-18abs ↗pdf ↗

Optimal transport reformulates multiple quantile hedging problem.

problem Multiple quantile hedging problem in incomplete markets.
method Reformulated as Monge optimal transport problem, introduced Kantorovitch version, proved no duality gap.
result Multiple quantile hedging problem can be seen as semi-discrete optimal transport problem.

New method learns disentangled representations using Gromov-Monge maps.

problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.

Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.

problem Optimal transport couplings are probabilistic objects, while many learning pipelines require deterministic maps.
method Develop a framework for barycentric projections of transport couplings on Riemannian manifolds.
result The intrinsic projection maps each source point to the conditional Fréchet mean of its destination law and is shown to be the best deterministic representative under squared geodesic loss.

The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.

problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.

Study shows how optimal transport behaves in higher dimensions.

problem Characterizing optimal transport in higher dimensions with Euclidean distance.
method Investigates the small regularization limit of entropic optimal transport.
result The limiting transport plan is supported on transport rays and uniquely minimizes a relative entropy functional.

New algorithm for estimating multivariate quantiles using stochastic optimal transport.

problem Estimating multivariate quantiles from data.
method Stochastic algorithm for entropic optimal transport in Banach spaces, using Fourier coefficients.
result Almost sure convergence of the stochastic algorithm in infinite-dimensional Banach spaces.

In this work, we show how to obtain for non-compact manifolds the results that have already been done for Monge Transport Problem for costs coming from Tonelli Lagrangians on compact manifolds. In particular, the already known results for a cost of the type dr,r>1d^r,r>1, where dd is the Riemannian distance of a complete …

2007-11-28abs ↗pdf ↗