Alternatives and similar repositories for topologicalUncertainty

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

• ximenafernandez / intrinsicPH
  This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'
  ☆10Updated 2 years ago
• Pseudomanifold / pyper
  Python-based persistent homology algorithms
  ☆19Updated 2 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 5 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆25Updated 3 years ago
• federicobergamin / riemannian-laplace-approximation
  Repository for the paper "Riemannian Laplace approximations for Bayesian neural networks"
  ☆12Updated 2 years ago
• cscarv / riemannian-metric-learning-ot
  ☆18Updated 2 years ago
• c-hofer / torchph
  The essence of my research, distilled for reusability. Enjoy 🥃!
  ☆74Updated last year
• IlyaTrofimov / MTopDiv
  [NeurIPS 2021] Manifold Topology Divergence: a Framework for Comparing Data Manifolds
  ☆15Updated 3 years ago
• azlawson / PersistenceCurves
  A python package for computing Persistence Curves
  ☆19Updated 4 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• haguettaz / ChebLieNet
  ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.
  ☆14Updated last year
• aidos-lab / dect-evaluation
  Differentiable Euler Characteristic Transform
  ☆17Updated last year
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 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
• topnn / topnn_framework
  ☆35Updated 4 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• tijana-zrnic / active-inference
  ☆18Updated last year
• Genentech / nodags-flows
  ☆11Updated 4 months ago
• ngruver / lie-deriv
  ☆39Updated 3 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆153Updated 3 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆22Updated 2 years ago
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆17Updated 2 years ago
• spbu-math-cs / Graph-Gaussian-Processes
  Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".
  ☆53Updated last month
• IlyaTrofimov / RTD
  [ICML 2022] Representation Topology Divergence: A Method for Comparing Neural Network Representations
  ☆25Updated 3 years ago
• facebookresearch / w2ot
  Euclidean Wasserstein-2 optimal transportation
  ☆47Updated 2 years ago
• tml-epfl / sgd-sparse-features
  SGD with large step sizes learns sparse features [ICML 2023]
  ☆33Updated 2 years ago
• CharlotteMagister / GCExplainer
  ☆19Updated last year
• OliverVipond / Multiparameter_Persistence_Landscapes
  Python functions to compute multiparameter persistence landscapes from a RIVET file
  ☆14Updated last year