Alternatives and similar repositories for Relational-AutoEncoders

Users that are interested in Relational-AutoEncoders are comparing it to the libraries listed below

• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆21Updated 5 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆100Updated 2 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆56Updated 3 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆103Updated 6 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• oskopek / mvae
  Mixed-curvature Variational Autoencoders (ICLR 2020)
  ☆62Updated 4 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 6 years ago
• mori97 / VaDE
  A PyTorch Implementation of VaDE(https://arxiv.org/pdf/1611.05148.pdf)
  ☆39Updated 4 years ago
• anonymous-iclr-2019 / acai-iclr-2019
  Anonymized code for ICLR 2019 submission "Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer"
  ☆20Updated 6 years ago
• claying / OTK
  A Pytorch implementation of the optimal transport kernel embedding
  ☆117Updated 4 years ago
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆59Updated 3 years ago
• vislearn / GIN
  Code for the paper "Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)" (2020)
  ☆32Updated 3 years ago
• 1Konny / WAE-pytorch
  ☆68Updated 6 years ago
• junhocho / HGCAE
  HGCAE Pytorch implementation. CVPR2021 accepted.
  ☆44Updated last year
• fpcasale / GPPVAE
  Gaussian Process Prior Variational Autoencoder
  ☆84Updated 6 years ago
• ngoc-nguyen-0 / DGG
  Linxiao Yang, Ngai-Man Cheung, Jiaying Li, and Jun Fang, "Deep Clustering by Gaussian Mixture Variational Autoencoders with Graph Embeddi…
  ☆53Updated 5 years ago
• kilianFatras / JUMBOT
  Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"
  ☆46Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• kimiandj / gsw
  ☆40Updated 5 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆41Updated 2 years ago
• xwshen51 / DEAR
  Disentangled gEnerative cAusal Representation (DEAR)
  ☆60Updated 2 years ago
• alexlyzhov / latent-subspaces
  Implementation of "Learning latent subspaces in variational autoencoders"
  ☆20Updated 5 years ago