A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings

Nathaniel Lahn, S. Raghvendra, Kaiyi Zhang
2/12/2026

No official code found. Best implementation: kaiyiz/Combinatorial-Parallel-OT (4 stars, last commit 2023-11-29).

DOISemantic Scholar

Code Implementations(1)

kaiyiz/Combinatorial-Parallel-OTCommunity56%

The implementation of A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings for the paper: https://neurips.cc/virtual/2023/poster/72932

41PythonOct 12, 20232 years ago

Similar Papers

MCNet: Rethinking the Core Ingredients for Accurate and Efficient Homography Estimation

95% match1 repo362026

Interpretable Causal Representation Learning for Biological Data in the Pathway Space

94% match2026

COCO-Periph: Bridging the Gap Between Human and Machine Perception in the Periphery

91% match1 repo32026

The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimes

91% match2026

Discrete Continuous Optimization Framework for Simultaneous Clustering and Training in Mixture Models

89% match2026

SemTrack: A Large-Scale Dataset for Semantic Tracking in the Wild

89% match1 repo72026

Cite this paper

@article{lahn2026combinatorial,
  title  = {A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings},
  author = {Nathaniel Lahn and S. Raghvendra and Kaiyi Zhang},
  year   = {2026},
  doi    = {10.52202/075280-0948},
  url    = {https://doi.org/10.52202/075280-0948},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/67c6589989534a9413d6f347404defe4eed3fea6.svg)](https://codeofpaper.com/paper/67c6589989534a9413d6f347404defe4eed3fea6)

Discussion