Alternatives and similar repositories for sparse_smoothing

Users that are interested in sparse_smoothing are comparing it to the libraries listed below

• danielzuegner / robust-gcn
  Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".
  ☆43Updated 4 years ago
• abojchevski / node_embedding_attack
  Adversarial Attacks on Node Embeddings via Graph Poisoning
  ☆59Updated 5 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• devnkong / FLAG
  Official implementation of our FLAG paper (CVPR2022)
  ☆145Updated 3 years ago
• vikasverma1077 / GraphMix
  Code for reproducing results in GraphMix paper
  ☆72Updated 2 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆53Updated 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆83Updated 11 months ago
• AaltoPML / Rethinking-pooling-in-GNNs
  ☆62Updated 4 years ago
• tech-srl / bottleneck
  Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"
  ☆95Updated 3 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 6 years ago
• lukasjf / contrastive-gnn-explanation
  ☆19Updated 2 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• danielzuegner / gnn-meta-attack
  Implementation of the paper "Adversarial Attacks on Graph Neural Networks via Meta Learning".
  ☆150Updated 3 years ago
• SwiftieH / IGNN
  Implicit Graph Neural Networks
  ☆62Updated 3 years ago
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆24Updated 6 years ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆25Updated 4 years ago
• sigeisler / robustness_of_gnns_at_scale
  This repository contains the official implementation of the paper "Robustness of Graph Neural Networks at Scale" (NeurIPS, 2021).
  ☆30Updated 2 years ago
• se-ok / WLsimilarity
  informal exposition of Weisfeiler-Leman similarity
  ☆28Updated 4 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• THUDM / grb
  Graph Robustness Benchmark: A scalable, unified, modular, and reproducible benchmark for evaluating the adversarial robustness of Graph M…
  ☆95Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• claying / GCKN
  Pytorch Implementation of Graph Convolutional Kernel Networks
  ☆54Updated 2 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• leichen2018 / GNN-Substructure-Counting
  The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020
  ☆34Updated 4 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆37Updated 4 years ago
• lxiaorui / ElasticGNN
  Official implementation of the ICML2021 paper "Elastic Graph Neural Networks"
  ☆42Updated 4 years ago
• tangxianfeng / PA-GNN
  Implementation of paper "Transferring Robustness for Graph Neural Network Against Poisoning Attacks".
  ☆20Updated 5 years ago