edoliberty / frequent-directions-experiments
Contains matrix sketching algorithms in python
☆16Updated 2 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
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 4 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- ☆39Updated 12 years ago
- This is all the codes used in "Large Scale Online Kernel Learning"☆11Updated 7 years ago
- Stochastic training of graph convolutional networks☆85Updated 2 years ago
- ☆8Updated 7 years ago
- TensorFlow implementation of Deep Graph Infomax☆63Updated 6 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆73Updated 7 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated last year
- Net2Net implementation on PyTorch for any possible vision layers.☆38Updated 7 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- ☆24Updated 5 years ago
- Implementations of label propagation like algorithms☆82Updated 8 years ago
- TAMU HELIOS Group PyTen Package☆14Updated 6 years ago
- Code for Implicit Regularization in Deep Matrix Factorization.☆33Updated 6 months ago
- ☆13Updated 6 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆51Updated 4 years ago
- Implementation of Deep Soft-K means☆28Updated 3 years ago
- Experiments with binary LSTM using gumbel-sigmoid☆30Updated 4 years ago
- PyTorch implementation of nonsymmetric determinantal point process (DPP) learning.☆24Updated last year
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- ☆42Updated 6 years ago
- This is a sample implementation of "Billion-scale Network Embedding with Iterative Random Projection" (ICDM 2018).☆18Updated 4 years ago
- Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds (2018, https://arxiv.org/abs/1805.06299)☆11Updated 5 years ago
- Active Learning for Graph Embedding☆32Updated 7 years ago
- Poincaré Embedding☆40Updated 7 years ago
- A Python implementation of Kernel Mean Matching data reweighting algorithm☆33Updated 9 years ago
- Python code for implementing embeddings in the Wasserstein space of elliptical distributions☆11Updated 4 years ago
- ☆14Updated 6 years ago