Streaming Sliced Optimal Transport
Khai Nguyen
Abstract
Sliced optimal transport (SOT), or sliced Wasserstein (SW) distance, is widely recognized for its statistical and computational scalability. In this work, we further enhance computational scalability by proposing the first method for estimating SW from sample streams, called streaming sliced Wasserstein (Stream-SW). To define Stream-SW, we first introduce a streaming estimator of the one-dimensional Wasserstein distance (1DW). Since the 1DW has a closed-form expression, given by the integral of the absolute difference between the quantile functions of the compared distributions, we leverage quantile approximation techniques for sample streams to define a streaming 1DW estimator. By applying the streaming 1DW to all projections, we obtain Stream-SW. The key advantage of Stream-SW is its low memory complexity while providing theoretical guarantees on the approximation error. We demonstrate that Stream-SW achieves a more accurate approximation of SW than random subsampling, with lower memory consumption, when comparing Gaussian distributions and mixtures of Gaussians from streaming samples. Additionally, we conduct experiments on point cloud classification, point cloud gradient flows, and streaming change point detection to further highlight the favorable performance of the proposed Stream-SW.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext af3b792b-b394-4412-85b4-0917cf6a0c4dBuilds on8
- Multisample Flow Matching: Straightening Flows with Minibatch CouplingsAram-Alexandre Pooladian, Heli Ben-Hamu, Carles Domingo-Enrich, Brandon Amos et al.ICML 2023 · 243 citations
- Statistical and Topological Properties of Sliced Probability DivergencesKimia Nadjahi, Alain Durmus, Lénaïc Chizat, Soheil Kolouri et al.NeurIPS 2020 · 115 citations
- Flow Matching for Generative ModelingYaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel et al.ICLR 2023 · 87 citations
- Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein DistancesSloan Nietert, Ziv Goldfeld, Ritwik Sadhu, Kengo KatoNeurIPS 2022 · 73 citations
- Online Sinkhorn: Optimal Transport distances from sample streamsArthur Mensch, Gabriel PeyréNeurIPS 2020 · 35 citations
Related papers
- Sliced Wasserstein Estimation with Control VariatesKhai Nguyen, Nhat HoICLR 2024 · 16 citations
- Sliced Optimal Partial TransportYikun Bai, Bernhard Schmitzer, Matthew Thorpe, Soheil KolouriCVPR 2023
- Energy-Based Sliced Wasserstein DistanceKhai Nguyen, Nhat HoNeurIPS 2023 · 51 citations
- Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical DataXinran Liu, Yikun Bai, Rocio Diaz Martin, Kaiwen Shi et al.ICLR 2025
- Fast Optimal Transport through Sliced Generalized Wasserstein GeodesicsGuillaume Mahey, Laetitia Chapel, Gilles Gasso, Clément Bonet et al.NeurIPS 2023 · 18 citations
