Learning the optimal transport map via input convex neural neworks
☆44Jun 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- 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☆48Aug 19, 2023Updated 2 years ago
- ☆18Jun 26, 2023Updated 2 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆24Sep 9, 2024Updated last year
- ☆12Oct 14, 2018Updated 7 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆17Jul 31, 2018Updated 7 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆67Feb 3, 2023Updated 3 years ago
- Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]☆15Feb 24, 2021Updated 5 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆35Jun 17, 2022Updated 3 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆17Dec 22, 2020Updated 5 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Fast Laplacian estimation☆16May 31, 2024Updated last year
- ☆23Feb 4, 2025Updated last year
- PyTorch implementation of the OT-Flow approach in arXiv:2006.00104☆59Jul 25, 2024Updated last year
- Python implementation of smooth optimal transport.☆60May 5, 2021Updated 5 years ago
- ☆50Jul 25, 2024Updated last year
- 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
- Code repository for the paper "Geometric Scattering for Graph Data Analysis"☆14Aug 26, 2019Updated 6 years ago
- Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"☆54Jan 22, 2020Updated 6 years ago
- Graph Learning with JAX☆14Jul 11, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- ☆24Sep 10, 2021Updated 4 years ago
- Riemannian Convex Potential Maps☆67Mar 31, 2023Updated 3 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Aug 8, 2023Updated 2 years ago
- ☆11Dec 8, 2023Updated 2 years ago
- ☆10Jun 22, 2022Updated 3 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Oct 8, 2020Updated 5 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆23Jun 19, 2023Updated 2 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
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆24Nov 18, 2019Updated 6 years ago
- ☆14Jul 17, 2023Updated 2 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Apr 15, 2018Updated 8 years ago
- Meta Optimal Transport☆108May 25, 2023Updated 2 years ago
- Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters☆10Mar 5, 2024Updated 2 years ago
- ☆17Mar 16, 2022Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Jun 13, 2020Updated 5 years ago