2 Repos
Algorithms for calculating the coupling matrix (transport plan) that minimizes transport cost between distributions.
Distinct from Query Plan Optimizations: Shortlist candidates refer to database query plans or hardware compute planning, not mathematical transport plans.
Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Optimal Transport Plan Computations. Refine with filters or upvote what's useful.
POT is an optimal transport library providing a collection of solvers for computing Wasserstein, Gromov-Wasserstein, and Fused Gromov-Wasserstein distances between probability distributions. It functions as a differentiable tensor framework that integrates with various tensor libraries to enable automatic differentiation and GPU acceleration. The project is distinguished by its ability to align data distributions across different metric spaces by comparing internal relational structures rather than coordinates. It implements mathematical optimization algorithms as differentiable layers, allow
Calculates optimal transport coupling matrices to determine the most efficient way to move mass between probability distributions.
This repository is an educational collection of implementations and research notes focused on deep learning architectures and optimization techniques. It provides modular code examples designed to demonstrate foundational and advanced concepts in machine learning, ranging from basic neural network structures to complex training strategies. The project distinguishes itself by offering practical implementations of specialized research methods, including capsule-based feature aggregation, gradient direction decoupling, and self-normalizing weight regularization. These materials allow for the stu
Computes optimal transport plans between data distributions through iterative matrix normalization.