edoliberty / frequent-directions
Implements the frequent directions algorithm for approximating matrices in streams
☆32Updated 7 years ago
Related projects: ⓘ
- mixed membership stochastic block model☆13Updated 8 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆17Updated 4 years ago
- A recreation of the Lorentz embeddings paper from ICML 2018 (Nickel 2018)☆18Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆100Updated 4 years ago
- Official implementation (learning part) for paper: Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models☆18Updated last month
- Legendre decomposition for tensors☆12Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆70Updated 3 years ago
- NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.☆66Updated 5 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 5 years ago
- Efficient LSH-based kernel density estimation☆28Updated 4 years ago
- NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.☆62Updated 6 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 3 years ago
- Implementation of Hamiltonian Monte Carlo using Google's TensorFlow☆47Updated 8 years ago
- Off the convex path☆68Updated last year
- Contains matrix sketching algorithms in python☆16Updated 2 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆21Updated 6 years ago
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 5 years ago
- LP-SparseMAP: Differentiable sparse structured prediction in coarse factor graphs☆41Updated 10 months ago
- Embed arbitrary graphs in Hyperbolic space☆72Updated 2 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆44Updated 4 years ago
- Bayesian Poisson Tucker decomposition☆17Updated 7 years ago
- Code for density estimation with nonparametric cluster shapes.☆38Updated 8 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆19Updated 4 years ago
- Learning Tree structures and Tree metrics☆22Updated last month
- Poincaré Embedding☆40Updated 6 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆60Updated 3 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Graph kernels☆56Updated 2 years ago
- A Wasserstein Subsequence Kernel for Time Series.☆21Updated 3 months ago