[ICML2023] InfoOT: Information Maximizing Optimal Transport
☆41Apr 27, 2023Updated 2 years ago
Alternatives and similar repositories for InfoOT
Users that are interested in InfoOT are comparing it to the libraries listed below
Sorting:
- Code for "Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance", NeurIPS 2022☆17Feb 11, 2023Updated 3 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆50Sep 6, 2022Updated 3 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆35Feb 14, 2023Updated 3 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
- Entropic Optimal Transport Benchmark (NeurIPS 2023).☆31Mar 21, 2024Updated last year
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Sep 29, 2021Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 years ago
- ☆13Jul 25, 2023Updated 2 years ago
- Recyclable Gaussian Processes☆11Dec 8, 2022Updated 3 years ago
- ☆13Sep 13, 2023Updated 2 years ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆10Sep 2, 2024Updated last year
- Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants☆16Nov 30, 2025Updated 3 months ago
- PyTorch implementation for "Training and Inference on Any-Order Autoregressive Models the Right Way", NeurIPS 2022 Oral, TPM 2023 Best Pa…☆15May 31, 2023Updated 2 years ago
- Conceptual & empirical comparisons between decision forests & deep networks☆18May 30, 2025Updated 9 months ago
- Code base for NeurIPS 2022 paper Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation.☆11Aug 21, 2023Updated 2 years ago
- Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"☆14Updated this week
- ☆12Jul 25, 2024Updated last year
- A minimal, single-file implementation of the MeanFlow paper on 2D toy examples, with a side-by-side comparison to rectified flow.☆26Jul 4, 2025Updated 7 months ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Aug 4, 2023Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Jun 14, 2019Updated 6 years ago
- Source code for the NeurIPS 2022 Spotlight paper: "Unified Optimal Transport Framework for Universal Domain Adaptation"☆64Dec 1, 2022Updated 3 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆17Jun 27, 2021Updated 4 years ago
- Supervised Training of Conditional Monge Maps☆19Oct 30, 2023Updated 2 years ago
- Discovering Quality-Diversity Algorithms via Meta-Black-Box Optimization☆20Dec 1, 2025Updated 3 months ago
- Official PyTorch implementation for paper: Energy-Based Sliced Wasserstein Distance☆18Feb 21, 2025Updated last year
- Implementation code for the paper "Aggregating Residue-Level Protein Language Model Embeddings with Optimal Transport"☆22May 3, 2025Updated 9 months ago
- Code for "Information Recovery-Driven Deep Incomplete Multi-view Clustering Network"☆13Oct 9, 2024Updated last year
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆17Jul 5, 2024Updated last year
- Euclidean Wasserstein-2 optimal transportation☆46Aug 19, 2023Updated 2 years ago
- Robust Optimal Transport code☆44Oct 6, 2022Updated 3 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆78Jan 25, 2024Updated 2 years ago
- [NeurIPS'21] This repository is the implementation of "Learning 3D Dense Correspondence via Canonical Point Autoencoder"☆20Feb 16, 2022Updated 4 years ago
- Keypoint-Guided Optimal Transport (NeurIPS 2022)☆25Aug 23, 2023Updated 2 years ago
- A basic implementation of the paper Eigengame : PCA as a Nash Equilibrium☆21Jun 7, 2021Updated 4 years ago
- Official repo for PAC-Bayes Information Bottleneck. ICLR 2022.☆49May 11, 2022Updated 3 years ago
- ☆26Jul 1, 2022Updated 3 years ago
- Source Code of IJCAI 2022 paper "Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport"☆23Aug 22, 2022Updated 3 years ago
- ☆23Jun 8, 2022Updated 3 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆24Sep 9, 2024Updated last year