Study uses weak transport for non-convex costs in fixed-income markets.
problem Characterizing optimal caplet pricing in fixed-income markets.
method Introduced weak optimal transport for non-convex costs, reduced general costs to convex problems.
result Established robust super-replication results for fixed-income markets.
Study optimal transport on globally hyperbolic spacetimes, focusing on weak Kantorovich potentials' regularity.
problem Investigate regularity of weak Kantorovich potentials on globally hyperbolic spacetimes.
method Apply insights from Riemannian and Lorentzian cases to study π-solutions. result Conclude existence, uniqueness, and structure of optimal transport maps.
We extend martingale transport results to weak martingale transport.
problem Applying martingale transport results to weak martingale transport.
method Change of numeraire for weak martingale transport.
result Established the correspondence between stretched Brownian motion and its geometric counterpart.
NOT learns optimal transport plans, kernel costs improve performance.
problem NOT algorithm learns non-optimal plans with weak quadratic costs.
method Introduced kernel weak quadratic costs to improve NOT's performance.
result Kernel costs provide improved theoretical and practical guarantees.
A new method for averaging probability distributions based on optimal weak mass transport.
problem Averaging probability distributions in a geometric way.
method Weak barycenters based on optimal weak mass transport.
result Extracts common geometric information shared by all input distributions.
The paper introduces a new method for risk measurement using weak optimal transport.
problem Risk measurement in insurance and financial contexts.
method Convex risk measures with weak optimal transport penalties, explicit representation via nonlinear transform, computational aspects, and approximations using neural networks.
result Explicit representation and computational methods for risk measures.
New algorithms solve weak optimal transport problems for nonlinear costs.
problem Computing weak optimal transport with nonlinear costs.
method Mirror descent algorithms for primal and dual versions of WOT.
result Solutions for WOT and WOTUK compared with classical OT.
Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans π1,π2,… converges weakly to a transport plan π, then π is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain asked whether the same property is true for th…
New emulator bridges simulators using conditional optimal transport.
problem Bridging simulators with minimal distortion.
method Flow-based approach to learn likelihood transport, COT-FM for optimal matching.
result Emulator accurately captures full correction between simulators.
We study the mean curvature flow with given non-smooth transport term and forcing term, in suitable Sobolev spaces. We prove the global existence of the weak solutions for the mean curvature flow with the terms, by using the modified Allen-Cahn equation that holds useful properties such as the monotonicity formula.
Proves stability in Weyl polytopes using optimal transport.
problem Stability of Weyl polytopes under optimal transport.
method Optimal transport stability for reflexive Weyl polytopes.
result Weak metric SYZ conjecture holds for Delzant reflexive Weyl polytopes.
The study establishes stability in WMOT, crucial for finance with imprecise data.
problem Stability in weak martingale optimal transport for finance with imprecise data.
method Established stability through rigorous mathematical analysis.
result Stability of WMOT is proven, with applications to VIX futures and Brownian motion.
Extends optimal transport to dynamic and martingale settings.
problem Dynamic and martingale relaxation of optimal transport problems.
method Extends Benamou-Brenier formula to weak optimal transport and introduces barycentric optimal transport.
result Relates barycentric optimal transport to martingale Benamou-Brenier formula.
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 c-convex functions and (weak) Kantorovich potentials do not extend to the Lorentzian setting, but under suitable assumptions, they are locally semconvex. Study on stability of optimal transport problems for probability measures.
problem Stability of supermartingale optimal transport problems.
method Approximation in adapted Wasserstein distance and continuity of functional.
result Continuity and monotonicity principles for weak supermartingale optimal transport.
Extends martingale transport for robust finance problems.
problem Addressing specific robust finance problems not covered by standard martingale transport.
method Introduces an additional parameter to the weak martingale optimal transport problem and proves stability.
result Stability of the extended problem with respect to risk-neutral marginal distributions.
It is shown that curvature-dimension bounds CD(N, k) for a metric measure space (X,d,m) in the sense of Sturm imply a weak L^1- Poincare-inequality under some symmetry assumption on the choice of transport rays in the cut locus of (X,d). This condition is satisfied if (X,d) has m-almost surely no branching points.
DPOT uses deep learning to compute optimal transport efficiently.
problem Computing optimal transport between continuous distributions from unpaired samples.
method DeepParticle methods for min-min optimization without network structure restrictions.
result Established weak convergence and error bounds between learned and optimal maps.
Study compares synthetic and distributional Ricci curvature bounds.
problem Comparing synthetic and distributional approaches to lower Ricci curvature bounds.
method Analyzes synthetic via weak displacement convexity and distributional via non-negativity of Ricci-tensor.
result Distributional bounds imply entropy bounds for C1 metrics and vice versa for C1,1 under convergence condition. In this paper we apply techniques from optimal transport to study the neckpinch examples of Angenent-Knopf which arise through the Ricci flow on Sn+1. In particular, we recover their proof of 'single-point pinching' along the flow. Using the methods of optimal transportation, we are able to remove the ass…
A mesh-free method solves continuum-marginal optimal transport problems.
problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.
Parallel transport defined for 2-bundles over Lie groupoids.
problem Defining parallel transport for 2-bundles over Lie groupoids.
method Using Lie 2-group torsors and pseudofunctors, extending principal 2-bundles to differentiable stacks.
result A smooth parallel transport functor defined for Haefliger paths.
A new algorithm for estimating continuous entropic barycenters under arbitrary costs.
problem Estimating the average of probability distributions under arbitrary cost functions.
method Dual reformulation of Entropic Optimal Transport (EOT) problem based on weak OT.
result Established quality bounds for the recovered solution and seamless integration with EBM learning.
Stein variational gradient descent (SVGD) is a deterministic sampling algorithm that iteratively transports a set of particles to approximate given distributions, based on an efficient gradient-based update that guarantees to optimally decrease the KL divergence within a function space. This paper develops the first th…
Extends martingale Schrödinger bridge to arbitrary dimensions and characterizes it.
problem Tackles the martingale Schrödinger bridge in arbitrary dimensions.
method Identifies continuous-time counterpart and relates to variational problems.
result Continuous martingale Schrödinger bridge coincides with Föllmer martingale in irreducible case.
A new method for fast optimal transport using sliced Wasserstein generalized geodesics.
problem Computing optimal transport distances efficiently and accurately.
method Proposes a new proxy of squared Wasserstein distance based on one-dimensional projections.
result min-SWGG is an upper bound of Wasserstein distance with similar computational complexity.
Unified Kantorovich duality for multimarginal optimal transport on Polish spaces.
problem Optimal transport of multiple probability distributions.
method Unified Kantorovich duality theory for multimarginal optimal transport on general Polish product spaces.
result Unified duality theory for multimarginal optimal transport, extending classical two-marginal conjugacy.
This study compares two methods for sampling with transport maps, finding flow-based proposals work better for multimodal distributions.
problem Sampling from distributions with complex geometries.
method Compares two approaches: (i) proposal draws from the flow and (ii) reparametrization.
result Flow-based proposals are more effective for multimodal distributions in high dimensions, while reparametrization methods are more robust in other scenarios.
A new method selects a representative subsample for efficient kernel density estimation.
problem Selecting a representative subsample without model assumptions.
method Optimal transport techniques for model-free subsampling with an efficient algorithm.
result The selected subsample can be used for efficient density estimation with derived convergence rates and optimal bandwidth.
Develops optimal transport in Lorentzian spaces with synthetic curvature bounds.
problem Synthetic curvature bounds for Lorentzian spaces.
method Optimal transport, convexity analysis of entropy functionals.
result Synthetic notion of timelike Ricci curvature lower bounds.
Novel weak solutions for volume-preserving mean curvature flow established.
problem Existence and uniqueness of solutions to volume-preserving mean curvature flow.
method Introducing varifold solutions coupled with phase volumes and new calibrations.
result Uniqueness of classical solutions among varifold solutions.
We deal with irregular curves contained in smooth, closed, and compact surfaces. For curves with finite total intrinsic curvature, a weak notion of parallel transport of tangent vector fields is well-defined in the Sobolev setting. Also, the angle of the parallel transport is a function with bounded variation, and its …
New varifold solutions for mean curvature flow converge and are unique.
problem Mean curvature flow and Allen-Cahn equation convergence and uniqueness.
method Evolving varifolds coupled to phase volumes, weak-strong uniqueness principle.
result Limits of Allen-Cahn solutions are varifold solutions, and classical flows are unique.
Under Markovian assumptions, we leverage a Central Limit Theorem (CLT) for the empirical measure in the test statistic of the composite hypothesis Hoeffding test so as to establish weak convergence results for the test statistic, and, thereby, derive a new estimator for the threshold needed by the test. We first show t…
A general duality proof for Wasserstein distributionally robust optimization.
problem Optimizing under uncertainty with Wasserstein distance.
method One-dimensional convex analysis and interchangeability principle.
result General duality result holds for various distributions and costs.
We propose a framework for solving high-dimensional Bayesian inference problems using \emph{structure-exploiting} low-dimensional transport maps or flows. These maps are confined to a low-dimensional subspace (hence, lazy), and the subspace is identified by minimizing an upper bound on the Kullback--Leibler divergence …
In this work, we extend existing well-posedness by noise results for the stochastic transport and continuity equations by treating them as special cases of the linear advection equation of k-forms, which arises naturally in geometric fluid dynamics. In particular, we prove the existence and uniqueness of weak Lp-s…
Paper introduces MSA for weakly supervised covariance alignment in MEG signals.
problem Limited labeled signals in target datasets for MEG applications.
method Mixing model Stiefel Adaptation (MSA) leveraging unlabeled data.
result MSA outperforms recent methods in brain-age regression with MEG signals.
We identify a condition for regularity of optimal transport maps that requires only three derivatives of the cost function, for measures given by densities that are only bounded above and below. This new condition is equivalent to the weak Ma-Trudinger-Wang condition when the cost is C4. Moreover, we only require (n…
Let A⊂Rd, d≥2, be a compact convex set and let μ=ϱ0dx be a probability measure on A equivalent to the restriction of Lebesgue measure. Let ν=ϱ1dx be a probability measure on Br:={x:∣x∣≤r} equivalent to the restriction of Lebesgue measure. We prove that t…
We give sufficient conditions for a measured length space (X,d,m) to admit local and global Poincare inequalities. We first introduce a condition DM on (X,d,m), defined in terms of transport of measures. We show that DM, along with a doubling condition on m, implies a scale-invariant local Poincare inequality. We show …
Generative model uses ODEs and RKHSs for measure matching.
problem Minimum divergence generative modeling and sampling.
method Diffeomorphic matching and image registration principles applied to ODEs and RKHSs.
result Theoretical error bounds and extensive numerical experiments demonstrate the method's properties and applicability.
Isotonic regression is a standard problem in shape-constrained estimation where the goal is to estimate an unknown nondecreasing regression function f from independent pairs (xi,yi) where E[yi]=f(xi),i=1,…n. While this problem is well understood both statistically and computationally, much l…
Here we propose a general theoretical method for analyzing the risk bound in the presence of adversaries. Specifically, we try to fit the adversarial learning problem into the minimax framework. We first show that the original adversarial learning problem can be reduced to a minimax statistical learning problem by intr…
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.
We introduce a weak notion of barycenter of a probability measure μ on a metric measure space (X,d,m), with the metric d and reference measure m. Under the assumption that optimal transport plans are given by mappings, we prove that our barycenter B(μ) is well defined; it is a probability measur…
By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry LaborderePenkner,GalichonHenry-LabordereTouzi}. In this paper, we extend the one-dimensional Brenier's theorem to the present…
Stability of timelike Ricci bounds in low-regularity spacetimes.
problem Stability of synthetic timelike Ricci curvature bounds under C0-limits. method Constructing smooth approximations and analyzing limiting behavior via Lorentzian optimal transport.
result Impulsive gravitational waves satisfy synthetic timelike Ricci curvature lower bounds.