{"total":64,"rows":[{"id":"2102.01350","title":"Graph Coarsening with Neural Networks","created":"2021-02-02","cited_by_count":55,"area":null},{"id":"2211.08775","title":"Unbalanced Optimal Transport, from Theory to Numerics","created":"2022-11-16","cited_by_count":46,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"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":"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":"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":"2312.00096","title":"OST: Refining Text Knowledge with Optimal Spatio-Temporal Descriptor for General Video Recognition","created":"2023-11-30","cited_by_count":16,"area":"mllm"},{"id":"2202.04920","title":"Collaborative Filtering with Attribution Alignment for Review-based Non-overlapped Cross Domain Recommendation","created":"2022-02-10","cited_by_count":14,"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":"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":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","cited_by_count":10,"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":"2109.04442","title":"FGOT: Graph Distances based on Filters and Optimal Transport","created":"2021-09-09","cited_by_count":7,"area":null},{"id":"2201.12933","title":"Riemannian block SPD coupling manifold and its application to optimal transport","created":"2022-01-30","cited_by_count":7,"area":null},{"id":"2205.09956","title":"Structured Attention Composition for Temporal Action Localization","created":"2022-05-20","cited_by_count":7,"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":"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":"2310.09821","title":"LICO: Explainable Models with Language-Image Consistency","created":"2023-10-15","cited_by_count":5,"area":null},{"id":"2310.16705","title":"Wasserstein Gradient Flow over Variational Parameter Space for Variational Inference","created":"2023-10-25","cited_by_count":5,"area":null},{"id":"2206.02921","title":"Schema-Guided Event Graph Completion","created":"2022-06-06","cited_by_count":4,"area":null},{"id":"2307.16358","title":"Moreau-Yoshida Variational Transport: A General Framework For Solving Regularized Distributional Optimization Problems","created":"2023-07-31","cited_by_count":3,"area":null},{"id":"2311.07596","title":"Graph GOSPA metric: a metric to measure the discrepancy between graphs of different sizes","created":"2023-11-10","cited_by_count":3,"area":null},{"id":"2505.18765","title":"Multiple Wasserstein Gradient Descent Algorithm for Multi-Objective Distributional Optimization","created":"2025-05-24","cited_by_count":3,"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":"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":"2502.13836","title":"Quantifying Memorization and Parametric Response Rates in Retrieval-Augmented Vision-Language Models","created":"2025-02-19","cited_by_count":2,"area":"mllm"},{"id":"2503.10663","title":"Optimal Transport for Brain-Image Alignment: Unveiling Redundancy and Synergy in Neural Information Processing","created":"2025-03-09","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":"2209.12727","title":"A Simple Way to Learn Metrics Between Attributed Graphs","created":"2022-09-26","cited_by_count":1,"area":null},{"id":"2406.12204","title":"An Optimal Transport Approach for Network Regression","created":"2024-06-18","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.21507","title":"Robust Alignment via Partial Gromov-Wasserstein Distances","created":"2025-06-26","cited_by_count":1,"area":null},{"id":"2602.00318","title":"Optimal Transport-Guided Adversarial Attacks on Graph Neural Network-Based Bot Detection","created":"2026-01-30","cited_by_count":1,"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":"2207.11324","title":"Exploring Wasserstein Distance across Concept Embeddings for Ontology Matching","created":"2022-07-22","cited_by_count":0,"area":null},{"id":"2307.00247","title":"Safe Screening for Unbalanced Optimal Transport","created":"2023-07-01","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},{"id":"2311.13147","title":"Optimal Transport with Cyclic Symmetry","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2410.07138","title":"Diagnosis and Pathogenic Analysis of Autism Spectrum Disorder Using Fused Brain Connection Graph","created":"2024-09-22","cited_by_count":0,"area":null},{"id":"2412.12185","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","created":"2024-12-13","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.24204","title":"Many-to-Many Matching via Sparsity Controlled Optimal Transport","created":"2025-03-31","cited_by_count":0,"area":null},{"id":"2506.17316","title":"A family of graph GOSPA metrics for graphs with different sizes","created":"2025-06-18","cited_by_count":0,"area":null},{"id":"2507.16569","title":"Families of Optimal Transport Kernels for Cell Complexes","created":"2025-07-22","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.25591","title":"Generalized Sobolev IPM for Graph-Based Measures","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2602.04152","title":"MA3DSG: Multi-Agent 3D Scene Graph Generation for Large-Scale Indoor Environments","created":"2026-02-04","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":"2606.07151","title":"Geodesics of Dynamic Graphs for Regime Change Detection","created":"2026-06-05","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.27500","title":"Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications","created":"2026-08-27","cited_by_count":0,"area":null},{"id":"2609.05919","title":"A dictionary learning framework for graphs via filters and optimal transport","created":"2026-09-05","cited_by_count":0,"area":null},{"id":"2609.23547","title":"Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport","created":"2026-09-20","cited_by_count":0,"area":null},{"id":"2609.31996","title":"Can Circuit Alignment Predict OOD Generalization?","created":"2026-09-25","cited_by_count":0,"area":null}],"next_cursor":null}