@article {10.3844/jcssp.2025.1677.1687,
article_type = {journal},
title = {Sparse Partial Optimal Transport via Quadratic Regularization},
author = {Tran, Khang and Nguyen, Khoa and Nguyen, Anh and Huynh, Thong and Pham, Son and Nguyen-Dang, Sy-Hoang and Pham, Manh and Vo, Bang and Tran, Mai Ngoc and Luong, Dung},
volume = {21},
number = {7},
year = {2025},
month = {Jul},
pages = {1677-1687},
doi = {10.3844/jcssp.2025.1677.1687},
url = {https://thescipub.com/abstract/jcssp.2025.1677.1687},
abstract = {Partial Optimal Transport (POT) has recently emerged as a central tool in various Machine Learning (ML) applications. It lifts the stringent assumption of the conventional Optimal Transport (OT) that input measures are of equal masses, which is often not guaranteed in real-world datasets, and thus offers greater flexibility by permitting transport between unbalanced input measures. Nevertheless, existing major solvers for POT commonly rely on entropic regularization for acceleration and thus return dense transport plans, hindering the adoption of POT in various applications that favor sparsity. In this paper, as an alternative approach to the entropic POT formulation in the literature, we propose a novel formulation of POT with quadratic regularization, hence termed quadratic regularized POT (QPOT), which induces sparsity to the transport plan and consequently facilitates the adoption of POT in many applications with sparsity requirements. Extensive experiments on synthetic and CIFAR-10 datasets, as well as real-world applications such as color transfer and domain adaptations, consistently demonstrate the improved sparsity and favorable performance of our proposed QPOT formulation.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}