mlsanityData to 14 Oct 2026

Field Codes for Distributed Coupling Samplers and Certified Empirical Transport

arXiv 2607.27078 ↗First posted 29 Jul 2026cs.CC cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we formulate three communication tasks for empirical optimal transport: distributed coupling sampling, cost-evaluable coupling output, and scalar value-certified sampling. Our main result is a field-code compiler: any communicated transport field approximating an optimal empirical Monge map to error η can be completed by sparse target-cell residuals into an exact-marginal value-certified sampler with scalar certificate W1(μ,nu)≤ U≤ W1(μ,nu)+2Delta, where Delta is the public target-partition diameter. The certificate accuracy is controlled by Delta alone. The field error η controls residual communication under a cell-margin condition; without a margin, η alone does not bound residuals. We instantiate the compiler via adaptive local-affine and tensor-product spline codes with d(m+1)db field bits in the spline case, plus residual lists charged separately. For lower bounds, exact Gap-Hamming embeddings prove certified output is hard, including a smooth cell-packing diffeomorphism family requiring Omega(varepsilon-2d/(d+4)) communication for any cost-evaluable, cost-certified, or value-certified protocol. The same gadgets admit zero-communication samplers, formally separating the sampler and certificate-bearing output models. These results identify the transport field as the right communicated object whenever a field code is available, primarily as a residual-sparsity tool.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 29 Jul 2026.

Builds on

22 of 33 references.

References · 22

  1. 2022Flow Matching for Generative Modelingcited by 5,702
  2. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  4. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  5. 2018Computational Optimal Transportcited by 780
  6. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
  7. 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 83
  8. 2025Variational Rectified Flow Matchingcited by 35
  9. 2020On Projection Robust Optimal Transport: Sample Complexity and Model Misspecificationcited by 34
  10. 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
  11. 2018Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenterscited by 21
  12. 2016DOTmark - A Benchmark for Discrete Optimal Transportcited by 16
10 more
  1. 2023Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Mapscited by 16
  2. 2024Sliced Wasserstein with Random-Path Projecting Directionscited by 15
  3. 2017Parallel Streaming Wasserstein Barycenterscited by 14
  4. 2022VQ-Flows: Vector Quantized Local Normalizing Flowscited by 10
  5. 2018Distributed Computation of Wasserstein Barycenters over Networkscited by 5
  6. 2021New Streaming Algorithms for High Dimensional EMD and MSTcited by 5
  7. 2020Distributed Wasserstein Barycenters via Displacement Interpolationcited by 3
  8. 2017Communication complexity of approximate maximum matching in the message-passing modelcited by 1
  9. 2018Distributed Online Optimization for Multi-Agent Optimal Transportcited by 1
  10. 2025Federated Sinkhorncited by 1

Built on by

Not cited yet.