{"total":61,"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":"2211.08775","title":"Unbalanced Optimal Transport, from Theory to Numerics","created":"2022-11-16","cited_by_count":46,"area":null},{"id":"2206.05262","title":"Meta Optimal Transport","created":"2022-06-10","cited_by_count":28,"area":null},{"id":"2310.09254","title":"GENOT: Entropic (Gromov) Wasserstein Flow Matching with Applications to Single-Cell Genomics","created":"2023-10-13","cited_by_count":28,"area":"diffusion"},{"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":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20,"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":"2202.02495","title":"Weisfeiler-Lehman meets Gromov-Wasserstein","created":"2022-02-05","cited_by_count":14,"area":null},{"id":"2402.02239","title":"Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein","created":"2024-02-03","cited_by_count":12,"area":null},{"id":"2408.08233","title":"The Z-Gromov-Wasserstein Distance","created":"2024-08-15","cited_by_count":12,"area":null},{"id":"2505.13893","title":"InfiGFusion: Graph-on-Logits Distillation via Efficient Gromov-Wasserstein for Model Fusion","created":"2025-05-20","cited_by_count":12,"area":null},{"id":"2205.13573","title":"Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification","created":"2022-05-26","cited_by_count":11,"area":null},{"id":"2109.14090","title":"Reversible Gromov-Monge Sampler for Simulation-Based Inference","created":"2021-09-28","cited_by_count":10,"area":null},{"id":"2312.14572","title":"Semidefinite Relaxations of the Gromov-Wasserstein Distance","created":"2023-12-22","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":"2503.03025","title":"Hierarchical Refinement: Optimal Transport to Infinity and Beyond","created":"2025-03-04","cited_by_count":9,"area":null},{"id":"2508.02364","title":"A Novel Sliced Fused Gromov-Wasserstein Distance","created":"2025-08-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":"2302.00942","title":"Efficient Graph Field Integrators Meet Point Clouds","created":"2023-02-02","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":"2307.09057","title":"Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces","created":"2023-07-18","cited_by_count":7,"area":null},{"id":"2402.12269","title":"Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss","created":"2024-02-19","cited_by_count":7,"area":null},{"id":"2303.05978","title":"Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem","created":"2023-03-10","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":"2408.02433","title":"On Probabilistic Embeddings in Optimal Dimension Reduction","created":"2024-08-05","cited_by_count":5,"area":null},{"id":"2110.10932","title":"Subspace Detours Meet Gromov-Wasserstein","created":"2021-10-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":"2407.07829","title":"Disentangled Representation Learning with the Gromov-Monge Gap","created":"2024-07-10","cited_by_count":3,"area":null},{"id":"2404.08970","title":"Fast Gradient Computation for Gromov-Wasserstein Distance","created":"2024-04-13","cited_by_count":2,"area":null},{"id":"2406.13507","title":"Scalable unsupervised alignment of general metric and non-metric structures","created":"2024-06-19","cited_by_count":2,"area":null},{"id":"2501.17443","title":"Gradual Domain Adaptation for Graph Learning","created":"2025-01-29","cited_by_count":2,"area":null},{"id":"2205.08115","title":"Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data","created":"2022-05-17","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":"2307.10093","title":"Revisiting invariances and introducing priors in Gromov-Wasserstein distances","created":"2023-07-19","cited_by_count":1,"area":null},{"id":"2505.12322","title":"Model alignment using inter-modal bridges","created":"2025-05-18","cited_by_count":1,"area":"alignment"},{"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":"2605.08546","title":"Sliced Inner Product Gromov-Wasserstein Distances","created":"2026-05-08","cited_by_count":1,"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":"2407.11286","title":"CLAMS: A System for Zero-Shot Model Selection for Clustering","created":"2024-07-15","cited_by_count":0,"area":null},{"id":"2408.06525","title":"Note on computational complexity of the Gromov-Wasserstein distance","created":"2024-08-12","cited_by_count":0,"area":null},{"id":"2507.13194","title":"Relation-Aware Slicing in Cross-Domain Alignment","created":"2025-07-17","cited_by_count":0,"area":null},{"id":"2509.04089","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","created":"2025-09-04","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":"2512.08508","title":"Multi-Alignment Contrastive Learning for Enzyme--Reaction Retrieval","created":"2025-12-09","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.13753","title":"Min Generalized Sliced Gromov Wasserstein: A Scalable Path to Gromov Wasserstein","created":"2026-05-13","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":"2606.02047","title":"Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2608.04234","title":"Multimodal Alignment Through Joint Kernel Entropic Gromov--Wasserstein Optimal Transport","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2608.07248","title":"Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization","created":"2026-08-07","cited_by_count":0,"area":null},{"id":"2608.11016","title":"Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.14293","title":"Conditional Neural Optimal Transport for Predicting Cellular Phenotypes from Molecular Structure","created":"2026-08-14","cited_by_count":0,"area":null},{"id":"2608.26961","title":"Gromov-Monge Flow Matching for Equivariant Graph Generation","created":"2026-08-27","cited_by_count":0,"area":"diffusion"},{"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.15437","title":"Graph Matching Relaxations and Amortization for Supervised Graph Prediction","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.31848","title":"Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.32824","title":"Unlocking Geodesic Gromov-Wasserstein Distances for 3D Modeling","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.39339","title":"A Unified Dual Method for Matching Problems","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}