2000 character limit reached
Data Driven Conditional Optimal Transport
Published 24 Oct 2019 in math.OC | (1910.11422v1)
Abstract: A data driven procedure is developed to compute the optimal map between two conditional probabilities $\rho(x|z_{1},...,z_{L})$ and $\mu(y|z_{1},...,z_{L})$ depending on a set of covariates $z_{i}$. The procedure is tested on synthetic data from the ACIC Data Analysis Challenge 2017 and it is applied to non uniform lightness transfer between images. Exactly solvable examples and simulations are performed to highlight the differences with ordinary optimal transport.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.