{"total":126,"rows":[{"id":"2210.01253","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","created":"2022-10-03","cited_by_count":64,"area":"mllm"},{"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":"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":"2312.04403","title":"OT-Attack: Enhancing Adversarial Transferability of Vision-Language Models via Optimal Transport Optimization","created":"2023-12-07","cited_by_count":37,"area":"mllm"},{"id":"2106.01963","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","created":"2021-06-03","cited_by_count":35,"area":null},{"id":"2202.09025","title":"Graph Auto-Encoder Via Neighborhood Wasserstein Reconstruction","created":"2022-02-18","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":"2208.11726","title":"Wasserstein Task Embedding for Measuring Task Similarities","created":"2022-08-24","cited_by_count":25,"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":"2104.02013","title":"Quantized Gromov-Wasserstein","created":"2021-04-05","cited_by_count":19,"area":null},{"id":"2203.10453","title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","created":"2022-03-20","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":"2301.12171","title":"ZegOT: Zero-shot Segmentation Through Optimal Transport of Text Prompts","created":"2023-01-28","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":"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.06788","title":"Graph Mixup with Soft Alignments","created":"2023-06-11","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":"2404.09411","title":"Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers","created":"2024-04-15","cited_by_count":14,"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":"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":"2503.16832","title":"Joint Self-Supervised Video Alignment and Action Segmentation","created":"2025-03-21","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":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","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":"2207.10776","title":"Auto-regressive Image Synthesis with Integrated Quantization","created":"2022-07-21","cited_by_count":9,"area":null},{"id":"2306.03615","title":"PEARL: Zero-shot Cross-task Preference Alignment and Robust Reward Learning for Robotic Manipulation","created":"2023-06-06","cited_by_count":9,"area":"alignment"},{"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":"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":"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":"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":"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":"2305.19738","title":"Bures-Wasserstein Means of Graphs","created":"2023-05-31","cited_by_count":6,"area":null},{"id":"2401.11418","title":"Double-Bounded Optimal Transport for Advanced Clustering and Classification","created":"2024-01-21","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":"2112.14381","title":"COTReg:Coupled Optimal Transport based Point Cloud Registration","created":"2021-12-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":"2207.02968","title":"Unsupervised Manifold Alignment with Joint Multidimensional Scaling","created":"2022-07-06","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":"2111.06546","title":"Approximating Optimal Transport via Low-rank and Sparse Factorization","created":"2021-11-12","cited_by_count":4,"area":null},{"id":"2205.02406","title":"Dangling-Aware Entity Alignment with Mixed High-Order Proximities","created":"2022-05-05","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":"2605.01325","title":"Rethinking Model Selection in VLM Through the Lens of Gromov-Wasserstein Distance","created":"2026-05-02","cited_by_count":4,"area":"lr"},{"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":"2409.02416","title":"Relative Translation Invariant Wasserstein Distance","created":"2024-09-04","cited_by_count":3,"area":null},{"id":"2506.04206","title":"A Few Moments Please: Scalable Graphon Learning via Moment Matching","created":"2025-06-04","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":"2605.29602","title":"CogniVerse: Revolutionizing Multi-Modal Retrieval-Augmented Generation with Cognitive Reflection and Geometric Reasoning","created":"2026-05-28","cited_by_count":3,"area":"lr"},{"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":"2112.01806","title":"Music-to-Dance Generation with Optimal Transport","created":"2021-12-03","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":"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.13216","title":"CombAlign: Enhancing Model Expressiveness in Unsupervised Graph Alignment","created":"2024-06-19","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":"2410.16718","title":"Learning Partial Graph Matching via Optimal Partial Transport","created":"2024-10-22","cited_by_count":2,"area":null},{"id":"2411.02198","title":"Metric properties of partial and robust Gromov-Wasserstein distances","created":"2024-11-04","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":"2506.00573","title":"Neural Estimation for Scaling Entropic Multimarginal Optimal Transport","created":"2025-05-31","cited_by_count":2,"area":null},{"id":"2510.22538","title":"Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval","created":"2025-10-26","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":"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":"2205.14275","title":"Image Keypoint Matching using Graph Neural Networks","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2208.10682","title":"CAPER: Coarsen, Align, Project, Refine - A General Multilevel Framework for Network Alignment","created":"2022-08-23","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":"2305.07138","title":"Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures","created":"2023-05-11","cited_by_count":1,"area":null},{"id":"2305.07580","title":"Fisher Information Embedding for Node and Graph Learning","created":"2023-05-12","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.11968","title":"NALA: an Effective and Interpretable Entity Alignment Method","created":"2024-04-18","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":"2510.05527","title":"Transfer Learning on Edge Connecting Probability Estimation under Graphon Model","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2602.12740","title":"SPRig: Self-Supervised Pose-Invariant Rigging from Mesh Sequences","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2603.11618","title":"Shape-of-You: Fused Gromov-Wasserstein Optimal Transport for Semantic Correspondence in-the-Wild","created":"2026-03-12","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":"2609.20419","title":"SCGFM-ART: Amortized Relational Transport for Structure-Centric Graph Foundation Models","created":"2026-09-17","cited_by_count":1,"area":null},{"id":"2102.02741","title":"Hawkes Processes on Graphons","created":"2021-02-04","cited_by_count":0,"area":null},{"id":"2106.06171","title":"Inter-domain Multi-relational Link Prediction","created":"2021-06-11","cited_by_count":0,"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":"2301.11273","title":"AlignGraph: A Group of Generative Models for Graphs","created":"2023-01-26","cited_by_count":0,"area":null},{"id":"2309.07030","title":"Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks","created":"2023-09-13","cited_by_count":0,"area":null}],"next_cursor":"100"}