{"total":54,"rows":[{"id":"2101.01792","title":"Minibatch optimal transport distances; analysis and applications","created":"2021-01-05","cited_by_count":65,"area":null},{"id":"2108.02120","title":"Statistical Analysis of Wasserstein Distributionally Robust Estimators","created":"2021-08-04","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":"2212.08049","title":"Sliced Optimal Partial Transport","created":"2022-12-15","cited_by_count":20,"area":null},{"id":"2102.12833","title":"Diffusion Earth Mover's Distance and Distribution Embeddings","created":"2021-02-25","cited_by_count":18,"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":"2302.04065","title":"Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps","created":"2023-02-08","cited_by_count":16,"area":null},{"id":"2101.09756","title":"Entropy Partial Transport with Tree Metrics: Theory and Practice","created":"2021-01-24","cited_by_count":13,"area":null},{"id":"2101.11520","title":"Supervised Tree-Wasserstein Distance","created":"2021-01-27","cited_by_count":10,"area":null},{"id":"2105.14403","title":"Re-evaluating Word Mover's Distance","created":"2021-05-30","cited_by_count":10,"area":null},{"id":"2109.03431","title":"Fixed Support Tree-Sliced Wasserstein Barycenter","created":"2021-09-08","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":"2205.15059","title":"Hilbert Curve Projection Distance for Distribution Comparison","created":"2022-05-30","cited_by_count":9,"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":"2110.11862","title":"Graph Filtration Kernels","created":"2021-10-22","cited_by_count":8,"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":"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":"2304.13374","title":"SEAL: Simultaneous Label Hierarchy Exploration And Learning","created":"2023-04-26","cited_by_count":6,"area":null},{"id":"2311.00927","title":"Scalable Counterfactual Distribution Estimation in Multivariate Causal Models","created":"2023-11-02","cited_by_count":6,"area":null},{"id":"2410.21107","title":"Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy","created":"2024-10-28","cited_by_count":5,"area":null},{"id":"2104.07232","title":"Iterative Alignment Flows","created":"2021-04-15","cited_by_count":4,"area":null},{"id":"2107.12334","title":"Embedding Signals on Knowledge Graphs with Unbalanced Diffusion Earth Mover's Distance","created":"2021-07-26","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":"2210.12288","title":"Learning Ultrametric Trees for Optimal Transport Regression","created":"2022-10-21","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":"2410.03052","title":"Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport","created":"2024-10-04","cited_by_count":3,"area":null},{"id":"2505.00968","title":"Tree-Sliced Wasserstein Distance with Nonlinear Projection","created":"2025-05-02","cited_by_count":3,"area":null},{"id":"2103.00899","title":"Computationally Efficient Wasserstein Loss for Structured Labels","created":"2021-03-01","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":"2209.14644","title":"Increasing Model Generalizability for Unsupervised Domain Adaptation","created":"2022-09-29","cited_by_count":1,"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":"2303.10085","title":"Robust probabilistic inference via a constrained transport metric","created":"2023-03-17","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":"2411.07432","title":"Fast unsupervised ground metric learning with tree-Wasserstein distance","created":"2024-11-11","cited_by_count":1,"area":null},{"id":"2411.16438","title":"Harnessing Superclasses for Learning from Hierarchical Databases","created":"2024-11-25","cited_by_count":1,"area":null},{"id":"2502.00737","title":"Scalable Sobolev IPM for Probability Measures on a Graph","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2506.21150","title":"Tree-based Semantic Losses: Application to Sparsely-supervised Large Multi-class Hyperspectral Segmentation","created":"2025-06-26","cited_by_count":1,"area":null},{"id":"2111.10452","title":"MURAL: An Unsupervised Random Forest-Based Embedding for Electronic Health Record Data","created":"2021-11-19","cited_by_count":0,"area":null},{"id":"2112.06292","title":"Gamifying optimization: a Wasserstein distance-based analysis of human search","created":"2021-12-12","cited_by_count":0,"area":null},{"id":"2209.11703","title":"Multivariate Wasserstein Functional Connectivity for Autism Screening","created":"2022-09-23","cited_by_count":0,"area":null},{"id":"2306.02508","title":"Graph Fourier MMD for Signals on Graphs","created":"2023-06-05","cited_by_count":0,"area":null},{"id":"2310.10143","title":"An Empirical Study of Self-supervised Learning with Wasserstein Distance","created":"2023-10-16","cited_by_count":0,"area":null},{"id":"2502.00739","title":"An Efficient Orlicz-Sobolev Approach for Transporting Unbalanced Measures on a Graph","created":"2025-02-02","cited_by_count":0,"area":null},{"id":"2505.24642","title":"WILTing Trees: Interpreting the Distance Between MPNN Embeddings","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2507.15777","title":"Label tree semantic losses for rich multi-class medical image segmentation","created":"2025-07-21","cited_by_count":0,"area":null},{"id":"2510.25591","title":"Generalized Sobolev IPM for Graph-Based Measures","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2603.12652","title":"Sobolev--Ricci Curvature","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2604.18816","title":"Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2606.04695","title":"From Cone Geometry to Monge Structure: Local Defects and Global Regret in High-Dimensional Optimal Transport","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2606.30310","title":"Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions","created":"2026-06-29","cited_by_count":0,"area":null}],"next_cursor":null}