{"total":64,"rows":[{"id":"2201.12324","title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","created":"2022-01-28","cited_by_count":101,"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":"2206.08780","title":"Spherical Sliced-Wasserstein","created":"2022-06-17","cited_by_count":31,"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":"2310.04470","title":"Hierarchical Multi-Marginal Optimal Transport for Network Alignment","created":"2023-10-06","cited_by_count":24,"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":"2202.10723","title":"Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metrics","created":"2022-02-22","cited_by_count":18,"area":null},{"id":"2505.12709","title":"Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics","created":"2025-05-19","cited_by_count":17,"area":null},{"id":"2306.15963","title":"Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications","created":"2023-06-28","cited_by_count":15,"area":null},{"id":"2404.09411","title":"Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers","created":"2024-04-15","cited_by_count":14,"area":null},{"id":"2401.12253","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","created":"2024-01-20","cited_by_count":11,"area":null},{"id":"2211.00805","title":"Geodesic Sinkhorn for Fast and Accurate Optimal Transport on Manifolds","created":"2022-11-02","cited_by_count":10,"area":null},{"id":"2302.12498","title":"Scalable Unbalanced Sobolev Transport for Measures on a Graph","created":"2023-02-24","cited_by_count":10,"area":null},{"id":"2406.05061","title":"Progressive Entropic Optimal Transport Solvers","created":"2024-06-07","cited_by_count":10,"area":null},{"id":"2402.04516","title":"Generalized Sobolev Transport for Probability Measures on a Graph","created":"2024-02-07","cited_by_count":9,"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":"2311.05788","title":"Structured Transforms Across Spaces with Cost-Regularized Optimal Transport","created":"2023-11-09","cited_by_count":8,"area":null},{"id":"2305.19727","title":"Unbalanced Low-rank Optimal Transport Solvers","created":"2023-05-31","cited_by_count":7,"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":"2205.14923","title":"Unbalanced CO-Optimal Transport","created":"2022-05-30","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":"2211.00372","title":"Meta-Learning for Unsupervised Outlier Detection with Optimal Transport","created":"2022-11-01","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":"2509.20508","title":"Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances","created":"2025-09-24","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":"2310.11256","title":"Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space","created":"2023-10-17","cited_by_count":4,"area":null},{"id":"2509.23436","title":"LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport","created":"2025-09-27","cited_by_count":4,"area":null},{"id":"2511.19741","title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","created":"2025-11-24","cited_by_count":4,"area":null},{"id":"2302.04292","title":"Sample Complexity Using Infinite Multiview Models","created":"2023-02-08","cited_by_count":3,"area":null},{"id":"2308.15005","title":"Few-Shot Object Detection via Synthetic Features with Optimal Transport","created":"2023-08-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":"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":"2309.15787","title":"Partial Transport for Point-Cloud Registration","created":"2023-09-27","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":"2604.15114","title":"Amortized Optimal Transport from Sliced Potentials","created":"2026-04-16","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":"2503.15105","title":"Control, Optimal Transport and Neural Differential Equations in Supervised Learning","created":"2025-03-19","cited_by_count":1,"area":null},{"id":"2510.04579","title":"Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2605.04175","title":"A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport","created":"2026-05-05","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":"2305.05389","title":"Two to Five Truths in Non-Negative Matrix Factorization","created":"2023-05-06","cited_by_count":0,"area":null},{"id":"2307.00247","title":"Safe Screening for Unbalanced Optimal Transport","created":"2023-07-01","cited_by_count":0,"area":null},{"id":"2310.16123","title":"Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems","created":"2023-10-24","cited_by_count":0,"area":null},{"id":"2407.11286","title":"CLAMS: A System for Zero-Shot Model Selection for Clustering","created":"2024-07-15","cited_by_count":0,"area":null},{"id":"2510.07569","title":"Automated Machine Learning for Unsupervised Tabular Tasks","created":"2025-10-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":"2511.16778","title":"GCL-OT: Graph Contrastive Learning with Optimal Transport for Heterophilic Text-Attributed Graphs","created":"2025-11-20","cited_by_count":0,"area":null},{"id":"2602.00974","title":"Forest-Guided Semantic Transport for Label-Supervised Manifold Alignment","created":"2026-02-01","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.00837","title":"Fast Log-Domain Sinkhorn Optimal Transport with Warp-Level GPU Reductions","created":"2026-04-04","cited_by_count":0,"area":null},{"id":"2605.09916","title":"The Observable Wasserstein Distance","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.11983","title":"QDSB: Quantized Diffusion Schr\\\"odinger Bridges","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2606.02515","title":"A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution","created":"2026-06-01","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":"2607.24741","title":"DrainSinkhorn: Safe Elimination for Batched Entropic Optimal Transport","created":"2026-07-27","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},{"id":"2609.13010","title":"Dual-guided Hierarchical Edge Localization for Large-scale Optimal Transport Across Dimensions","created":"2026-09-11","cited_by_count":0,"area":null},{"id":"2609.27633","title":"Pheno-GS: Phenoscape-scale Geodesic Sinkhorn","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2609.31787","title":"Optimal transport meets speech: a tutorial review","created":"2026-09-24","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}