ks-korovina / pgm_graph_inference

Related projects: ⓘ

• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆15Updated 3 years ago
• cvignac / SMP
  ☆25Updated 2 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆38Updated 10 months ago
• jkuck / BPNN
  ☆21Updated 3 years ago
• fychen32 / MolHGCN
  ☆14Updated this week
• vgsatorras / hybrid-inference
  ☆23Updated 4 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆30Updated 3 years ago
• karlstratos / doe
  Difference-of-Entropies (DoE) Estimator
  ☆24Updated 2 years ago
• anvinhnguyendinh / InferencePGMbyGNN
  A Tensorflow implementation of the paper https://arxiv.org/pdf/1803.07710.pdf
  ☆14Updated 5 years ago
• alelab-upenn / graph-scattering-transforms
  Code for experimentation on graph scattering transforms
  ☆26Updated 4 years ago
• HarlinLee / nonconvex-GTF-public
  Code for nonconvex graph trend filtering
  ☆10Updated 2 years ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆23Updated 4 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆27Updated 5 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆23Updated last year
• lifeitech / nce
  Noise Contrastive Estimation (NCE) in PyTorch
  ☆30Updated 10 months ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 4 years ago
• balcilar / Spectral-Designed-Graph-Convolutions
  Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper
  ☆48Updated 3 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 3 years ago
• VITA-Group / L2O-Minimax
  [ICLR 2021] "Learning a Minimax Optimizer: A Pilot Study" by Jiayi Shen*, Xiaohan Chen*, Howard Heaton*, Tianlong Chen, Jialin Liu, Wotao…
  ☆15Updated 2 years ago
• IssamLaradji / BlockCoordinateDescent
  Code for the paper "Let’s Make Block Coordinate Descent Go Fast"
  ☆44Updated last year
• VITA-Group / L2O-Training-Techniques
  [NeurIPS 2020 Spotlight Oral] "Training Stronger Baselines for Learning to Optimize", Tianlong Chen*, Weiyi Zhang*, Jingyang Zhou, Shiyu …
  ☆26Updated 2 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆21Updated 4 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 2 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆53Updated 2 years ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆24Updated 3 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 4 years ago
• saleml / continuous-gfn
  ☆19Updated last year