paper-with-me

Papers

Sparse Partial Optimal Transport via Quadratic Regularization

2025-08-11 · Khang Tran, Khoa Nguyen, Anh Nguyen, Thong Huynh, Son Pham, Sy-Hoang Nguyen-Dang, Manh Pham, Bang Vo, Mai Ngoc Tran, Mai Ngoc Tran, Dung Luong arxiv

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.

📄 PDF Abstract BibTeX arXiv:2508.08476

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sparsity-Constrained Optimal Transport

2022-09-30 · Tianlin Liu, Joan Puigcerver, Mathieu Blondel

Regularized optimal transport (OT) is now increasingly used as a loss or as a matching layer in neural networks. Entropy-regularized OT can be computed using the Sinkhorn algorithm but it leads to fully-dense transportat…

Mixture-of-Experts

Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis

2026-05-23 · Long Nguyen-Chi, Nam Nguyen, Binh Nguyen arxiv

Quadratic regularization has emerged as a potential alternative to the popular entropic regularization in computational optimal transport, offering the theoretical advantage of producing sparse couplings through its hing…

A Sinkhorn-Newton method for entropic optimal transport

2017-10-18 · Christoph Brauer, Christian Clason, Dirk Lorenz, Benedikt Wirth

We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically th…

Wasserstein-2 Generative Networks

2019-09-28 · ICLR 2021 1 · Alexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin 외

We propose a novel end-to-end non-minimax algorithm for training optimal transport mappings for the quadratic cost (Wasserstein-2 distance). The algorithm uses input convex neural networks and a cycle-consistency regular…

Domain AdaptationStyle Transfer

Sparse Domain Transfer via Elastic Net Regularization

2024-05-13 · Jingwei Zhang, Farzan Farnia

Transportation of samples across different domains is a central task in several machine learning problems. A sensible requirement for domain transfer tasks in computer vision and language domains is the sparsity of the t…

feature selection