In this paper, we describe a novel iterative procedure called SISTA to learn the underlying cost in optimal transport problems. SISTA is a hybrid between two classical methods, coordinate descent ("S"-inkhorn) and proximal gradient descent ("ISTA"). It alternates between a phase of exact...

In this paper, we describe a novel iterative procedure called SISTA to learn the underlying cost in optimal transport problems. SISTA is a hybrid between two classical methods, coordinate descent ("S"-inkhorn) and proximal gradient descent ("ISTA"). It alternates between a phase of exact...

In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high dimensional optimal transport problems. Classical optimal transport theory species the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse...

In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high dimensional optimal transport problems. Classical optimal transport theory species the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse...

In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high dimensional optimal transport problems. Classical optimal transport theory specifies the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse...

In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high dimensional optimal transport problems. Classical optimal transport theory species the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse...

A simple procedure to map two probability measures in Rd is the so-called Knothe-Rosenblatt rearrangement, which consists in rearranging monotonically the marginal distributions of the last coordinate, and then the conditional distributions, iteratively. We show that this mapping is the limit of...

We consider an evolution equation similar to that introduced by Vese in [10] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the...

This paper studies efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson (1994), that efficiency is characterized by a comonotonicity condition. The goal of the paper is to...

This paper studies efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson (1994) [27], that efficiency is characterized by a comonotonicity condition. The goal of the paper is to...