AIIC AI Intelligence Centre

SOURCE-LINKED INTELLIGENCE

Accelerated Algorithm for Sparse Regularized Partial Optimal Transport

arXiv · AI, language, vision and robotics · article · Sep 30, 2026 · UTC

Partial Optimal Transport (POT) extends the classical optimal transport problem by relaxing the strict mass conservation constraint, enabling its use in a wide range of real-world applications. In many of these settings, sparse transport plans are preferred for their interpretability and computational benefits. While smooth and strongly convex regularizers - such as quadratic or elastic net - have been vastly used in various machine learning applications to induce sparsity and accelerate computation, they have received less algorithmic attention compared to entropic approaches for computationa

Read original source ↗ Open in workspace

recordType
paper
region
Global

Evidence & attribution

First collected: 2026-10-01T15:32:10.694Z. This is not the publication date.