{"total":100,"rows":[{"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":"2211.08775","title":"Unbalanced Optimal Transport, from Theory to Numerics","created":"2022-11-16","cited_by_count":46,"area":null},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2202.09025","title":"Graph Auto-Encoder Via Neighborhood Wasserstein Reconstruction","created":"2022-02-18","cited_by_count":28,"area":null},{"id":"2102.06857","title":"On Robust Optimal Transport: Computational Complexity and Barycenter Computation","created":"2021-02-13","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":"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":"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":"2211.03329","title":"Implicit Graphon Neural Representation","created":"2022-11-07","cited_by_count":19,"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":"2301.12171","title":"ZegOT: Zero-shot Segmentation Through Optimal Transport of Text Prompts","created":"2023-01-28","cited_by_count":16,"area":null},{"id":"2106.05194","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","created":"2021-06-09","cited_by_count":15,"area":null},{"id":"2210.06671","title":"Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networks","created":"2022-10-13","cited_by_count":15,"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":"2503.24129","title":"It's a (Blind) Match! Towards Vision-Language Correspondence without Parallel Data","created":"2025-03-31","cited_by_count":14,"area":null},{"id":"2510.24574","title":"DistDF: Time-Series Forecasting Needs Joint-Distribution Wasserstein Alignment","created":"2025-10-28","cited_by_count":13,"area":null},{"id":"2108.10961","title":"Entropic Gromov-Wasserstein between Gaussian Distributions","created":"2021-08-24","cited_by_count":12,"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":"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":"2106.02206","title":"Stochastic Iterative Graph Matching","created":"2021-06-04","cited_by_count":10,"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":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","cited_by_count":10,"area":null},{"id":"2505.21366","title":"PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment","created":"2025-05-27","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":"2403.14183","title":"OTSeg: Multi-prompt Sinkhorn Attention for Zero-Shot Semantic Segmentation","created":"2024-03-21","cited_by_count":9,"area":null},{"id":"2410.17464","title":"Scalable Implicit Graphon Learning","created":"2024-10-22","cited_by_count":9,"area":null},{"id":"2106.07853","title":"G2DA: Geometry-Guided Dual-Alignment Learning for RGB-Infrared Person Re-Identification","created":"2021-06-15","cited_by_count":8,"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.09755","title":"Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification","created":"2023-02-20","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":"2407.01111","title":"Proximity Matters: Local Proximity Enhanced Balancing for Treatment Effect Estimation","created":"2024-07-01","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":"2412.18857","title":"Computing Approximate Graph Edit Distance via Optimal Transport","created":"2024-12-25","cited_by_count":6,"area":null},{"id":"2102.07115","title":"Sliced Multi-Marginal Optimal Transport","created":"2021-02-14","cited_by_count":5,"area":null},{"id":"2105.14244","title":"Learning Graphon Autoencoders for Generative Graph Modeling","created":"2021-05-29","cited_by_count":5,"area":null},{"id":"2111.11328","title":"Cycle Consistent Probability Divergences Across Different Spaces","created":"2021-11-22","cited_by_count":5,"area":null},{"id":"2207.02968","title":"Unsupervised Manifold Alignment with Joint Multidimensional Scaling","created":"2022-07-06","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":"2110.10932","title":"Subspace Detours Meet Gromov-Wasserstein","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2204.04099","title":"Seeded graph matching for the correlated Gaussian Wigner model via the projected power method","created":"2022-04-08","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":"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":"2311.01375","title":"Monotone Generative Modeling via a Gromov-Monge Embedding","created":"2023-11-02","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":"2212.06339","title":"Regularized Optimal Transport Layers for Generalized Global Pooling Operations","created":"2022-12-13","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":"2407.10495","title":"Improving Hyperbolic Representations via Gromov-Wasserstein Regularization","created":"2024-07-15","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.21538","title":"Formation Shape Control using the Gromov-Wasserstein Metric","created":"2025-03-27","cited_by_count":2,"area":null},{"id":"2106.02542","title":"Heterogeneous Wasserstein Discrepancy for Incomparable Distributions","created":"2021-06-04","cited_by_count":1,"area":null},{"id":"2110.02554","title":"A Regularized Wasserstein Framework for Graph Kernels","created":"2021-10-06","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.00232","title":"Hybrid Gromov-Wasserstein Embedding for Capsule Learning","created":"2022-09-01","cited_by_count":1,"area":null},{"id":"2402.04732","title":"Graph Cuts with Arbitrary Size Constraints Through Optimal Transport","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2506.21507","title":"Robust Alignment via Partial Gromov-Wasserstein Distances","created":"2025-06-26","cited_by_count":1,"area":null},{"id":"2509.18826","title":"Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective","created":"2025-09-23","cited_by_count":1,"area":null},{"id":"2510.05527","title":"Transfer Learning on Edge Connecting Probability Estimation under Graphon Model","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2106.07501","title":"Balanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy","created":"2021-06-14","cited_by_count":0,"area":null},{"id":"2107.11858","title":"Estimation of Stationary Optimal Transport Plans","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2112.02792","title":"Incentive Compatible Pareto Alignment for Multi-Source Large Graphs","created":"2021-12-06","cited_by_count":0,"area":null},{"id":"2202.02797","title":"SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm","created":"2022-02-06","cited_by_count":0,"area":null},{"id":"2205.09738","title":"AIGenC: An AI generalisation model via creativity","created":"2022-05-19","cited_by_count":0,"area":null},{"id":"2310.03398","title":"Interpolating between Clustering and Dimensionality Reduction with Gromov-Wasserstein","created":"2023-10-05","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":"2406.02348","title":"AMOSL: Adaptive Modality-wise Structure Learning in Multi-view Graph Neural Networks For Enhanced Unified Representation","created":"2024-06-04","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":"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":"2503.23002","title":"Learning Structure-enhanced Temporal Point Processes with Gromov-Wasserstein Regularization","created":"2025-03-29","cited_by_count":0,"area":null},{"id":"2506.02619","title":"HGOT: Self-supervised Heterogeneous Graph Neural Network with Optimal Transport","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2508.00887","title":"FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing","created":"2025-07-26","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.03086","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","created":"2025-10-03","cited_by_count":0,"area":null},{"id":"2603.08526","title":"Towards Effective and Efficient Graph Alignment without Supervision","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2604.19547","title":"Emotion-Cause Pair Extraction in Conversations via Semantic Decoupling and Graph Alignment","created":"2026-04-21","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.28488","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.07598","title":"A Topological Characterization of Graph Neural Networks via Stochastic Block Model Embeddings on the n-Sphere","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2607.11952","title":"Scalable Optimal Transport Algorithm for Network Alignment","created":"2026-07-11","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.29635","title":"Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment","created":"2026-08-30","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":"2610.04264","title":"Adaptive Bregman Alternating Projections for Feasible Gromov-Wasserstein Learning","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}