edoliberty / frequent-directionsLinks
Implements the frequent directions algorithm for approximating matrices in streams
☆32Updated 7 years ago
Alternatives and similar repositories for frequent-directions
Users that are interested in frequent-directions are comparing it to the libraries listed below
Sorting:
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 6 years ago
- A comprehensive collection of GNN works in NeurIPS 2019.☆21Updated 5 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- Software relating to relational empirical risk minimization☆17Updated 3 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 7 years ago
- Official implementation (learning part) for paper: Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models☆18Updated 10 months ago
- ☆20Updated 7 years ago
- Graph kernels☆56Updated 3 years ago
- HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent☆33Updated 8 years ago
- Poincaré Embedding☆40Updated 7 years ago
- ☆12Updated 4 years ago
- Embed arbitrary graphs in Hyperbolic space☆74Updated 3 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- Off the convex path☆67Updated 2 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆38Updated 6 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆46Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- Code for the icml paper "zero inflated exponential family embedding"☆29Updated 7 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- gpbo☆25Updated 4 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago
- Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"☆39Updated 6 years ago
- ☆19Updated 7 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- ☆75Updated 7 years ago