{"total":56,"rows":[{"id":"2102.08786","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","created":"2021-02-17","cited_by_count":47,"area":null},{"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":"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.00529","title":"Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks","created":"2022-02-01","cited_by_count":23,"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":"2110.09140","title":"Learning Prototype-oriented Set Representations for Meta-Learning","created":"2021-10-18","cited_by_count":19,"area":null},{"id":"2410.12176","title":"Expected Sliced Transport Plans","created":"2024-10-16","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":"2103.15622","title":"Graph Classification by Mixture of Diverse Experts","created":"2021-03-29","cited_by_count":16,"area":null},{"id":"2201.13410","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","created":"2022-01-31","cited_by_count":15,"area":null},{"id":"2205.14368","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","created":"2022-05-28","cited_by_count":15,"area":null},{"id":"2309.13167","title":"Flow Factorized Representation Learning","created":"2023-09-22","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":"2501.18901","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","created":"2025-01-31","cited_by_count":10,"area":null},{"id":"2112.05872","title":"SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddings","created":"2021-12-11","cited_by_count":9,"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":"2302.03232","title":"Linear Optimal Partial Transport Embedding","created":"2023-02-07","cited_by_count":8,"area":null},{"id":"2410.09118","title":"FSW-GNN: A Bi-Lipschitz WL-Equivalent Graph Neural Network","created":"2024-10-10","cited_by_count":8,"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":"2402.03838","title":"Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels","created":"2024-02-06","cited_by_count":7,"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":"2509.20508","title":"Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances","created":"2025-09-24","cited_by_count":5,"area":null},{"id":"2103.03892","title":"Set Representation Learning with Generalized Sliced-Wasserstein Embeddings","created":"2021-03-05","cited_by_count":4,"area":null},{"id":"2203.07691","title":"Supervised Contrastive Learning with Structure Inference for Graph Classification","created":"2022-03-15","cited_by_count":3,"area":null},{"id":"2310.16437","title":"Non-isotropic Persistent Homology: Leveraging the Metric Dependency of PH","created":"2023-10-25","cited_by_count":3,"area":null},{"id":"2401.03540","title":"SeTformer is What You Need for Vision and Language","created":"2024-01-07","cited_by_count":3,"area":null},{"id":"2205.15068","title":"Embedding Graphs on Grassmann Manifold","created":"2022-05-30","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":"2306.05553","title":"Equivariant vs. Invariant Layers: A Comparison of Backbone and Pooling for Point Cloud Classification","created":"2023-06-08","cited_by_count":2,"area":null},{"id":"2506.02203","title":"Constrained Sliced Wasserstein Embedding","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2604.15114","title":"Amortized Optimal Transport from Sliced Potentials","created":"2026-04-16","cited_by_count":2,"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.07580","title":"Fisher Information Embedding for Node and Graph Learning","created":"2023-05-12","cited_by_count":1,"area":null},{"id":"2308.09228","title":"Generalized Sum Pooling for Metric Learning","created":"2023-08-18","cited_by_count":1,"area":null},{"id":"2401.13913","title":"Spectral Clustering for Discrete Distributions","created":"2024-01-25","cited_by_count":1,"area":null},{"id":"2410.16669","title":"Linear Partial Gromov-Wasserstein Embedding","created":"2024-10-22","cited_by_count":1,"area":null},{"id":"2503.15853","title":"Network Embedding Exploration Tool (NEExT)","created":"2025-03-20","cited_by_count":1,"area":null},{"id":"2506.05577","title":"Policy Search, Retrieval, and Composition via Task Similarity in Collaborative Agentic Systems","created":"2025-06-05","cited_by_count":1,"area":"agents"},{"id":"2603.02025","title":"Revealing Combinatorial Reasoning of GNNs via Graph Concept Bottleneck Layer","created":"2026-03-02","cited_by_count":1,"area":"lr"},{"id":"2112.09990","title":"FlowPool: Pooling Graph Representations with Wasserstein Gradient Flows","created":"2021-12-18","cited_by_count":0,"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":"2204.12300","title":"Unified GCNs: Towards Connecting GCNs with CNNs","created":"2022-04-26","cited_by_count":0,"area":null},{"id":"2210.07401","title":"Estimation of the Sample Frechet Mean: A Convolutional Neural Network Approach","created":"2022-10-13","cited_by_count":0,"area":null},{"id":"2302.10692","title":"On Inductive Biases for Machine Learning in Data Constrained Settings","created":"2023-02-21","cited_by_count":0,"area":null},{"id":"2303.01590","title":"Technical report: Graph Neural Networks go Grammatical","created":"2023-03-02","cited_by_count":0,"area":null},{"id":"2310.16123","title":"Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems","created":"2023-10-24","cited_by_count":0,"area":null},{"id":"2407.21609","title":"Ironing the Graphs: Toward a Correct Geometric Analysis of Large-Scale Graphs","created":"2024-07-31","cited_by_count":0,"area":null},{"id":"2409.08580","title":"Molecular Graph Representation Learning via Structural Similarity Information","created":"2024-09-13","cited_by_count":0,"area":null},{"id":"2503.14357","title":"Wasserstein-based Kernel Principal Component Analysis for Clustering Applications","created":"2025-03-18","cited_by_count":0,"area":null},{"id":"2504.17740","title":"Embedding Empirical Distributions for Computing Optimal Transport Maps","created":"2025-04-24","cited_by_count":0,"area":null},{"id":"2505.07575","title":"Personalized Federated Learning under Model Dissimilarity Constraints","created":"2025-05-12","cited_by_count":0,"area":null},{"id":"2506.09682","title":"Wasserstein Hypergraph Neural Network","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2509.16379","title":"EMPEROR: Efficient Moment-Preserving Representation of Distributions","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2511.09801","title":"Generalized infinite dimensional Alpha-Procrustes based geometries","created":"2025-11-12","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}],"next_cursor":null}