{"total":37,"rows":[{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"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":"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":"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.15963","title":"Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications","created":"2023-06-28","cited_by_count":15,"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":"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":"2408.11370","title":"Graph Classification via Reference Distribution Learning: Theory and Practice","created":"2024-08-21","cited_by_count":11,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","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":"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":"2105.14244","title":"Learning Graphon Autoencoders for Generative Graph Modeling","created":"2021-05-29","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":"2402.01975","title":"Structure-Aware E(3)-Invariant Molecular Conformer Aggregation Networks","created":"2024-02-03","cited_by_count":4,"area":null},{"id":"2503.11470","title":"Topological Dictionary Learning","created":"2025-03-14","cited_by_count":4,"area":null},{"id":"2302.08621","title":"Distances for Markov Chains, and Their Differentiation","created":"2023-02-16","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":"2506.19224","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","created":"2025-06-24","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":"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":"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":"2306.10505","title":"Structure-Sensitive Graph Dictionary Embedding for Graph Classification","created":"2023-06-18","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":"2411.05729","title":"Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data","created":"2024-11-08","cited_by_count":0,"area":null},{"id":"2602.16265","title":"On sparsity, extremal structure, and monotonicity properties of Wasserstein and Gromov-Wasserstein optimal transport plans","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.20883","title":"Learning fMRI activations dictionaries across individual geometries via optimal transport","created":"2026-05-20","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.02223","title":"Network Learning with Semi-relaxed Gromov-Wasserstein","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2607.21381","title":"Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls","created":"2026-07-23","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":"2609.05919","title":"A dictionary learning framework for graphs via filters and optimal transport","created":"2026-09-05","cited_by_count":0,"area":null}],"next_cursor":null}