BorgwardtLab / WTK
A Wasserstein Subsequence Kernel for Time Series.
☆21Updated 5 months ago
Related projects ⓘ
Alternatives and complementary repositories for WTK
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".☆18Updated last year
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆20Updated 5 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- Repository for code release of paper "Robust Variational Autoencoders for Outlier Detection and Repair of Mixed-Type Data" (AISTATS 2020)☆50Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- "Oblique Decision Trees from Derivatives of ReLU Networks" (ICLR 2020, previously called "Locally Constant Networks")☆21Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆42Updated 3 years ago
- Implementation of the MIWAE method for deep generative modelling of incomplete data sets.☆37Updated 8 months ago
- Python implementation of smooth optimal transport.☆56Updated 3 years ago
- Keras implementation of Deep Wasserstein Embeddings☆46Updated 6 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- ☆13Updated last year
- Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]☆16Updated 3 years ago
- Code for the paper "Rethinking Importance Weighting for Deep Learning under Distribution Shift".☆27Updated 3 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 3 years ago
- ☆22Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- ☆12Updated 6 years ago
- Code for: "Neural Controlled Differential Equations for Online Prediction Tasks"☆36Updated 2 years ago