{"total":40,"rows":[{"id":"2109.12004","title":"Entropic estimation of optimal transport maps","created":"2021-09-24","cited_by_count":90,"area":null},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"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":"2102.07850","title":"Differentiable Particle Filtering via Entropy-Regularized Optimal Transport","created":"2021-02-15","cited_by_count":59,"area":null},{"id":"2106.02968","title":"Low Budget Active Learning via Wasserstein Distance: An Integer Programming Approach","created":"2021-06-05","cited_by_count":34,"area":null},{"id":"2102.06857","title":"On Robust Optimal Transport: Computational Complexity and Barycenter Computation","created":"2021-02-13","cited_by_count":27,"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":"2106.16116","title":"PSD Representations for Effective Probability Models","created":"2021-06-30","cited_by_count":23,"area":null},{"id":"2204.06645","title":"Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning","created":"2022-04-13","cited_by_count":15,"area":null},{"id":"2206.07630","title":"Rethinking Initialization of the Sinkhorn Algorithm","created":"2022-06-15","cited_by_count":14,"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":"2401.12253","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","created":"2024-01-20","cited_by_count":11,"area":null},{"id":"2205.15059","title":"Hilbert Curve Projection Distance for Distribution Comparison","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2502.12063","title":"Low-Rank Thinning","created":"2025-02-17","cited_by_count":7,"area":null},{"id":"2107.14324","title":"Deep Networks Provably Classify Data on Curves","created":"2021-07-29","cited_by_count":6,"area":null},{"id":"2304.00199","title":"Applications of No-Collision Transportation Maps in Manifold Learning","created":"2023-04-01","cited_by_count":6,"area":null},{"id":"2306.06581","title":"Importance Sparsification for Sinkhorn Algorithm","created":"2023-06-11","cited_by_count":6,"area":null},{"id":"2602.10056","title":"WildCat: Near-Linear Attention in Theory and Practice","created":"2026-02-10","cited_by_count":6,"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":"2106.02755","title":"Kernel approximation on algebraic varieties","created":"2021-06-04","cited_by_count":4,"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":"2111.11550","title":"Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR","created":"2021-11-22","cited_by_count":4,"area":null},{"id":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-21","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":"2210.12135","title":"Geometric Sparse Coding in Wasserstein Space","created":"2022-10-21","cited_by_count":3,"area":null},{"id":"2403.05054","title":"A Sinkhorn-type Algorithm for Constrained Optimal Transport","created":"2024-03-08","cited_by_count":3,"area":null},{"id":"2503.22923","title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization","created":"2025-03-29","cited_by_count":3,"area":null},{"id":"2301.13006","title":"Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods","created":"2023-01-30","cited_by_count":2,"area":null},{"id":"2406.12366","title":"Structured Prediction in Online Learning","created":"2024-06-18","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":"2309.04428","title":"Soft Quantization using Entropic Regularization","created":"2023-09-08","cited_by_count":1,"area":null},{"id":"2310.05019","title":"Compressed online Sinkhorn","created":"2023-10-08","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":"2503.15105","title":"Control, Optimal Transport and Neural Differential Equations in Supervised Learning","created":"2025-03-19","cited_by_count":1,"area":null},{"id":"2506.14780","title":"Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes","created":"2025-05-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":"2307.00247","title":"Safe Screening for Unbalanced Optimal Transport","created":"2023-07-01","cited_by_count":0,"area":null},{"id":"2311.13147","title":"Optimal Transport with Cyclic Symmetry","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2610.02395","title":"FlashSinkhorn 2: Block-Sparse Entropic Optimal Transport","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}