Learning the optimal transport map via input convex neural neworks
☆42Jun 26, 2020Updated 5 years ago
Alternatives and similar repositories for OT-ICNN
Users that are interested in OT-ICNN are comparing it to the libraries listed below
Sorting:
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆24Sep 9, 2024Updated last year
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆47Jun 17, 2022Updated 3 years ago
- Euclidean Wasserstein-2 optimal transportation☆46Aug 19, 2023Updated 2 years ago
- Implementation of Action Matching for the Schrödinger equation☆25Jun 18, 2023Updated 2 years ago
- Supervised Training of Conditional Monge Maps☆19Oct 30, 2023Updated 2 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆34Jun 17, 2022Updated 3 years ago
- ☆18Jun 26, 2023Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Dec 8, 2022Updated 3 years ago
- ☆22Feb 4, 2025Updated last year
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 4 years ago
- Fast Laplacian estimation☆16May 31, 2024Updated last year
- ☆13Mar 26, 2019Updated 6 years ago
- ☆51Jul 25, 2024Updated last year
- ☆12Oct 14, 2018Updated 7 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆67Feb 3, 2023Updated 3 years ago
- PyTorch implementation of the OT-Flow approach in arXiv:2006.00104☆57Jul 25, 2024Updated last year
- Python implementation of smooth optimal transport.☆61May 5, 2021Updated 4 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Dec 22, 2020Updated 5 years ago
- Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]☆15Feb 24, 2021Updated 5 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆17Jul 31, 2018Updated 7 years ago
- ☆32May 30, 2024Updated last year
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆22Jun 19, 2023Updated 2 years ago
- A minimal example of optimal transport with Input Convex Neural Networks in Pytorch☆24Dec 22, 2021Updated 4 years ago
- ☆18Mar 16, 2022Updated 3 years ago
- ☆15Feb 25, 2026Updated last week
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Oct 18, 2019Updated 6 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 4 years ago
- A list of papers for group meeting☆19Jan 5, 2026Updated 2 months ago
- ☆10Dec 8, 2023Updated 2 years ago
- ☆12Mar 15, 2023Updated 2 years ago
- Code repository for the paper "Geometric Scattering for Graph Data Analysis"☆13Aug 26, 2019Updated 6 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆23Nov 18, 2019Updated 6 years ago
- ☆24Sep 10, 2021Updated 4 years ago
- Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters☆10Mar 5, 2024Updated 2 years ago
- Code for paper Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks☆12Aug 9, 2022Updated 3 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆47Apr 24, 2021Updated 4 years ago
- Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)☆10Oct 15, 2021Updated 4 years ago
- Multiscale earth mover's distance methods for tree and manifold structured data☆12Mar 8, 2025Updated 11 months ago