{"total":160,"rows":[{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"area":null},{"id":"2210.01906","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","created":"2022-10-04","cited_by_count":41,"area":null},{"id":"2404.01518","title":"Temporally Consistent Unbalanced Optimal Transport for Unsupervised Action Segmentation","created":"2024-04-01","cited_by_count":38,"area":null},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2106.04145","title":"Unbalanced Optimal Transport through Non-negative Penalized Linear Regression","created":"2021-06-08","cited_by_count":31,"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":"2202.03813","title":"Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenters","created":"2022-02-08","cited_by_count":22,"area":null},{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21,"area":null},{"id":"2203.14804","title":"Partially Does It: Towards Scene-Level FG-SBIR with Partial Input","created":"2022-03-28","cited_by_count":20,"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":"2104.02013","title":"Quantized Gromov-Wasserstein","created":"2021-04-05","cited_by_count":19,"area":null},{"id":"2110.02887","title":"Using Optimal Transport as Alignment Objective for fine-tuning Multilingual Contextualized Embeddings","created":"2021-10-06","cited_by_count":19,"area":null},{"id":"2211.03329","title":"Implicit Graphon Neural Representation","created":"2022-11-07","cited_by_count":19,"area":null},{"id":"2305.13987","title":"On Structural Expressive Power of Graph Transformers","created":"2023-05-23","cited_by_count":19,"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":"2102.05912","title":"On Transportation of Mini-batches: A Hierarchical Approach","created":"2021-02-11","cited_by_count":16,"area":null},{"id":"2305.06574","title":"A Fused Gromov-Wasserstein Framework for Unsupervised Knowledge Graph Entity Alignment","created":"2023-05-11","cited_by_count":16,"area":null},{"id":"2301.12721","title":"Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport","created":"2023-01-30","cited_by_count":15,"area":null},{"id":"2306.08854","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","created":"2023-06-15","cited_by_count":15,"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":"2308.04383","title":"DELFlow: Dense Efficient Learning of Scene Flow for Large-Scale Point Clouds","created":"2023-08-08","cited_by_count":14,"area":null},{"id":"2204.00354","title":"RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds","created":"2022-04-01","cited_by_count":13,"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":"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":"2205.13573","title":"Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification","created":"2022-05-26","cited_by_count":11,"area":null},{"id":"2303.06595","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","created":"2023-03-12","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":"2408.11370","title":"Graph Classification via Reference Distribution Learning: Theory and Practice","created":"2024-08-21","cited_by_count":11,"area":null},{"id":"2503.16832","title":"Joint Self-Supervised Video Alignment and Action Segmentation","created":"2025-03-21","cited_by_count":11,"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":"2312.14572","title":"Semidefinite Relaxations of the Gromov-Wasserstein Distance","created":"2023-12-22","cited_by_count":10,"area":null},{"id":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","cited_by_count":10,"area":null},{"id":"2203.04711","title":"On a linear fused Gromov-Wasserstein distance for graph structured data","created":"2022-03-09","cited_by_count":9,"area":null},{"id":"2210.03164","title":"InfoOT: Information Maximizing Optimal Transport","created":"2022-10-06","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":"2406.19244","title":"Improving the Expressiveness of $K$-hop Message-Passing GNNs by Injecting Contextualized Substructure Information","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2407.19311","title":"Can Modifying Data Address Graph Domain Adaptation?","created":"2024-07-27","cited_by_count":9,"area":null},{"id":"2503.11347","title":"Integrating Dynamical Systems Modeling with Spatiotemporal scRNA-seq Data Analysis","created":"2025-03-14","cited_by_count":9,"area":null},{"id":"2109.04442","title":"FGOT: Graph Distances based on Filters and Optimal Transport","created":"2021-09-09","cited_by_count":7,"area":null},{"id":"2302.00942","title":"Efficient Graph Field Integrators Meet Point Clouds","created":"2023-02-02","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":"2402.03838","title":"Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels","created":"2024-02-06","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":"2511.00977","title":"Modeling Microenvironment Trajectories on Spatial Transcriptomics with NicheFlow","created":"2025-11-02","cited_by_count":7,"area":null},{"id":"2202.00808","title":"Gromov-Wasserstein Discrepancy with Local Differential Privacy for Distributed Structural Graphs","created":"2022-02-01","cited_by_count":6,"area":null},{"id":"2205.14923","title":"Unbalanced CO-Optimal Transport","created":"2022-05-30","cited_by_count":6,"area":null},{"id":"2302.04610","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","created":"2023-02-09","cited_by_count":6,"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":"2305.19738","title":"Bures-Wasserstein Means of Graphs","created":"2023-05-31","cited_by_count":6,"area":null},{"id":"2406.04056","title":"Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently","created":"2024-06-06","cited_by_count":6,"area":null},{"id":"2412.18857","title":"Computing Approximate Graph Edit Distance via Optimal Transport","created":"2024-12-25","cited_by_count":6,"area":null},{"id":"2105.14244","title":"Learning Graphon Autoencoders for Generative Graph Modeling","created":"2021-05-29","cited_by_count":5,"area":null},{"id":"2201.12064","title":"Multiscale Graph Comparison via the Embedded Laplacian Discrepancy","created":"2022-01-28","cited_by_count":5,"area":null},{"id":"2209.01847","title":"Conflict-Aware Pseudo Labeling via Optimal Transport for Entity Alignment","created":"2022-09-05","cited_by_count":5,"area":null},{"id":"2408.00981","title":"Cross-domain Named Entity Recognition via Graph Matching","created":"2024-08-02","cited_by_count":5,"area":null},{"id":"2412.11550","title":"THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings","created":"2024-12-16","cited_by_count":5,"area":null},{"id":"2605.08689","title":"Structure-Centric Graph Foundation Model via Geometric Bases","created":"2026-05-09","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":"2207.04216","title":"Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees","created":"2022-07-09","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":"2402.01975","title":"Structure-Aware E(3)-Invariant Molecular Conformer Aggregation Networks","created":"2024-02-03","cited_by_count":4,"area":null},{"id":"2405.15505","title":"Revisiting Counterfactual Regression through the Lens of Gromov-Wasserstein Information Bottleneck","created":"2024-05-24","cited_by_count":4,"area":null},{"id":"2406.19195","title":"Estimating Long-term Heterogeneous Dose-response Curve: Generalization Bound Leveraging Optimal Transport Weights","created":"2024-06-27","cited_by_count":4,"area":null},{"id":"2203.08149","title":"MoReL: Multi-omics Relational Learning","created":"2022-03-15","cited_by_count":3,"area":null},{"id":"2205.05838","title":"Orthogonal Gromov-Wasserstein Discrepancy with Efficient Lower Bound","created":"2022-05-12","cited_by_count":3,"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":"2404.13430","title":"React-OT: Optimal Transport for Generating Transition State in Chemical Reactions","created":"2024-04-20","cited_by_count":3,"area":null},{"id":"2506.12025","title":"Unsupervised Learning for Optimal Transport plan prediction between unbalanced graphs","created":"2025-05-21","cited_by_count":3,"area":null},{"id":"2101.03196","title":"Sketching Merge Trees for Scientific Data Visualization","created":"2021-01-08","cited_by_count":2,"area":null},{"id":"2106.07106","title":"Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks","created":"2021-06-13","cited_by_count":2,"area":null},{"id":"2208.13427","title":"The PWLR Graph Representation: A Persistent Weisfeiler-Lehman scheme with Random Walks for Graph Classification","created":"2022-08-29","cited_by_count":2,"area":null},{"id":"2212.06339","title":"Regularized Optimal Transport Layers for Generalized Global Pooling Operations","created":"2022-12-13","cited_by_count":2,"area":null},{"id":"2302.05844","title":"Graph Matching Optimization Network for Point Cloud Registration","created":"2023-02-12","cited_by_count":2,"area":null},{"id":"2302.08621","title":"Distances for Markov Chains, and Their Differentiation","created":"2023-02-16","cited_by_count":2,"area":null},{"id":"2307.02075","title":"Combating Confirmation Bias: A Unified Pseudo-Labeling Framework for Entity Alignment","created":"2023-07-05","cited_by_count":2,"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.09253","title":"Deep Sketched Output Kernel Regression for Structured Prediction","created":"2024-06-13","cited_by_count":2,"area":null},{"id":"2406.13216","title":"CombAlign: Enhancing Model Expressiveness in Unsupervised Graph Alignment","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":"2503.21105","title":"AugWard: Augmentation-Aware Representation Learning for Accurate Graph Classification","created":"2025-03-27","cited_by_count":2,"area":null},{"id":"2503.21538","title":"Formation Shape Control using the Gromov-Wasserstein Metric","created":"2025-03-27","cited_by_count":2,"area":null},{"id":"2505.18005","title":"Distances for Markov chains from sample streams","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2507.00894","title":"An in depth look at the Procrustes-Wasserstein distance: properties and barycenters","created":"2025-07-01","cited_by_count":2,"area":null},{"id":"2512.11199","title":"CADKnitter: Compositional CAD Generation from Text and Geometry Guidance","created":"2025-12-12","cited_by_count":2,"area":null},{"id":"2603.02460","title":"Conformal Graph Prediction with Z-Gromov-Wasserstein Distances","created":"2026-03-02","cited_by_count":2,"area":null},{"id":"2110.02554","title":"A Regularized Wasserstein Framework for Graph Kernels","created":"2021-10-06","cited_by_count":1,"area":null},{"id":"2204.00289","title":"Selecting task with optimal transport self-supervised learning for few-shot classification","created":"2022-04-01","cited_by_count":1,"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":"2209.12727","title":"A Simple Way to Learn Metrics Between Attributed Graphs","created":"2022-09-26","cited_by_count":1,"area":null},{"id":"2210.10535","title":"Stability of Entropic Wasserstein Barycenters and application to random geometric graphs","created":"2022-10-19","cited_by_count":1,"area":null},{"id":"2301.12065","title":"Decentralized Entropic Optimal Transport for Distributed Distribution Comparison","created":"2023-01-28","cited_by_count":1,"area":null},{"id":"2305.03565","title":"The geometry of financial institutions -- Wasserstein clustering of financial data","created":"2023-05-05","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":"2309.16604","title":"Exploiting Edge Features in Graphs with Fused Network Gromov-Wasserstein Distance","created":"2023-09-28","cited_by_count":1,"area":null},{"id":"2310.11762","title":"A Quasi-Wasserstein Loss for Learning Graph Neural Networks","created":"2023-10-18","cited_by_count":1,"area":null},{"id":"2404.00589","title":"Harnessing the Power of Large Language Model for Uncertainty Aware Graph Processing","created":"2024-03-31","cited_by_count":1,"area":null}],"next_cursor":"100"}