TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
☆16Updated 4 years ago
Alternatives and similar repositories for A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening:
Users that are interested in A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening are comparing it to the libraries listed below
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 3 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- ☆26Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 6 months ago
- ☆25Updated 3 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- A Note On Over-Smoothing for Graph Neural Network☆19Updated 4 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 4 years ago
- ☆56Updated 3 years ago
- Source code for PairNorm (ICLR 2020)☆76Updated 4 years ago
- Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"☆94Updated 2 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Gradient gating (ICLR 2023)☆53Updated last year
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- [ICLR 2023] Link Prediction with Non-Contrastive Learning☆26Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)☆34Updated 3 years ago
- ☆30Updated last year
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- ☆35Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- Papers about developing DL methods on disassortative graphs☆48Updated 2 years ago
- ☆62Updated 4 years ago