On making optimal transport robust to all outliers
Not on the map. Why?
Abstract (arXiv)
Optimal transport (OT) is known to be sensitive against outliers because of its marginal constraints. Outlier robust OT variants have been proposed based on the definition that outliers are samples which are expensive to move. In this paper, we show that this definition is restricted by considering the case where outliers are closer to the target measure than clean samples. We show that outlier robust OT fully transports these outliers leading to poor performances in practice. To tackle these outliers, we propose to detect them by relying on a classifier trained with adversarial training to classify source and target samples. A sample is then considered as an outlier if the prediction from the classifier is different from its assigned label. To decrease the influence of these outliers in the transport problem, we propose to either remove them from the problem or to increase the cost of moving them by using the classifier prediction. We show that we successfully detect these outliers and that they do not influence the transport problem on several experiments such as gradient flows, generative models and label propagation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 35 of its 66 references that are in the map. First posted on arXiv 23 Jun 2022.
Builds on
35 of 66 references.
References · 35
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2022Generative Adversarial Networkscited by 5,627
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
23 more
- 2018Computational Optimal Transportcited by 780
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2017Learning Generative Models with Sinkhorn Divergencescited by 314
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 254
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
- 2015Learning with a Wasserstein Losscited by 196
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 87
- 2017Toward Robustness against Label Noise in Training Deep Discriminative Neural Networkscited by 78
- 2018Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusionscited by 77
- 2021Minibatch optimal transport distances; analysis and applicationscited by 65
- 2020On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithmcited by 61
- 2021Unbalanced Optimal Transport through Non-negative Penalized Linear Regressioncited by 31
- 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
- 2020When OT meets MoM: Robust estimation of Wasserstein Distancecited by 23
- 2019Wasserstein Adversarial Regularization (WAR) on label noisecited by 16
- 2013On properties of the Generalized Wasserstein distancecited by 11
- 2020High-dimensional outlier detection using random projectionscited by 3
Built on by
Not cited yet.