Take It or Leave It: Intent-Controlled Partial Optimal Transport
Not on the map. Why?
Abstract (arXiv)
While optimal transport (OT) enforces a rigid constraint by requiring two measures to be matched exactly, partial optimal transport relaxes this requirement by allowing mass to remain unmatched through a global budget, scalar rebate, or uniform rejection rule. However, many applications call for more structured, pointwise rejection mechanisms, where the decision to leave mass unmatched depends on side-specific reliability, support geometry, or external information about which components should participate in the comparison. We introduce intent-controlled partial optimal transport (IC-POT), a targeted generalization of partial transport that replaces the global rejection paradigm with pointwise rejection costs over both measures. We show that the resulting optimization problem admits a dual interpretation in terms of local acceptance thresholds and can be solved by recasting it as a balanced Kantorovich OT problem on an augmented support. Beyond theoretical analysis, we demonstrate the practical relevance of IC-POT in settings where rejection is driven by side information. In positive-unlabeled learning and open-partial domain adaptation, incorporating pointwise rejection rules that encode statistical structure improves fixed baseline pipelines. Finally, we motivate the use of IC-POT with a geophysical practical case: multi-modal satellite ocean measurements, for which physical and sensors priors naturally inform the rejection mechanism and define the retrieved comparable signal information.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 19 May 2026.
Builds on
17 of 34 references.
References · 17
- 2018Computational Optimal Transportcited by 765
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 403
- 2020Universal Domain Adaptation through Self Supervisioncited by 172
- 2019Style Transfer by Relaxed Optimal Transport and Self-Similaritycited by 167
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2021OVANet: One-vs-All Network for Universal Domain Adaptationcited by 92
- 2017Smooth and Sparse Optimal Transportcited by 83
- 2022Unified Optimal Transport Framework for Universal Domain Adaptationcited by 57
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 40
- 2022Sparsity-Constrained Optimal Transportcited by 32
5 more
- 2024P2OT: Progressive Partial Optimal Transport for Deep Imbalanced Clusteringcited by 13
- 2023Universal Domain Adaptation from Foundation Models: A Baseline Studycited by 10
- 2022Block-coordinate Frank-Wolfe algorithm and convergence analysis for semi-relaxed optimal transport problemcited by 5
- 2013Insights into capacity constrained optimal transportcited by 3
- 2025Training-Free Label Space Alignment for Universal Domain Adaptationcited by 1
Built on by
Not cited yet.