Enregistré dans:
Détails bibliographiques
Auteurs principaux: Tran, Khang, Nguyen, Khoa, Nguyen, Anh, Huynh, Thong, Pham, Son, Nguyen-Dang, Sy-Hoang, Pham, Manh, Vo, Bang, Tran, Mai Ngoc, Luong, Dung
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2508.08476
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909733562089472
author Tran, Khang
Nguyen, Khoa
Nguyen, Anh
Huynh, Thong
Pham, Son
Nguyen-Dang, Sy-Hoang
Pham, Manh
Vo, Bang
Tran, Mai Ngoc
Tran, Mai Ngoc
Luong, Dung
author_facet Tran, Khang
Nguyen, Khoa
Nguyen, Anh
Huynh, Thong
Pham, Son
Nguyen-Dang, Sy-Hoang
Pham, Manh
Vo, Bang
Tran, Mai Ngoc
Tran, Mai Ngoc
Luong, Dung
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2508_08476
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Sparse Partial Optimal Transport via Quadratic Regularization
Tran, Khang
Nguyen, Khoa
Nguyen, Anh
Huynh, Thong
Pham, Son
Nguyen-Dang, Sy-Hoang
Pham, Manh
Vo, Bang
Tran, Mai Ngoc
Tran, Mai Ngoc
Luong, Dung
Machine Learning
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.
title Sparse Partial Optimal Transport via Quadratic Regularization
topic Machine Learning
url https://arxiv.org/abs/2508.08476