arXiv Machine Learning
Accelerated Algorithm for Sparse Regularized Partial Optimal Transport
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 31
SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport
arXiv:2608. 28262v1 Announce Type: new Abstract: Entropic optimal transport (EOT) has been shown to offer a computationally tractable approximation to exact optimal transport.
arXiv Machine Learning
Jun 8
Implicit Neural Optimal Transport via Fixed-Point Optimization
arXiv:2605. 10792v2 Announce Type: replace-cross Abstract: We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches.
arXiv Machine Learning
Aug 28
COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks
The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.
arXiv Machine Learning
1d ago
Low-Budget Active Learning through Entropic Optimal Transport
The paper introduces a low-budget active learning approach that selects a small coreset of data points for training high-accuracy models, particularly useful when labeling is expensive, such as in medical contexts. It uses features from a pretrained self-supervised model and applies entropic optimal transport—specifically the Sinkhorn divergence—as the selection criterion, enabling dimension-free sample complexity and efficient gradient-based optimization. The method combines gradient-based candidate generation with a swap-based local search, achieving superior performance over existing heuristics on image and medical datasets.
arXiv Machine Learning
Jun 4
Optimal Transport Flow Matching by Design
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
arXiv AI
Aug 5
One Knob to Rule Them All: A Unified Optimal Transport View of Cold-Start Active Learning
arXiv:2608. 03249v1 Announce Type: new Abstract: Cold-Start Active Learning (CSAL) aims to select a valuable subset from an unlabeled pool without any prior knowledge or human assistance.