Alternatives and similar repositories for wsingular:

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

• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆23Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• meyerscetbon / LOT
  ☆17Updated 2 years ago
• clbonet / Spherical_Sliced-Wasserstein
  Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"
  ☆13Updated last year
• singlasahil14 / SOC
  Code for the ICML 2021 and ICLR 2022 papers: Skew Orthogonal Convolutions, Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100
  ☆18Updated 3 years ago
• mmderakhshani / KCL
  [ICML 2021] Kernel Continual Learning
  ☆7Updated 3 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆15Updated 3 years ago
• 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
• cscarv / riemannian-metric-learning-ot
  ☆17Updated last year
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• PythonOT / OTML_course_2022
  ☆10Updated 2 years ago
• MinaGhadimiAtigh / Hyperbolic-Busemann-Learning
  Hyperbolic Busemann Learning with Ideal Prototypes, NeurIPS2021
  ☆24Updated 3 years ago
• Newbeeer / orthogonal_classifier
  Code for ICLR 2022 Paper, "Controlling Directions Orthogonal to a Classifier"
  ☆34Updated last year
• mfederici / dsit
  Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"
  ☆25Updated 3 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• mzalaya / screenkhorn
  Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"
  ☆10Updated 5 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆40Updated last year
• ExplainableML / NonIsotropicProxyDML
  This repository contains the code for our CVPR 2022 paper on "Non-isotropy Regularization for Proxy-based Deep Metric Learning".
  ☆14Updated last year
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated last year
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆41Updated 2 years ago
• igeood / Igeood
  Anonymized code for Igeood: An Information Geometry Approach to Out-of-Distribution Detection
  ☆12Updated 3 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆32Updated 4 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• tolgabirdal / PHDimGeneralization
  Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.
  ☆31Updated 3 years ago
• YuGuangWang / HaarPool
  PyTorch Codes for Haar Graph Pooling
  ☆11Updated 2 years ago
• ExplainableML / Probabilistic_Deep_Metric_Learning
  This repository contains the code for our ECCV 2022 paper on our "Non-isotropic Probabilistic Take on Proxy-based Deep Metric Learning".
  ☆11Updated 2 years ago
• GT-RIPL / Geometric-Sensitivity-Decomposition
  ☆18Updated 3 years ago
• nerdslab / latentOT
  Latent optimal transport (LOT) for low rank transport and clustering
  ☆19Updated 3 years ago
• tkasarla / max-separation-as-inductive-bias
  Github code for the paper Maximum Class Separation as Inductive Bias in One Matrix. Arxiv link: https://arxiv.org/abs/2206.08704
  ☆28Updated last year