{"total":15,"rows":[{"id":"2106.01954","title":"Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark","created":"2021-06-03","cited_by_count":96,"area":null},{"id":"2305.05080","title":"Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey","created":"2023-05-08","cited_by_count":27,"area":null},{"id":"2307.08507","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","created":"2023-07-17","cited_by_count":7,"area":null},{"id":"2203.00813","title":"An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenters","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2504.02067","title":"A Truncated Newton Method for Optimal Transport","created":"2025-04-02","cited_by_count":6,"area":null},{"id":"2102.12731","title":"Improving Approximate Optimal Transport Distances using Quantization","created":"2021-02-25","cited_by_count":5,"area":null},{"id":"2502.03749","title":"PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport","created":"2025-02-06","cited_by_count":5,"area":null},{"id":"2210.16645","title":"Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm","created":"2022-10-29","cited_by_count":3,"area":null},{"id":"2401.07378","title":"Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Search","created":"2024-01-14","cited_by_count":3,"area":null},{"id":"2308.01039","title":"Computing the Distance between unbalanced Distributions -- The flat Metric","created":"2023-08-02","cited_by_count":1,"area":null},{"id":"2506.00976","title":"Quantization-based Bounds on the Wasserstein Metric","created":"2025-06-01","cited_by_count":0,"area":null},{"id":"2510.01015","title":"Quantifying the noise sensitivity of the Wasserstein metric for images","created":"2025-10-01","cited_by_count":0,"area":null},{"id":"2607.27078","title":"Field Codes for Distributed Coupling Samplers and Certified Empirical Transport","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2609.33814","title":"Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memory","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2610.04715","title":"GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}