arXiv:2501. 18143v2 Announce Type: replace Abstract: Min cut is an important graph partitioning method.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
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:2512.05926v2 Announce Type: replace Abstract: We consider the fundamental problem of balanced $k$-means clustering. In particular, we introduce an optimal transport approach to alternating mini...
arXiv:2608.27500v3 Announce Type: replace-cross Abstract: Network comparison using optimal transport is a growing area of research in network science. Unlike standard graph metrics, optimal transport...
arXiv:2609.40075v1 Announce Type: new Abstract: Partial Optimal Transport (POT) extends the classical optimal transport problem by relaxing the strict mass conservation constraint, enabling its use i...
arXiv:2608. 16101v1 Announce Type: cross Abstract: Coresets distill large datasets into small, representative subsets for efficient downstream learning.
arXiv:2609.40156v1 Announce Type: cross Abstract: In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In...