layer6ai-labs / UoMH
☆10Updated last year
Alternatives and similar repositories for UoMH:
Users that are interested in UoMH are comparing it to the libraries listed below
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- ☆17Updated 2 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 3 years ago
- Code in support of the paper Continuous Mixtures of Tractable Probabilistic Models☆12Updated 6 months ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- Wrap around any model to output differentially private prediction sets with finite sample validity on any dataset.☆17Updated last year
- ☆17Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- ☆19Updated 4 years ago
- ☆17Updated 6 years ago
- We introduce a way to extend sparse dictionary learning to deep architectures.☆16Updated 3 years ago
- This is the code for the paper Jacobian-based Causal Discovery with Nonlinear ICA, demonstrating how identifiable representations (partic…☆18Updated 8 months ago
- Ultrahyperbolic Representation Learning☆12Updated 4 years ago
- Implementations of orthogonal and semi-orthogonal convolutions in the Fourier domain with applications to adversarial robustness☆44Updated 4 years ago
- DynGFN: Bayesian Dynamic Causal Discovery using Generative Flow Networks☆53Updated last year
- This is the code for the paper Embrace the Gap: VAEs perform Independent Mechanism Analysis, showing that optimizing the ELBO is equivale…☆23Updated last year
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- Random feature latent variable models in Python☆22Updated last year
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Codebase accompanying the paper "Diagnosing and Fixing Manifold Overfitting in Deep Generative Models"☆9Updated 8 months ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".☆18Updated last year
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆26Updated 3 years ago
- ☆29Updated 3 years ago
- Robust Learning with the Hilbert-Schmidt Independence Criterion☆46Updated 4 years ago