nrkarthikeyan / topology-decision-boundariesLinks
Topology of decision boundaries
☆28Updated 6 years ago
Alternatives and similar repositories for topology-decision-boundaries
Users that are interested in topology-decision-boundaries are comparing it to the libraries listed below
Sorting:
- Deprecated repository for "Deep Learning with Topological Signatures"☆36Updated 5 years ago
- Code for the paper 'Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology'☆30Updated 6 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 6 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆75Updated 9 years ago
- Material for the EPFL master course "A Network Tour of Data Science", edition 2016.☆99Updated 5 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 5 years ago
- Replication code for the article "Learning Functional Causal Models with Generative Neural Networks"☆100Updated 6 years ago
- Code for "Differentiable Compositional Kernel Learning for Gaussian Processes" https://arxiv.org/abs/1806.04326☆71Updated 7 years ago
- NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.☆67Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Python implementation of the infomration bottleneck method (tishby et al, 1999)☆36Updated 8 years ago
- ☆21Updated 2 years ago
- NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.☆64Updated 7 years ago
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- Reliable Uncertainty Estimates in Deep Neural Networks using Noise Contrastive Priors☆62Updated 5 years ago
- Code for the paper "A Kernel Test of Goodness of Fit" by Kacper Chwialkowski, Heiko Strathmann, Arthur Gretton☆25Updated 9 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- a python implementation of various versions of the information bottleneck, including automated parameter searching☆132Updated 5 years ago
- Pytorch package for geometric softmax☆12Updated 6 years ago
- Learning and Reasoning with Graph-Structured Data (ICML 2019 Workshop)☆26Updated 6 years ago
- Sparse-input neural networks☆23Updated 3 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 7 years ago
- Open source Python library for topological data analysis (TDA)☆79Updated 8 years ago
- Experiments with Neural ODEs and Adversarial Attacks☆44Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Supporting code for "Parallel Streaming Wasserstein Barycenters"☆10Updated 8 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆21Updated 7 years ago
- Anonymous Repository for ICML LRG Workshop: On Explainability Techniques for Graph Convolutional Networks☆23Updated 6 years ago
- Notebooks for IPAM Tutorial, March 15 2019☆24Updated 6 years ago