edoliberty / frequent-directions
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
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 5 years ago
- ☆12Updated 4 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Poincaré Embedding☆40Updated 7 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆20Updated 6 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago
- A recreation of the Lorentz embeddings paper from ICML 2018 (Nickel 2018)☆19Updated 6 years ago
- Embed arbitrary graphs in Hyperbolic space☆75Updated 3 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 5 years ago
- LP-SparseMAP: Differentiable sparse structured prediction in coarse factor graphs☆41Updated last year
- Contains matrix sketching algorithms in python☆16Updated 2 years ago
- A supplementary code for Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs.☆47Updated 5 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- Hyperbolic (Poincare, Lorentz) Embeddings for TensorFlow☆55Updated 6 years ago
- ☆75Updated 7 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 6 years ago
- Software relating to relational empirical risk minimization☆17Updated 3 years ago
- [ NeurIPS '22 ] Data distillation for recommender systems. Shows equivalent performance with 2-3 orders less data.☆23Updated last year
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- ☆20Updated 7 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- A thorough review of the paper "Learning Embeddings into Entropic Wasserstein Spaces" by Frogner et al. Includes a reproduction of the re…☆22Updated 5 years ago
- ☆15Updated 6 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- PyTorch Flexible Hash Embeddings☆28Updated 5 years ago
- Lua implementation of Entropy-SGD☆81Updated 6 years ago
- Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…☆15Updated 10 years ago
- NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.☆63Updated 6 years ago