Alternatives and similar repositories for topologicalUncertainty

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

• Pseudomanifold / pyper
  Python-based persistent homology algorithms
  ☆19Updated 2 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆24Updated 3 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆20Updated 2 years ago
• ximenafernandez / intrinsicPH
  This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'
  ☆10Updated 2 years ago
• IlyaTrofimov / RTD
  [ICML 2022] Representation Topology Divergence: A Method for Comparing Neural Network Representations
  ☆23Updated 3 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• IlyaTrofimov / MTopDiv
  [NeurIPS 2021] Manifold Topology Divergence: a Framework for Comparing Data Manifolds
  ☆15Updated 3 years ago
• topolearn / topo-clustering
  Fast Topological Clustering with Wasserstein Distance (ICLR 2022)
  ☆12Updated 3 years ago
• federicobergamin / riemannian-laplace-approximation
  Repository for the paper "Riemannian Laplace approximations for Bayesian neural networks"
  ☆11Updated last year
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• CSDUlm / wsingular
  Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".
  ☆10Updated 11 months ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• BorgwardtLab / ggme
  Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…
  ☆14Updated 3 years ago
• justkolesov / Wasserstein1Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).
  ☆21Updated 11 months ago
• Sanaelotfi / Bayesian_model_comparison
  Supporing code for the paper "Bayesian Model Selection, the Marginal Likelihood, and Generalization".
  ☆36Updated 3 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated 2 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 5 years ago
• cambridge-mlg / CLUE
  Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"
  ☆36Updated last year
• ngruver / lie-deriv
  ☆38Updated 2 years ago
• azlawson / PersistenceCurves
  A python package for computing Persistence Curves
  ☆19Updated 3 years ago
• haguettaz / ChebLieNet
  ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.
  ☆14Updated last year
• tml-epfl / sgd-sparse-features
  SGD with large step sizes learns sparse features [ICML 2023]
  ☆33Updated 2 years ago
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 4 years ago
• ahmedmalaa / evaluating-generative-models
  ☆21Updated 2 years ago
• c-hofer / torchph
  The essence of my research, distilled for reusability. Enjoy 🥃!
  ☆69Updated last year
• ggoh29 / Simplicial-neural-network-benchmark
  Simplicial neural network benchmarking software
  ☆17Updated 3 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• danchern97 / RTD_AE
  This is an official repository for "Learning topology-preserving data representations" presented at ICLR 2023 conference.
  ☆33Updated 2 years ago
• adrianjav / heterogeneous_vaes
  Pytorch implementation of VAEs for heterogeneous likelihoods.
  ☆42Updated 2 years ago