View publication

Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. That theory has been mostly used to estimate, given a pair of source and target probability measures (μ,ν)(\mu,\nu), a parameterized map TθT_\theta that can efficiently map μ\mu onto ν\nu. In many applications, such as predicting cell responses to treatments, the data measures μ,ν\mu,\nu (features of untreated/treated cells) that define optimal transport problems do not arise in isolation but are associated with a context cc (the treatment). To account for and incorporate that context in OT estimation, we introduce CondOT, an approach to estimate OT maps conditioned on a context variable, using several pairs of measures (μi,νi)(\mu_i, \nu_i) tagged with a context label cic_i. Our goal is to learn a global map Tθ\mathcal{T}_{\theta} which is not only expected to fit all pairs in the dataset {(ci,(μi,νi))}\{(c_i, (\mu_i, \nu_i))\}, i.e., Tθ(ci)μiνi\mathcal{T}_{\theta}(c_i) \sharp\mu_i \approx \nu_i, but should generalize to produce meaningful maps Tθ(cnew)\mathcal{T}_{\theta}(c_{\text{new}}) conditioned on unseen contexts cnewc_{\text{new}}. Our approach harnesses and provides a novel usage for partially input convex neural networks, for which we introduce a robust and efficient initialization strategy inspired by Gaussian approximations. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells, using only observations of the effects of said perturbations separately.

Related readings and updates.

Progressive Entropic Optimal Transport Solvers

Optimal transport (OT) has profoundly impacted machine learning by providing theoretical and computational tools to realign datasets. In this context, given two large point clouds of sizes nnn and mmm in Rd\mathbb{R}^dRd, entropic OT (EOT) solvers have emerged as the most reliable tool to either solve the Kantorovich problem and output a n×mn\times mn×m coupling matrix, or to solve the Monge problem and learn a vector-valued push-forward map…
See paper details

The Monge Gap: A Regularizer to Learn All Transport Maps

Optimal transport (OT) theory has been been used in machine learning to study and characterize maps that can push-forward efficiently a probability measure onto another. Recent works have drawn inspiration from Brenier's theorem, which states that when the ground cost is the squared-Euclidean distance, the "best" map to morph a continuous measure in P(Rd)\mathcal{P}(\mathbb{R}^d)P(Rd) into another must be the gradient of a convex function. To…
See paper details