Sep 2018
POT is 2 years old! This release brings numerous new features to the toolbox as listed below but also several bug correction.
Among the new features, we can highlight a non-regularized Gromov-Wasserstein
solver,
a new greedy variant of sinkhorn,
non-regularized,
convolutional (2D)
and free support
Wasserstein barycenters and smooth
and stochastic
implementation of entropic OT.
POT 0.5 also comes with a rewriting of ot.gpu using the cupy framework instead of the unmaintained cudamat. Note that while we tried to keed changes to the minimum, the OTDA classes were deprecated. If you are happy with the cudamat implementation, we recommend you stay with stable release 0.4 for now.
The code quality has also improved with 92% code coverage in tests that is now printed to the log in the Travis builds. The documentation has also been greatly improved with new modules and examples/notebooks.
This new release is so full of new stuff and corrections thanks to the old and new POT contributors (you can see the list in the readme).
- Add non regularized Gromov-Wasserstein solver (PR #41)
- Linear OT mapping between empirical distributions and 90% test coverage (PR #42)
- Add log parameter in class EMDTransport and SinkhornLpL1Transport (PR #44)
- Add Markdown format for Pipy (PR #45)
- Test for Python 3.5 and 3.6 on Travis (PR #46)
- Non regularized Wasserstein barycenter with scipy linear solver and/or cvxopt (PR #47)
- Rename dataset functions to be more sklearn compliant (PR #49)
- Smooth and sparse Optimal transport implementation with entropic and quadratic regularization (PR #50)
- Stochastic OT in the dual and semi-dual (PR #52 and PR #62)
- Free support barycenters (PR #56)
- Speed-up Sinkhorn function (PR #57 and PR #58)
- Add convolutional Wassersein barycenters for 2D images (PR #64)
- Add Greedy Sinkhorn variant (Greenkhorn) (PR #66)
- Big ot.gpu update with cupy implementation (instead of un-maintained cudamat) (PR #67)
Deprecated OTDA Classes were removed from ot.da and ot.gpu for version 0.5 (PR #48 and PR #67). The deprecation message has been for a year here since 0.4 and it is time to pull the plug.
- Issue #35 : remove import plot from ot/init.py (See PR #41)
- Issue #43 : Unusable parameter log for EMDTransport (See PR #44)
- Issue #55 : UnicodeDecodeError: 'ascii' while installing with pip
15 Sep 2017
This release contains a lot of contribution from new contributors.
- Automatic notebooks and doc update (PR #27)
- Add gromov Wasserstein solver and Gromov Barycenters (PR #23)
- emd and emd2 can now return dual variables and have max_iter (PR #29 and PR #25)
- New domain adaptation classes compatible with scikit-learn (PR #22)
- Proper tests with pytest on travis (PR #19)
- PEP 8 tests (PR #13)
- emd convergence problem du to fixed max iterations (#24)
- Semi supervised DA error (#26)
11 Jul 2017
- Correct bug in emd on windows
7 Jul 2017
- emd* and sinkhorn* are now performed in parallel for multiple target distributions
- emd and sinkhorn are for OT matrix computation
- emd2 and sinkhorn2 are for OT loss computation
- new notebooks for emd computation and Wasserstein Discriminant Analysis
- relocate notebooks
- update documentation
- clean_zeros(a,b,M) for removimg zeros in sparse distributions
- GPU implementations for sinkhorn and group lasso regularization
7 Apr 2017
- New dimensionality reduction method (WDA)
- Efficient method emd2 returns only tarnsport (in paralell if several histograms given)
5 Jan 2017
- Add sphinx gallery for better documentation
- Small efficiency tweak in sinkhorn
- Add simple tic() toc() functions for timing
7 Nov 2016
- numerical stabilization for sinkhorn (log domain and epsilon scaling)
4 Nov 2016
- Update classes and examples for domain adaptation
- Joint OT matrix and mapping estimation
31 Oct 2016
- Original Domain adaptation classes
- pipy works
28 Oct 2016
It provides the following solvers:
- OT solver for the linear program/ Earth Movers Distance.
- Entropic regularization OT solver with Sinkhorn Knopp Algorithm.
- Bregman projections for Wasserstein barycenter [3] and unmixing.
- Optimal transport for domain adaptation with group lasso regularization
- Conditional gradient and Generalized conditional gradient for regularized OT.
Some demonstrations (both in Python and Jupyter Notebook format) are available in the examples folder.