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

1122 · Sep 201019922001200920172026
48 results for mass-transport

We use mass-transportation as a tool to compare surfaces (2-manifolds). In particular, we determine the "similarity" of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation problem differs from the standard case in that we require the solution to be inv…

2009-12-17abs ↗pdf ↗

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

In this paper we investigate model-independent bounds for exotic options written on a risky asset. Based on arguments from the theory of Monge-Kantorovich mass-transport we establish a dual version of the problem that has a natural financial interpretation in terms of semi-static hedging. In particular we prove that th…

2011-06-29abs ↗pdf ↗

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 ↗

We present a constructive approach to surface comparison realizable by a polynomial-time algorithm. We determine the "similarity" of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation problem differs from the standard case in that we require the solut…

2011-03-22abs ↗pdf ↗

Sharp inequalities in nonnegative Ricci curvature spaces using mass transport.

problem Proving sharp isoperimetric and Sobolev inequalities in nonnegative Ricci curvature spaces.
method Optimal mass transport theory, symmetrization techniques, and volume non-collapsing properties.
result Sharp isoperimetric and Sobolev inequalities established in Riemannian manifolds with nonnegative Ricci curvature.

Solves probabilistic Lambert problem connecting astrodynamics with optimal mass transport.

problem Determining spacecraft velocity for given positions with probabilistic constraints.
method Generalized optimal mass transport (OMT) and Schrödinger bridge (SBP) connections.
result Existence and uniqueness of solution for probabilistic Lambert problem.

Generative Adversarial Networks have been shown to be powerful in generating content. To this end, they have been studied intensively in the last few years. Nonetheless, training these networks requires solving a saddle point problem that is difficult to solve and slowly converging. Motivated from techniques in the reg…

2019-10-03abs ↗pdf ↗

Through the main example of the Ornstein-Uhlenbeck semigroup, the Bakry-Emery criterion is presented as a main tool to get functional inequalities as Poincaré or logarithmic Sobolev inequalities. Moreover an alternative method using the optimal mass transportation, is also given to obtain the logarithmic Sobolev inequa…

2010-09-17abs ↗pdf ↗

Sharp Sobolev inequalities proved on manifolds with non-negative Ricci curvature.

problem Proving sharp Sobolev inequalities on noncompact Riemannian manifolds with non-negative Ricci curvature.
method Using Optimal Mass Transportation with quadratic distance cost.
result Sharp LpL^p-Sobolev and LpL^p-logarithmic Sobolev inequalities established for p>1p>1 and p=1p=1.

The paper explores infinite-dimensional nonholonomic and vakonomic systems.

problem Understanding dynamics of infinite-dimensional systems with constraints.
method Visualizing and revisiting classical and new examples of nonholonomic and vakonomic systems.
result Infinite-dimensional systems exhibit both nonholonomic and vakonomic dynamics.

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 aim of this paper is to prove isoperimetric inequalities on submanifolds of the Euclidean space using mass transportation methods. We obtain a sharp ?weighted isoperimetric inequality? and a nonsharp classical inequality similar to the one obtained by J. Michael and L. Simon. The proof relies on the description of …

2009-08-19abs ↗pdf ↗

Sharp LpL^p-logarithmic-Sobolev inequalities on submanifolds with applications to hypercontractivity.

problem Developing inequalities on submanifolds of Euclidean space.
method Optimal mass transport theory on submanifolds, sharpness analysis.
result Sharp inequalities and equality conditions for submanifolds.

Whereas most dimensionality reduction techniques (e.g. PCA, ICA, NMF) for multivariate data essentially rely on linear algebra to a certain extent, summarizing ranking data, viewed as realizations of a random permutation ΣΣ on a set of items indexed by i{1,,  n}i\in \{1,\ldots,\; n\}, is a great statistical challenge, due to…

2018-10-15abs ↗pdf ↗

The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex function…

2014-08-11abs ↗pdf ↗

We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the space of probability densities and right-invariant metrics on the infinite-dimension…

2015-01-29abs ↗pdf ↗

Efficient federated algorithm for calculating transportation barycenter.

problem Efficiently calculating the free-support transportation barycenter in a federated setting.
method Single-loop dual decomposition algorithm that uses only aggregated information.
result Significantly scalable and low-complexity algorithm for federated computation.

We prove the following nonholonomic version of the classical Moser theorem: given a bracket-generating distribution on a connected compact manifold (possibly with boundary), two volume forms of equal total volume can be isotoped by the flow of a vector field tangent to this distribution. We describe formal solutions of…

2008-02-12abs ↗pdf ↗

Paper proposes a new approach to optimal transport for vector and matrix densities.

problem Optimal transport for vector and matrix densities with positivity and action transitivity constraints.
method Gauge-theoretic approach using semi-direct product groups of diffeomorphisms and gauge transformations.
result Bures-type metrics on semi-direct product groups relate to Wasserstein-type metrics on vector and matrix densities via Riemannian submersions.

The mirror descent algorithm (MDA) generalizes gradient descent by using a Bregman divergence to replace squared Euclidean distance. In this paper, we similarly generalize the alternating direction method of multipliers (ADMM) to Bregman ADMM (BADMM), which allows the choice of different Bregman divergences to exploit …

2013-06-13abs ↗pdf ↗

Given an initial (resp., terminal) probability measure μμ (resp., νν) on Rd\mathbb{R}^d, we characterize those optimal stopping times ττ that maximize or minimize the functional EB0Bτα\mathbb{E} |B_0 - B_τ|^α, α>0α> 0, where (Bt)t(B_t)_t is Brownian motion with initial law B0μB_0\sim μ and with final distribution --once stop…

2017-11-08abs ↗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 ↗

Study mass transport in low-diffusivity using Lagrangian coordinates.

problem Mass preserving transport of passive tracers in low-diffusivity limit.
method Lagrangian coordinates, time-averaged diffusion equation, weighted manifold structure.
result Leading order asymptotics extend to dominant nontrivial singular value in low-diffusivity limit.

We study the inverse optimal control problem in social sciences: we aim at learning a user's true cost function from the observed temporal behavior. In contrast to traditional phenomenological works that aim to learn a generative model to fit the behavioral data, we propose a novel variational principle and treat user …

2018-05-22abs ↗pdf ↗

Neural networks with a large number of parameters admit a mean-field description, which has recently served as a theoretical explanation for the favorable training properties of "overparameterized" models. In this regime, gradient descent obeys a deterministic partial differential equation (PDE) that converges to a glo…

2019-02-05abs ↗pdf ↗

Given a real-valued function cc defined on the cartesian product of a generic Carnot group $\G$ and the first layer V1V_1 of its Lie algebra, we introduce a notion of cc horizontal convex (cc H-convex) function on $\G$ as the supremum of a suitable family of affine functions; this family is defined pointwisely, and …

2010-05-06abs ↗pdf ↗

The goal of regression and classification methods in supervised learning is to minimize the empirical risk, that is, the expectation of some loss function quantifying the prediction error under the empirical distribution. When facing scarce training data, overfitting is typically mitigated by adding regularization term…

2017-10-27abs ↗pdf ↗

Deep learning is the mainstream technique for many machine learning tasks, including image recognition, machine translation, speech recognition, and so on. It has outperformed conventional methods in various fields and achieved great successes. Unfortunately, the understanding on how it works remains unclear. It has th…

2018-05-26abs ↗pdf ↗