GiulsLu / Sinkhorn-Barycenters

Related projects: ⓘ

• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆55Updated 6 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆21Updated 2 years ago
• hichamjanati / debiased-ot-barycenters
  ☆23Updated 3 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆27Updated 5 years ago
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆20Updated 4 years ago
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆28Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆26Updated 4 years ago
• 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…
  ☆20Updated 4 years ago
• maremun / swg
  Sliced Wasserstein Generator
  ☆23Updated 5 years ago
• GiulsLu / OT-gradients
  ☆11Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆55Updated 3 years ago
• meyerscetbon / LinearSinkhorn
  ☆16Updated 3 years ago
• cunningham-lab / igr
  ☆31Updated 3 years ago
• RuntianZ / doro
  Distributional and Outlier Robust Optimization (ICML 2021)
  ☆27Updated 3 years ago
• xieyujia / IPOT
  Implementation of Inexact Proximal point method for Optimal Transport
  ☆45Updated 3 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆65Updated 4 years ago
• ykwon0407 / wdro_local_perturbation
  Principled learning method for Wasserstein distributionally robust optimization with local perturbations (ICML 2020)
  ☆22Updated last year
• justkolesov / Wasserstein1Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).
  ☆19Updated last week
• lorraine2 / implicit-hyper-opt
  ☆35Updated this week
• Landmine598 / OT-DA
  ☆13Updated 4 years ago
• ermongroup / f-dre
  Featurized Density Ratio Estimation
  ☆19Updated 3 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 4 years ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆40Updated last year
• kimiandj / gsw
  ☆39Updated 4 years ago
• fengliu90 / DK-for-TST
  This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).
  ☆46Updated 3 years ago
• jshe / wasserstein-2
  ☆13Updated 5 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 3 years ago
• locuslab / monotone_op_net
  Monotone operator equilibrium networks
  ☆51Updated 4 years ago
• JasonAltschuler / OptimalTransportNIPS17
  Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…
  ☆30Updated 6 years ago
• avirmaux / lipEstimation
  ☆56Updated last year