tlacombe / topologicalUncertaintyLinks
☆11Updated 3 years ago
Alternatives and similar repositories for topologicalUncertainty
Users that are interested in topologicalUncertainty are comparing it to the libraries listed below
Sorting:
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 3 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Python-based persistent homology algorithms☆19Updated last year
- [ICML 2021] Kernel Continual Learning☆7Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Repository for the paper "Riemannian Laplace approximations for Bayesian neural networks"☆11Updated last year
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated last year
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆10Updated 2 years ago
- [NeurIPS 2021] Manifold Topology Divergence: a Framework for Comparing Data Manifolds☆13Updated 3 years ago
- SGD with large step sizes learns sparse features [ICML 2023]☆32Updated 2 years ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆10Updated 10 months ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 3 years ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆35Updated last year
- Supporing code for the paper "Bayesian Model Selection, the Marginal Likelihood, and Generalization".☆36Updated 3 years ago
- A python package for computing Persistence Curves☆19Updated 3 years ago
- ☆17Updated 2 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆20Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- The essence of my research, distilled for reusability. Enjoy 🥃!☆67Updated 11 months ago
- GitHub repository for the ICLR Computational Geometry & Topology Challenge 2021☆51Updated 3 years ago
- GitHub repository for the ICLR Computational Geometry & Topology Challenge 2021☆50Updated 2 years ago
- ☆11Updated last year
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- [ICML 2022] Representation Topology Divergence: A Method for Comparing Neural Network Representations☆22Updated 2 years ago
- Fast Topological Clustering with Wasserstein Distance (ICLR 2022)☆11Updated 3 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 5 years ago
- Pytorch implementation of VAEs for heterogeneous likelihoods.☆42Updated 2 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆150Updated 3 years ago