Alternatives and similar repositories for frequent-directions:

Users that are interested in frequent-directions are comparing it to the libraries listed below

• locuslab / sdp_clustering
  ☆12Updated 4 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆44Updated 5 years ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆74Updated 3 years ago
• qiangsiwei / poincare_embedding
  Poincaré Embedding
  ☆40Updated 7 years ago
• timvieira / hypergraphs
  Reference implementations of basic and advanced hypergraph algorithms.
  ☆47Updated last year
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• pemami4911 / sinkhorn-policy-gradient.pytorch
  Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"
  ☆39Updated 6 years ago
• wouterkool / ancestral-gumbel-top-k-sampling
  Ancestral Gumbel-Top-k Sampling
  ☆22Updated 4 years ago
• dicai / pygraphon
  Python library for working with graphons
  ☆22Updated 7 years ago
• mblondel / projection-losses
  Python implementation of projection losses.
  ☆25Updated 5 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆81Updated 6 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆72Updated 4 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• mahito-sugiyama / Legendre-decomposition
  Legendre decomposition for tensors
  ☆13Updated 6 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆21Updated 4 years ago
• matthieuheitz / WassersteinDictionaryLearning
  Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…
  ☆18Updated 5 years ago
• FurongHuang / TensorDecomposition4TopicModeling
  ☆20Updated 7 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆60Updated 3 years ago
• edoliberty / frequent-directions-experiments
  Contains matrix sketching algorithms in python
  ☆16Updated 2 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• stanis-morozov / prodige
  A supplementary code for Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs.
  ☆47Updated 5 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• BorisMuzellec / EllipticalEmbeddings
  Python code for implementing embeddings in the Wasserstein space of elliptical distributions
  ☆11Updated 4 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆57Updated 3 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 6 years ago
• cshjin / gnn_in_neurips_2019
  A comprehensive collection of GNN works in NeurIPS 2019.
  ☆21Updated 5 years ago