Differentiable Cost-Parameterized Monge Map Estimators
- URL: http://arxiv.org/abs/2406.08399v1
- Date: Wed, 12 Jun 2024 16:47:54 GMT
- Title: Differentiable Cost-Parameterized Monge Map Estimators
- Authors: Samuel Howard, George Deligiannidis, Patrick Rebeschini, James Thornton,
- Abstract summary: It is desirable to use known information to tailor cost functions and hence learn OT maps which are adapted to the problem at hand.
We construct a differentiable Monge map estimator which can be optimized to be consistent with known information about an OT map.
Our method provides a general approach for incorporating prior information about the Monge map itself when learning adapted OT maps and cost functions.
- Score: 19.015367254988448
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Within the field of optimal transport (OT), the choice of ground cost is crucial to ensuring that the optimality of a transport map corresponds to usefulness in real-world applications. It is therefore desirable to use known information to tailor cost functions and hence learn OT maps which are adapted to the problem at hand. By considering a class of neural ground costs whose Monge maps have a known form, we construct a differentiable Monge map estimator which can be optimized to be consistent with known information about an OT map. In doing so, we simultaneously learn both an OT map estimator and a corresponding adapted cost function. Through suitable choices of loss function, our method provides a general approach for incorporating prior information about the Monge map itself when learning adapted OT maps and cost functions.
Related papers
- Normalizing flows as approximations of optimal transport maps via
linear-control neural ODEs [55.2480439325792]
"Normalizing Flows" is related to the task of constructing invertible transport maps between probability measures by means of deep neural networks.
We consider the problem of recovering the $W$-optimal transport map $T$ between absolutely continuous measures $mu,nuinmathcalP(mathbbRn)$ as the flow of a linear-control neural ODE.
arXiv Detail & Related papers (2023-11-02T17:17:03Z) - Semi-supervised Learning of Pushforwards For Domain Translation &
Adaptation [3.800498098285222]
Given two probability densities on related data spaces, we seek a map pushing one density to the other.
For maps to have utility in a broad application space, the map must be available to apply on out-of-sample data points.
We introduce a novel pushforward map learning algorithm that utilizes normalizing flows to parameterize the map.
arXiv Detail & Related papers (2023-04-18T00:35:32Z) - Generalized Differentiable RANSAC [95.95627475224231]
$nabla$-RANSAC is a differentiable RANSAC that allows learning the entire randomized robust estimation pipeline.
$nabla$-RANSAC is superior to the state-of-the-art in terms of accuracy while running at a similar speed to its less accurate alternatives.
arXiv Detail & Related papers (2022-12-26T15:13:13Z) - Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision
Processes [80.89852729380425]
We propose the first computationally efficient algorithm that achieves the nearly minimax optimal regret $tilde O(dsqrtH3K)$.
Our work provides a complete answer to optimal RL with linear MDPs, and the developed algorithm and theoretical tools may be of independent interest.
arXiv Detail & Related papers (2022-12-12T18:58:59Z) - Optimal transport map estimation in general function spaces [17.323588442718926]
We study the problem of estimating a function $T$ given independent samples from a distribution $P$ and from the pushforward distribution $T_sharp P$.
This setting is motivated by applications in the sciences, where $T$ represents the evolution of a physical system over time.
We present a unified methodology for obtaining rates of estimation of optimal transport maps in general function spaces.
arXiv Detail & Related papers (2022-12-07T15:42:11Z) - Supervised Training of Conditional Monge Maps [107.78770597815242]
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.
We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable.
We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
arXiv Detail & Related papers (2022-06-28T19:34:44Z) - Neural Optimal Transport with General Cost Functionals [66.41953045707172]
We introduce a novel neural network-based algorithm to compute optimal transport plans for general cost functionals.
As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.
arXiv Detail & Related papers (2022-05-30T20:00:19Z) - Unpaired Image Super-Resolution with Optimal Transport Maps [128.1189695209663]
Real-world image super-resolution (SR) tasks often do not have paired datasets limiting the application of supervised techniques.
We propose an algorithm for unpaired SR which learns an unbiased OT map for the perceptual transport cost.
Our algorithm provides nearly state-of-the-art performance on the large-scale unpaired AIM-19 dataset.
arXiv Detail & Related papers (2022-02-02T16:21:20Z) - Scalable Computation of Monge Maps with General Costs [12.273462158073302]
Monge map refers to the optimal transport map between two probability distributions.
We present a scalable algorithm for computing the Monge map between two probability distributions.
arXiv Detail & Related papers (2021-06-07T17:23:24Z) - Neural Weighted A*: Learning Graph Costs and Heuristics with
Differentiable Anytime A* [12.117737635879037]
Recent works related to data-driven planning aim at learning either cost functions or planner functions, but not both.
We propose Neural Weighted A*, a differentiable anytime planner able to produce improved representations of planar maps as graph costs and planners.
We experimentally show the validity of our claims by testing Neural Weighted A* against several baselines, introducing a novel, tile-based navigation dataset.
arXiv Detail & Related papers (2021-05-04T13:17:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.