Alternatives and similar repositories for deep_matrix_factorization:

Users that are interested in deep_matrix_factorization are comparing it to the libraries listed below

• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• tonyabracadabra / Deep-Subspace-Clustering
  Subspace clustering through the deep learning approach
  ☆22Updated 8 years ago
• maremun / swg
  Sliced Wasserstein Generator
  ☆23Updated 6 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆67Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆54Updated 3 years ago
• mikigom / large-scale-OT-mapping-TF
  Tensorflow Implementation of "Large-scale Optimal Transport and Mapping Estimation"(ICLR2018/NIPS 2017 OTML)
  ☆19Updated 6 years ago
• thalitadru / LDMnet-pytorch
  Implementation of LDMnet in pytorch
  ☆22Updated 6 years ago
• MarkMoHR / TF-OT-Sinkhorn
  Tensorflow implementation of optimal transport (OT) with Sinkhorn algorithm.
  ☆19Updated 5 years ago
• JasonAltschuler / OptimalTransportNIPS17
  Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…
  ☆31Updated 7 years ago
• dilinwang820 / nonlinear_svgd
  Nonlinear SVGD for Learning Diversified Mixture Models
  ☆13Updated 6 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆101Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• anonymous003784 / Multi-View-Information-Bottleneck
  ☆10Updated 5 years ago
• mzalaya / screenkhorn
  Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"
  ☆10Updated 5 years ago
• skolouri / swgmm
  Sliced Wasserstein Distance for Learning Gaussian Mixture Models
  ☆62Updated last year
• kimiandj / gsw
  ☆39Updated 5 years ago
• kunzhan / MTGCN
  FGCS 2021: Mutual teaching for graph convolutional networks
  ☆15Updated 4 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆51Updated 4 years ago
• CW-Huang / HIWAE
  code for hierarchical importance weighted autoencoders
  ☆11Updated 5 years ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆42Updated 2 years ago
• aditya-grover / uae
  Uncertainty Autoencoders, AISTATS 2019
  ☆55Updated 5 years ago
• sharonFogel / CPAC
  Pytorch implementation of our article "Clustering-driven Deep Embedding with Pairwise Constraints"
  ☆27Updated 6 years ago
• ermongroup / f-dre
  Featurized Density Ratio Estimation
  ☆20Updated 3 years ago
• mingzhang-yin / ARM-gradient
  Low-variance, efficient and unbiased gradient estimation for optimizing models with binary latent variables. (ICLR 2019)
  ☆28Updated 5 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• dcmoyer / inv-rep
  Code for Invariant Rep. Without Adversaries (NIPS 2018)
  ☆35Updated 5 years ago
• hyqneuron / dsc_gan
  Deep Subspace Clustering + GAN
  ☆23Updated 7 years ago