edoliberty / frequent-directions-experimentsLinks
Contains matrix sketching algorithms in python
☆16Updated 3 years ago
Alternatives and similar repositories for frequent-directions-experiments
Users that are interested in frequent-directions-experiments are comparing it to the libraries listed below
Sorting:
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- [Code] Deep Multi-task Representation Learning: A Tensor Factorisation Approach☆58Updated 8 years ago
- Feature Interaction Interpretability via Interaction Detection☆35Updated 2 years ago
- Stochastic training of graph convolutional networks☆84Updated 3 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 6 years ago
- ☆43Updated 7 years ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated 2 years ago
- Implementations of "Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks"☆53Updated last year
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆74Updated 8 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- ☆13Updated 4 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Python code for implementing embeddings in the Wasserstein space of elliptical distributions☆11Updated 5 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 6 years ago
- Implementation for "Classification from Pairwise Similarity and Unlabeled Data"☆27Updated 5 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- PyTorch implementation for the paper Classification from Positive, Unlabeled and Biased Negative Data.☆19Updated last year
- Adversarial learning by utilizing model interpretation☆10Updated 6 years ago
- ☆44Updated 5 years ago
- Measuring and Improving the Use of Graph Information in Graph Neural Networks☆83Updated last year
- Adaptive Neural Trees☆155Updated 6 years ago
- ☆39Updated 2 years ago
- Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".☆25Updated 5 years ago
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019☆141Updated 5 years ago
- [ICML 2021] Information Obfuscation of Graph Neural Networks☆36Updated 4 years ago
- The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.☆12Updated 7 years ago