Alternatives and similar repositories for WTK

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

• mtsang / interaction_interpretability
  Feature Interaction Interpretability via Interaction Detection
  ☆34Updated 2 years ago
• googleinterns / local_global_ts_representation
  ☆22Updated 3 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• tailintalent / causal
  Discovering directional relations via minimum predictive information regularization
  ☆24Updated 5 years ago
• sfme / RVAE_MixedTypes
  Repository for code release of paper "Robust Variational Autoencoders for Outlier Detection and Repair of Mixed-Type Data" (AISTATS 2020)
  ☆50Updated 5 years ago
• sudiptodip15 / CCMI
  Classifier based mutual information, conditional mutual information estimation; conditional independence testing
  ☆34Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• sjblim / rmsn_nips_2018
  ☆39Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• is0383kk / Dirichlet-VAE
  Dirichlet-Variational Auto-Encoder by PyTorch
  ☆22Updated 2 years ago
• MLforHealth / ClinicalDG
  An Empirical Framework for Domain Generalization In Clinical Settings
  ☆30Updated 3 years ago
• jsyoon0823 / Clairvoyance
  Codebase for "Clairvoyance: a Unified, End-to-End AutoML Pipeline for Medical Time Series"
  ☆13Updated 4 years ago
• mrojascarulla / causal_transfer_learning
  ☆32Updated 6 years ago
• microsoft / EDDI
  Code for paper EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAE
  ☆40Updated 2 years ago
• xiaoshuai09 / Wasserstein-Learning-For-Point-Process
  learning point processes by means of optimal transport and wasserstein distance
  ☆54Updated 7 years ago
• hmorioka / TCL
  Time-Contrastive Learning
  ☆65Updated 7 years ago
• blei-lab / ars-reparameterization
  Source code for Naesseth et. al. "Reparameterization Gradients through Acceptance-Rejection Sampling Algorithms" (2017)
  ☆39Updated 8 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated last year
• hichamjanati / spatio-temporal-alignements
  Spatio-temporal alignements: Optimal transport in space and time
  ☆47Updated 2 months ago
• steveli / partial-encoder-decoder
  An encoder-decoder framework for learning from incomplete data
  ☆45Updated last year
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated 2 years ago
• microsoft / VAEM
  Sample code for VAEM: a Deep Generative Model for Heterogeneous Mixed Type Data
  ☆14Updated 4 years ago
• diviyank / SAM
  Code for the Structural Agnostic Model (https://arxiv.org/abs/1803.04929)
  ☆52Updated 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…
  ☆20Updated 5 years ago
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆48Updated 7 years ago
• samcohen16 / Aligning-Time-Series
  ☆51Updated 11 months ago
• aripakman / neural_clustering_process
  Implementation of the Neural Clustering Process algorithm in Pytorch
  ☆31Updated 4 years ago
• siplab-gt / generative-causal-explanations
  Code for "Generative causal explanations of black-box classifiers"
  ☆34Updated 4 years ago