Contains the code relative to the paper Unbalanced Optimal Transport through Non-negative Penalized Linear Regression https://arxiv.org/abs/2106.04145
☆13Oct 26, 2021Updated 4 years ago
Alternatives and similar repositories for UOT-though-penalized-linear-regression
Users that are interested in UOT-though-penalized-linear-regression are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".☆13Apr 11, 2020Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Feb 3, 2020Updated 6 years ago
- Mastodon server running for the Doubanius Tertius project☆10Apr 4, 2022Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆45Nov 17, 2023Updated 2 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- Official implementation of 'P$^2$OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering'. (Accepted by ICLR 2024)☆20Jun 24, 2026Updated 3 months ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Mar 3, 2020Updated 6 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆83Jan 25, 2024Updated 2 years ago
- Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].☆12Nov 28, 2018Updated 7 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- L. Chizat, G. Peyré, B. Schmitzer, F-X. Vialard. Scaling Algorithms for Unbalanced Transport Problems. Preprint Arxiv:1607.05816, 2016.☆43Jan 20, 2017Updated 9 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆31Dec 21, 2022Updated 3 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 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.
- ☆17Oct 22, 2020Updated 5 years ago
- Robust Optimal Transport code☆43Oct 6, 2022Updated 4 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Fast discrete distributions clustering using Wasserstein barycenter with sparse support☆12Nov 20, 2018Updated 7 years ago
- ☆34Mar 13, 2022Updated 4 years ago
- Collection of evaluation code for natural language generation.☆12Jan 6, 2021Updated 5 years ago
- A fully featured desktop application where you can download and browse GTA V Native functions from NativeDB (for script developers)☆16Jan 2, 2018Updated 8 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆53Sep 6, 2022Updated 4 years ago
- Group project "Algorithms for large-scale optimal transport". Implement ADMMs and Sinkhorn's Algorithms.☆11Jan 28, 2019Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Supporting code for "Parallel Streaming Wasserstein Barycenters"☆11Nov 14, 2017Updated 8 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Apr 26, 2023Updated 3 years ago
- ☆15Apr 4, 2023Updated 3 years ago
- YALL1: Your ALgorithms for L1☆13Jan 28, 2018Updated 8 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆30Jan 4, 2018Updated 8 years ago
- modified implementation of the FastEMD (Pele and Wermann, 2009)☆11Oct 2, 2024Updated 2 years ago
- Text-based, Choose-your-own adventure game made with React☆15Mar 29, 2018Updated 8 years ago
- SIMPLE: A Gradient Estimator for $k$-subset Sampling☆12Aug 8, 2024Updated 2 years ago
- N. Papadakis, G. Peyré, E. Oudet. Optimal Transport with Proximal Splitting. SIAM Journal on Imaging Sciences, 7(1), pp. 212–238, 2014.☆14Jan 7, 2017Updated 9 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Distributional Sliced-Wasserstein distance code☆51Jul 22, 2024Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆69Dec 2, 2019Updated 6 years ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 6 years ago
- ☆20Oct 3, 2023Updated 3 years ago
- Douglas-Rachford Splitting for Optimal Transport☆12Oct 4, 2021Updated 5 years ago
- J. Solomon, G. Peyré, V. Kim, S. Sra. Entropic Metric Alignment for Correspondence Problems. ACM Transactions on Graphics (Proc. SIGGRAPH…☆11Jan 7, 2017Updated 9 years ago
- ☆12Jun 14, 2025Updated last year