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:
- Feature Interaction Interpretability via Interaction Detection☆35Updated 2 years ago
- [Code] Deep Multi-task Representation Learning: A Tensor Factorisation Approach☆58Updated 8 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆74Updated 8 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 6 years ago
- Implementation for "Classification from Pairwise Similarity and Unlabeled Data"☆27Updated 5 years ago
- ☆13Updated 5 years ago
- Software relating to relational empirical risk minimization☆17Updated 4 years ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated 3 years ago
- Implementations of label propagation like algorithms☆82Updated 9 years ago
- Code for the paper "Tensor Regression Networks with various Low-Rank Tensor Approximations"☆35Updated 8 years ago
- PyTorch implementation for the paper Classification from Positive, Unlabeled and Biased Negative Data.☆19Updated 2 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 7 years ago
- Source code of the neural Hawkes particle smoothing (ICML 2019)☆44Updated 6 years ago
- Implementation of Deep Soft-K means☆29Updated 4 years ago
- Implementations of "Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks"☆53Updated last year
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- A sparsity aware implementation of "Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection" (CIKM 2018).☆207Updated 2 years ago
- This repository is an attempt to replicate the results for the paper: "Learning Deep Representations for Graph Clustering".☆21Updated 8 years ago
- PyTorch implementation of nonsymmetric determinantal point process (DPP) learning.☆25Updated 2 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 6 years ago
- ☆103Updated 7 years ago
- Stochastic training of graph convolutional networks☆84Updated 3 years ago
- Semi supervised learning on graphs☆35Updated 8 years ago
- A PyTorch implementation of Ranking Distillation☆90Updated 5 years ago
- This is all the codes used in "Large Scale Online Kernel Learning"☆11Updated 8 years ago
- This repository contains the source code and data for reproducing results of Deep Continuous Clustering paper☆215Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Experiments with binary LSTM using gumbel-sigmoid☆32Updated 5 years ago
- Determinantal point process☆18Updated 10 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago