Related papers: Weak optimal transport with unnormalized kernels
Distributionally robust optimization has been shown to offer a principled way to regularize learning models. In this paper, we find that Tikhonov regularization is distributionally robust in an optimal transport sense (i.e., if an adversary…
This paper investigates causal optimal transportation problems, in the framework of two Polish spaces, both endowed with filtrations. Specific concretizations yield primal problems equivalent to several classical problems of stochastic…
We study an optimal transport problem in a compact convex set $\Omega\subset\mathbb{R}^d$ where bulk transport is coupled to dynamic optimal transport on a metric graph $ \mathsf{G} = (\mathsf{V},\mathsf{E})$ which is embedded in $\Omega$.…
We adapt the problem of continuous congested optimal transport to the Heisenberg group, equipped with a sub-Riemannian metric. Originally introduced in the Euclidean setting by Carlier, Jimenez, and Santambrogio as a path-dependent variant…
In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
We introduce and study a multi-marginal optimal partial transport problem. Under a natural and sharp condition on the dominating marginals, we establish uniqueness of the optimal plan. Our strategy of proof establishes and exploits a…
We introduce a new class of convex-regularized Optimal Transport losses, which generalizes the classical Entropy-regularization of Optimal Transport and Sinkhorn divergences, and propose a generalized Sinkhorn algorithm. Our framework…
Many unicellular organisms allocate their key proteins asymmetrically between the mother and daughter cells, especially in a stressed environment. A recent theoretical model is able to predict when the asymmetry in segregation of key…
This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean $\ell_2$-norm. It offers theoretical guarantees regarding the iteration complexities of the Sinkhorn--Knopp algorithm, Accelerated Gradient…
Optimal mass transport is described by an approximation of transport cost via semi-discrete costs. The notions of optimal partition and optimal strong partition are given as well. We also suggest an algorithm for computation of Optimal…
We give natural topological conditions on the support of the target measure under which solutions to the optimal transport problem with cost function satisfying the (weak) Ma, Trudinger, and Wang condition cannot have any isolated singular…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
In recent years, two prominent paradigms have shaped distributionally robust optimization (DRO), modeling distributional ambiguity through $\phi$-divergences and Wasserstein distances, respectively. While the former focuses on ambiguity in…
We introduce and prove convergence of a damped Newton algorithm to approximate solutions of the semi-discrete optimal transport problem with storage fees, corresponding to a problem with hard capacity constraints. This is a variant of the…
We study the equivalence between the weighted least gradient problem and the weighted Beckmann minimal flow problem or equivalently, the optimal transport problem with Riemannian cost. Thanks to this equivalence, we prove existence and…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
We propose a new approach to graph compression by appeal to optimal transport. The transport problem is seeded with prior information about node importance, attributes, and edges in the graph. The transport formulation can be setup for…
We simplify the geometric interpretation of the weak Ma-Trudinger-Wang condition for regularity in optimal transportation and provide a geometric proof of the global c-convexity of locally $c$-convex potentials when the cost function $c$ is…
Excitonic transport in static disordered one dimensional systems is studied in the presence of thermal fluctuations that are described by the Haken-Strobl-Reineker model. For short times, non-diffusive behavior is observed that can be…