{"total":31,"rows":[{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"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":"2312.06221","title":"CSOT: Curriculum and Structure-Aware Optimal Transport for Learning with Noisy Labels","created":"2023-12-11","cited_by_count":17,"area":null},{"id":"2111.06888","title":"Learning Generalized Gumbel-max Causal Mechanisms","created":"2021-11-11","cited_by_count":16,"area":null},{"id":"2103.06263","title":"Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution","created":"2021-03-10","cited_by_count":13,"area":null},{"id":"2401.12253","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","created":"2024-01-20","cited_by_count":11,"area":null},{"id":"2105.14403","title":"Re-evaluating Word Mover's Distance","created":"2021-05-30","cited_by_count":10,"area":null},{"id":"2112.02073","title":"Hierarchical Optimal Transport for Unsupervised Domain Adaptation","created":"2021-12-03","cited_by_count":10,"area":null},{"id":"2210.03164","title":"InfoOT: Information Maximizing Optimal Transport","created":"2022-10-06","cited_by_count":9,"area":null},{"id":"2310.13653","title":"Optimal Transport for Measures with Noisy Tree Metric","created":"2023-10-20","cited_by_count":7,"area":null},{"id":"2406.13725","title":"Tree-Sliced Wasserstein Distance: A Geometric Perspective","created":"2024-06-19","cited_by_count":7,"area":null},{"id":"2211.10420","title":"Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes","created":"2022-11-18","cited_by_count":6,"area":null},{"id":"2306.04116","title":"Unbalanced Optimal Transport for Unbalanced Word Alignment","created":"2023-06-07","cited_by_count":6,"area":null},{"id":"2406.04914","title":"Submodular Framework for Structured-Sparse Optimal Transport","created":"2024-06-07","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":"2503.11050","title":"Distance-Based Tree-Sliced Wasserstein Distance","created":"2025-03-14","cited_by_count":4,"area":null},{"id":"2211.06229","title":"Improving word mover's distance by leveraging self-attention matrix","created":"2022-11-11","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":"2604.03782","title":"An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent","created":"2026-04-04","cited_by_count":3,"area":null},{"id":"2306.08233","title":"OT-Net: A Reusable Neural Optimal Transport Solver","created":"2023-06-14","cited_by_count":2,"area":null},{"id":"2409.06997","title":"What is the Right Notion of Distance between Predict-then-Optimize Tasks?","created":"2024-09-11","cited_by_count":2,"area":null},{"id":"2410.08060","title":"Optimal Transportation by Orthogonal Coupling Dynamics","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2505.06123","title":"Wasserstein Distances Made Explainable: Insights Into Dataset Shifts and Transport Phenomena","created":"2025-05-09","cited_by_count":2,"area":null},{"id":"2212.13912","title":"Fully Probabilistic Design for Optimal Transport","created":"2022-12-19","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":"2310.12081","title":"Robust Graph Matching Using An Unbalanced Hierarchical Optimal Transport Framework","created":"2023-10-18","cited_by_count":0,"area":null},{"id":"2311.18826","title":"Geometry-Aware Normalizing Wasserstein Flows for Optimal Causal Inference","created":"2023-11-30","cited_by_count":0,"area":null},{"id":"2503.24204","title":"Many-to-Many Matching via Sparsity Controlled Optimal Transport","created":"2025-03-31","cited_by_count":0,"area":null},{"id":"2509.20678","title":"Bispectral OT: Dataset Comparison using Symmetry-Aware Optimal Transport","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2601.07144","title":"Optimal Transport under Group Fairness Constraints","created":"2026-01-12","cited_by_count":0,"area":null},{"id":"2610.14942","title":"Probabilistic Multi-Source Data Selection via Learnable Categorical Priors: Variance Reduction and Guaranteed Derandomization","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}