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,742 papers · 148 categories

Trend · papers per month

245490735980 · Jun 202019922001200920172026
48 results for optimal transport theory

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 ↗

This work broadens optimal transport map estimation theory to stochastic settings.

problem Existing theory for optimal transport map estimation is restricted to deterministic maps under specific conditions.
method Introduces a novel metric for evaluating stochastic maps, develops computationally efficient estimators with robust guarantees.
result First general-purpose theory for map estimation compatible with real-world stochastic applications.

Paper investigates optimal transport map estimation in infinite-dimensional spaces.

problem Estimating optimal transport maps in infinite-dimensional spaces is challenging.
method Characterizes γγ-smoothness for optimal transport maps and develops a polynomial-rate estimator.
result Shows polynomial-order minimax risk for optimal transport map estimation.

In this paper, we present a novel and principled approach to learn the optimal transport between two distributions, from samples. Guided by the optimal transport theory, we learn the optimal Kantorovich potential which induces the optimal transport map. This involves learning two convex functions, by solving a novel mi…

2019-08-28abs ↗pdf ↗

Introduces a new geometric method for optimal experimental design.

problem Restrictive invariance properties of traditional OED approaches based on probability densities.
method Mutual transport dependence (MTD) using optimal transport theory.
result Demonstrates high-quality designs and flexibility compared to standard methods.

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.

Develops regularity theory for Beckmann's optimal transport problem.

problem Minimizing total squared flux in continuous transport from source to target.
method Unconstrained Lagrangian formulation, variational first order optimality conditions, Schauder estimates.
result Exact Hölder regularity of potential, flux, and flow generating on bounded, regular domains.

This thesis tackles Optimal Transport on incomparable spaces, proposing new tools and properties.

problem How to apply Optimal Transport between graphs and structured data in different metric spaces?
method Study of Gromov-Wasserstein distance and development of new Optimal Transport tools.
result Mathematical properties and algorithmic solutions for transport problems on incomparable spaces.

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 ↗

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.

New forms of multi-marginal POT problem derived for computational efficiency.

problem Optimizing transport between multiple unbalanced measures with limited supports.
method Developed two equivalence forms of the POT problem and an optimization algorithm, ApproxMPOT.
result ApproxMPOT algorithm achieves optimal value with complexity ildeO(m3(n+1)m/ε2) ilde{\mathcal{O}}(m^3(n+1)^{m}/ \varepsilon^2).

This work builds the connection between the regularity theory of optimal transportation map, Monge-Ampère equation and GANs, which gives a theoretic understanding of the major drawbacks of GANs: convergence difficulty and mode collapse. According to the regularity theory of Monge-Ampère equation, if the support of the …

2019-02-08abs ↗pdf ↗

We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality theory for general marginals and measurable reward (cost) functions: absence of a…

2015-07-02abs ↗pdf ↗

Develops a new duality between entropy martingale optimal transport and nonlinear pricing-hedging.

problem Entropy Martingale Optimal Transport problem and its associated optimization problem.
method Combines Entropy Optimal Transport and Martingale Optimal Transport theories, with novel penalization terms and constraints.
result Establishes a nonlinear robust pricing-hedging duality, covering various known robust results.

The paper establishes general results in Lorentzian optimal transport theory.

problem Establishing strong duality and optimality conditions in Lorentzian optimal transport.
method Providing non-trivial assumptions on measures, characterizing optimality, and proving regularity results.
result Regularity results for cc-convex functions and (weak) Kantorovich potentials do not extend to the Lorentzian setting, but under suitable assumptions, they are locally semconvex.

Paper introduces information-constrained optimal transport, generalizing Talagrand's inequality.

problem Optimal transport problem with information constraints.
method Information constrained variation of optimal transport, using Marton's approach.
result Recovery of concentration of measure results and solution to Cover's open problem.

New robust method for optimal transportation improves statistical inference.

problem Sensitivity to outliers and undefinedness in optimal transportation methods.
method Robust optimal transportation with a tuning parameter λ, leading to robust Wasserstein distance.
result The robust method provides statistical guarantees and improves machine learning applications.

New geometric approach gives apriori estimate for optimal transport maps.

problem Proving regularity of optimal transport maps under Ma--Trudinger--Wang condition.
method Geometric derivation using pseudo-Riemannian geometry.
result New derivation of C1C^1 interior estimate for optimal maps.

In this paper we give a new proof of a theorem by Alexandrov on the Gauss curvature prescription of Euclidean convex sets. This proof is based on the duality theory of convex sets and on optimal mass transport. A noteworthy property of this proof is that it does not rely neither on the theory of convex polyhedra nor on…

2015-05-18abs ↗pdf ↗

Estimates discontinuous optimal transport maps between a discrete and continuous distribution.

problem Estimating discontinuous optimal transport maps between a discrete and continuous distribution.
method Entropic optimal transport estimator, computationally efficient.
result The estimator converges at the minimax-optimal rate n1/2n^{-1/2} in the semi-discrete setting.

The paper solves the optimal transport problem between algebraic hypersurfaces.

problem Optimal deformation of projective hypersurfaces.
method Measure theory and optimal transport, embedding into measure space, constrained dynamical formulation.
result Introduction of an inner Wasserstein distance finer than the Fubini-Study distance.

The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach lattice X\cal{X} with a order unit. The primal problem is given as the supremum o…

2016-10-10abs ↗pdf ↗

We derive upper bounds on the generalization error of learning algorithms based on their \emph{algorithmic transport cost}: the expected Wasserstein distance between the output hypothesis and the output hypothesis conditioned on an input example. The bounds provide a novel approach to study the generalization of learni…

2018-11-08abs ↗pdf ↗

Optimal transport for functional data using Hilbert-Schmidt operators.

problem Optimal transport for distributions on function spaces with partially represented stochastic maps.
method Regularization technique to restrict transport maps to Hilbert-Schmidt operators, developing an efficient algorithm.
result Existence, uniqueness, and consistency of the Hilbert-Schmidt operator estimate for the transport map.

Unified framework for DRO using OT with constraints.

problem Handling ambiguity in likelihood ratios and outcomes.
method Unified framework leveraging optimal transport with conditional moment constraints.
result Unified approach enables adversarial perturbation of likelihood ratios and outcomes.