Improving Mini-batch Optimal Transport via Partial Transportation

Mini-batch optimal transport (m-OT) has been widely used recently to deal with the memory issue of OT in large-scale applications. Despite their practicality, m-OT suffers from misspecified mappings, namely, mappings that are optimal on the mini-batch level but do not exist in the optimal transportation plan between the original measures. To address the misspecified mappings issue, we propose a novel mini-batch method by using partial optimal transport (POT) between mini-batch empirical measures, which we refer to as mini-batch partial optimal transport (m-POT). Leveraging the insight from the partial transportation, we explain the source of misspecified mappings from the m-OT and motivate why limiting the amount of transported masses among mini-batches via POT can alleviate the incorrect mappings. Finally, we carry out extensive experiments on various applications to compare m-POT with m-OT and recently proposed mini-batch method, mini-batch unbalanced optimal transport (m-UOT). We observe that m-POT is better than m-OT deep domain adaptation applications while having comparable performance with m-UOT. On other applications, such as deep generative model, gradient flow, and color transfer, m-POT yields more favorable performance than both m-OT and m-UOT.

Gradient-based learningapplied to document…Gradient-based learning applied to document recognitionOptimal Transport: Oldand NewOptimal Transport: Old and NewDeep Learning FaceAttributes in the WildDeep Learning Face Attributes in the WildDomain-AdversarialTraining of Neural…Domain-Adversarial Training of Neural NetworksWasserstein GenerativeAdversarial NetworksWasserstein Generative Adversarial NetworksVisDA: The Visual DomainAdaptation ChallengeVisDA: The Visual Domain Adaptation ChallengeWassersteinAuto-EncodersWasserstein Auto-EncodersAdversarial-Learned Lossfor Domain AdaptationAdversarial-Learned Loss for Domain AdaptationMinibatch optimaltransport distances…Minibatch optimal transport distances; analysis and applicationsWasserstein GANs WorkBecause They Fail (to…Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)On Transportation ofMini-batches: A…On Transportation of Mini-batches: A Hierarchical ApproachReading digits innatural images with…Reading digits in natural images with unsupervised feature learningKantorovich StrikesBack! Wasserstein GANs…Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?On the Convergence ofSemi-Relaxed Sinkhorn…On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance GapsImproving Mini-batchOptimal Transport via…Improving Mini-batch Optimal Transport via Partial TransportationEarlier referencesFocus paperCiting papersOlderNewer

Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.