{"total":38,"rows":[{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"area":null},{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"area":null},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61,"area":null},{"id":"2107.01718","title":"Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projections","created":"2021-07-04","cited_by_count":53,"area":null},{"id":"2206.05262","title":"Meta Optimal Transport","created":"2022-06-10","cited_by_count":28,"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":"2205.12365","title":"Low-rank Optimal Transport: Approximation, Statistics and Debiasing","created":"2022-05-24","cited_by_count":21,"area":null},{"id":"2301.11302","title":"Minimax estimation of discontinuous optimal transport maps: The semi-discrete case","created":"2023-01-26","cited_by_count":20,"area":null},{"id":"2103.09267","title":"Martingale Methods for Sequential Estimation of Convex Functionals and Divergences","created":"2021-03-16","cited_by_count":18,"area":null},{"id":"2103.12711","title":"A Pseudo-Metric between Probability Distributions based on Depth-Trimmed Regions","created":"2021-03-23","cited_by_count":17,"area":null},{"id":"2107.06876","title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More","created":"2021-07-14","cited_by_count":11,"area":null},{"id":"2503.03025","title":"Hierarchical Refinement: Optimal Transport to Infinity and Beyond","created":"2025-03-04","cited_by_count":9,"area":null},{"id":"2304.06549","title":"Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach","created":"2023-04-13","cited_by_count":7,"area":null},{"id":"2305.19727","title":"Unbalanced Low-rank Optimal Transport Solvers","created":"2023-05-31","cited_by_count":7,"area":null},{"id":"2102.12731","title":"Improving Approximate Optimal Transport Distances using Quantization","created":"2021-02-25","cited_by_count":5,"area":null},{"id":"2307.01770","title":"Fast Optimal Transport through Sliced Wasserstein Generalized Geodesics","created":"2023-07-04","cited_by_count":5,"area":null},{"id":"2110.07275","title":"Order Constraints in Optimal Transport","created":"2021-10-14","cited_by_count":4,"area":null},{"id":"2111.06546","title":"Approximating Optimal Transport via Low-rank and Sparse Factorization","created":"2021-11-12","cited_by_count":4,"area":null},{"id":"2112.04398","title":"Matching for causal effects via multimarginal unbalanced optimal transport","created":"2021-12-08","cited_by_count":4,"area":null},{"id":"2207.14727","title":"Tangential Wasserstein Projections","created":"2022-07-29","cited_by_count":4,"area":null},{"id":"2310.11256","title":"Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space","created":"2023-10-17","cited_by_count":4,"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":"2110.00629","title":"Factored couplings in multi-marginal optimal transport via difference of convex programming","created":"2021-10-01","cited_by_count":2,"area":null},{"id":"2502.07510","title":"Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalization","created":"2025-02-11","cited_by_count":2,"area":null},{"id":"2503.11249","title":"Spherical Tree-Sliced Wasserstein Distance","created":"2025-03-14","cited_by_count":2,"area":null},{"id":"2210.13630","title":"Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport","created":"2022-10-24","cited_by_count":1,"area":null},{"id":"2406.01130","title":"SAVA: Scalable Learning-Agnostic Data Valuation","created":"2024-06-03","cited_by_count":1,"area":null},{"id":"2410.13061","title":"Optimal Transport for Probabilistic Circuits","created":"2024-10-16","cited_by_count":1,"area":null},{"id":"2505.09131","title":"Fair Clustering via Alignment","created":"2025-05-14","cited_by_count":1,"area":null},{"id":"2506.19025","title":"Statistical Inference for Optimal Transport Maps: Recent Advances and Perspectives","created":"2025-06-23","cited_by_count":1,"area":null},{"id":"2606.12120","title":"A Riemannian Approach to Low-Rank Optimal Transport","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2111.04838","title":"Efficient estimates of optimal transport via low-dimensional embeddings","created":"2021-11-08","cited_by_count":0,"area":null},{"id":"2510.11910","title":"Simplifying Optimal Transport through Schatten-$p$ Regularization","created":"2025-10-13","cited_by_count":0,"area":null},{"id":"2603.03578","title":"Transport Clustering: Solving Low-Rank Optimal Transport via Clustering","created":"2026-03-03","cited_by_count":0,"area":null},{"id":"2605.27619","title":"Supervised Distributional Reduction via Optimal Transport and Dependence Maximization","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2607.16178","title":"Cluster-Aware Matching via Laplacian Optimal Transport","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2608.08642","title":"Exact Rank-Space KL Projection for Shared-Marginal Low-Rank Factors: Application to Doubly Stochastic Clustering","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2608.28262","title":"SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport","created":"2026-08-28","cited_by_count":0,"area":null}],"next_cursor":null}