{"total":25,"rows":[{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"area":null},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37,"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":"2106.05194","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","created":"2021-06-09","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":"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":"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":"2105.14244","title":"Learning Graphon Autoencoders for Generative Graph Modeling","created":"2021-05-29","cited_by_count":5,"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":"2212.06339","title":"Regularized Optimal Transport Layers for Generalized Global Pooling Operations","created":"2022-12-13","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":"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":"2408.03461","title":"When does the mean network capture the topology of a sample of networks?","created":"2024-08-06","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":"2201.09191","title":"Revisiting Global Pooling through the Lens of Optimal Transport","created":"2022-01-23","cited_by_count":0,"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":"2310.12081","title":"Robust Graph Matching Using An Unbalanced Hierarchical Optimal Transport Framework","created":"2023-10-18","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":"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}