delta2323 / gnn-asymptotics
Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
☆30Updated 4 years ago
Alternatives and similar repositories for gnn-asymptotics:
Users that are interested in gnn-asymptotics are comparing it to the libraries listed below
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- ☆35Updated 5 years ago
- Source code for PairNorm (ICLR 2020)☆76Updated 5 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- ☆45Updated 4 years ago
- ☆27Updated 3 years ago
- ☆30Updated last year
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- code for the paper in NeurIPS 2019☆40Updated 2 years ago
- Measuring and Improving the Use of Graph Information in Graph Neural Networks☆82Updated 8 months ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)☆34Updated 3 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- ☆62Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆42Updated 2 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"☆94Updated 2 years ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆19Updated 2 years ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆51Updated 4 years ago
- Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".☆43Updated 4 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆45Updated 4 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆58Updated 4 years ago
- ☆25Updated 3 years ago