Alternatives and similar repositories for OTML_course_2022:

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

• khainb / Mini-batch-OT
  A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…
  ☆37Updated 2 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• 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
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• HongtengXu / Reading-List
  A list of papers for group meeting
  ☆16Updated 4 months ago
• volagold / nce
  Noise Contrastive Estimation (NCE) in PyTorch
  ☆32Updated 2 months ago
• ppope / explain_graphs
  Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …
  ☆34Updated last month
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• Landmine598 / OT-DA
  ☆14Updated 4 years ago
• oscarkey / explanations-by-minimizing-uncertainty
  Code for "Generating Interpretable Counterfactual Explanations By Implicit Minimisation of Epistemic and Aleatoric Uncertainties"
  ☆18Updated 3 years ago
• kimiandj / gsw
  ☆39Updated 5 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• meyerscetbon / LOT
  ☆17Updated 2 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆23Updated 2 years ago
• hans66hsu / GATS
  Source code of "What Makes Graph Neural Networks Miscalibrated?" (NeurIPS 2022)
  ☆23Updated last year
• jw9730 / ehnn
  [ECCV'22] Equivariant Hypergraph Neural Networks, in PyTorch
  ☆30Updated 2 years ago
• ahujak / IB-IRM
  ☆30Updated 3 years ago
• namratadeka / circe
  Efficient Conditionally Invariant Representation Learning (ICLR 2023, Oral)
  ☆21Updated 2 years ago
• VinAIResearch / DSW
  Distributional Sliced-Wasserstein distance code
  ☆49Updated 9 months ago
• LJSthu / Kernelized-HRM
  The code for our NeurIPS 2021 paper "Kernelized Heterogeneous Risk Minimization".
  ☆12Updated 3 years ago
• xu-ji / information-bottleneck
  Deep Learning & Information Bottleneck
  ☆60Updated last year
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• LFhase / PAIR
  [ICLR 2023, ICLR DG oral] PAIR, the optimizer and model selection criteria for OOD Generalization
  ☆53Updated last year
• clbonet / Spherical_Sliced-Wasserstein
  Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"
  ☆13Updated last year
• hedixia / HeavyBallNODE
  ☆13Updated 3 years ago
• tqch / poisson-jump
  Official Implementation of Paper "Learning to Jump: Thinning and Thickening Latent Counts for Generative Modeling" (ICML 2023)
  ☆10Updated last year
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆22Updated 5 years ago