bunnech / jkonet
Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
☆14Updated last year
Related projects: ⓘ
- Supervised Training of Conditional Monge Maps☆13Updated 10 months ago
- ☆19Updated 3 weeks ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Tensorflow implementation for the SVGP-VAE model.☆19Updated 3 years ago
- PhD Thesis☆24Updated 11 months ago
- ☆17Updated last year
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- ☆29Updated last year
- Official implementation of Joint Multidimensional Scaling☆21Updated 10 months ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- ☆16Updated 8 months ago
- ☆33Updated 2 months ago
- Transformer Based Embeddings of Wasserstein Distance☆12Updated 2 months ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆35Updated 2 years ago
- GP Sinkhorn Implementation, paper: https://www.mdpi.com/1099-4300/23/9/1134☆22Updated 2 years ago
- Multiscale earth mover's distance methods for tree and manifold structured data☆11Updated last year
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆66Updated 7 months ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated 10 months ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 years ago
- DynGFN: Bayesian Dynamic Causal Discovery using Generative Flow Networks☆46Updated 6 months ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆35Updated 2 years ago
- TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics☆98Updated last month
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆27Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Implementation of the paper "Neural Wasserstein Gradient Flows for Discrepancies with Riesz Kernels"☆10Updated 6 months ago
- CO-Optimal Transport☆41Updated 3 years ago
- Deep direct likelihood knockoffs☆11Updated 3 years ago
- Deep Large-Scale Inference UsingKnockoffs☆11Updated 2 years ago
- ☆15Updated last year
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year