Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistency
Recent advances in large-scale optimal transport have greatly extended its application scenarios in machine learning. However, existing methods either not explicitly learn the transport map or do not support general cost function. In this paper, we propose an end-to-end approach for large-scale optimal transport, which directly solves the transport map and is compatible with general cost function. It models the transport map via stochastic neural networks and enforces the constraint on the marginal distributions via adversarial training. The proposed framework can be further extended towards learning Monge map or optimal bijection via adopting cycle-consistency constraint(s). We verify the effectiveness of the proposed method and demonstrate its superior performance against existing methods with large-scale real-world applications, including domain adaptation, image-to-image translation, and color transfer.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationImage-to-Image TranslationTranslationSimilar Papers 제목 키워드 기반
Noise-Guided Transport for Imitation Learning
We consider imitation learning in the low-data regime, where only a limited number of expert demonstrations are available. In this setting, methods that rely on large-scale pretraining or high-capacity architectures can …
Continuous ControlAdversarial Risk via Optimal Transport and Optimal Couplings
Modern machine learning algorithms perform poorly on adversarially manipulated data. Adversarial risk quantifies the error of classifiers in adversarial settings; adversarial classifiers minimize adversarial risk. In thi…
Binary ClassificationOTAD: An Optimal Transport-Induced Robust Model for Agnostic Adversarial Attack
Deep neural networks (DNNs) are vulnerable to small adversarial perturbations of the inputs, posing a significant challenge to their reliability and robustness. Empirical methods such as adversarial training can defend a…
Adversarial AttackAdversarial DefenseCycle monotonicity of adversarial attacks for optimal domain adaptation
We reveal an intriguing connection between adversarial attacks and cycle monotone maps, also known as optimal transport maps. Based on this finding, we developed a novel method named source fiction for semi-supervised op…
Domain AdaptationSemi-supervised Domain AdaptationAdversarial Computation of Optimal Transport Maps
Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) are powerful generative models which have …