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

Trend · papers per month

285684112 · May 202619922001200920172026
48 results for weak transport

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.

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.

Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans π1,π2,π_1, π_2, \ldots 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…

2019-04-08abs ↗pdf ↗

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 cc-convex functions and (weak) Kantorovich potentials do not extend to the Lorentzian setting, but under suitable assumptions, they are locally semconvex.

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.

2005-05-26abs ↗pdf ↗

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 C1C^1 metrics and vice versa for C1,1C^{1,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\mathbb{S}^{n+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…

2014-04-28abs ↗pdf ↗

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.

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…

2017-04-25abs ↗pdf ↗

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 …

2019-06-25abs ↗pdf ↗

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.

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 …

2019-05-31abs ↗pdf ↗

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 kk-forms, which arises naturally in geometric fluid dynamics. In particular, we prove the existence and uniqueness of weak LpL^p-s…

2019-04-30abs ↗pdf ↗

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 C4C^4. Moreover, we only require (n…

2012-12-19abs ↗pdf ↗

Let ARdA \subset \mathbb{R}^d, d2d\ge 2, be a compact convex set and let μ=ϱ0dxμ= \varrho_0 dx be a probability measure on AA equivalent to the restriction of Lebesgue measure. Let ν=ϱ1dxν= \varrho_1 dx be a probability measure on Br:={x ⁣:xr}B_r := \{x\colon |x| \le r\} equivalent to the restriction of Lebesgue measure. We prove that t…

2008-03-10abs ↗pdf ↗

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 …

2005-06-23abs ↗pdf ↗

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 ff from independent pairs (xi,yi)(x_i, y_i) where E[yi]=f(xi),i=1,n\mathbb{E}[y_i]=f(x_i), i=1, \ldots n. While this problem is well understood both statistically and computationally, much l…

2018-06-27abs ↗pdf ↗

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…

2018-11-13abs ↗pdf ↗

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)(X, d, {\bf m}), with the metric dd and reference measure m{\bf m}. Under the assumption that optimal transport plans are given by mappings, we prove that our barycenter B(μ)B(μ) is well defined; it is a probability measur…

2017-03-28abs ↗pdf ↗

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…

2013-02-20abs ↗pdf ↗

Stability of timelike Ricci bounds in low-regularity spacetimes.

problem Stability of synthetic timelike Ricci curvature bounds under C0C^0-limits.
method Constructing smooth approximations and analyzing limiting behavior via Lorentzian optimal transport.
result Impulsive gravitational waves satisfy synthetic timelike Ricci curvature lower bounds.