From bffba0033fda3a45d7cbbde5165e09e886262ab2 Mon Sep 17 00:00:00 2001 From: Rémi Flamary Date: Wed, 22 Apr 2020 12:44:45 +0200 Subject: awesome new readme --- docs/source/readme.rst | 111 +++++++++++++++++++++++++++++++++++++------------ 1 file changed, 85 insertions(+), 26 deletions(-) (limited to 'docs/source/readme.rst') diff --git a/docs/source/readme.rst b/docs/source/readme.rst index 76d37a4..4862523 100644 --- a/docs/source/readme.rst +++ b/docs/source/readme.rst @@ -10,31 +10,84 @@ machine learning. Website and documentation: https://PythonOT.github.io/ -POT provides the following generic OT solvers: \* OT Network Flow solver -for the linear program/ Earth Movers Distance [1]. \* Conditional -gradient [6] and Generalized conditional gradient for regularized OT -[7]. \* Entropic regularization OT solver with Sinkhorn Knopp Algorithm -[2], stabilized version [9] [10], greedy Sinkhorn [22] and Screening -Sinkhorn [26] with optional GPU implementation (requires cupy). \* -Bregman projections for Wasserstein barycenter [3], convolutional -barycenter [21] and unmixing [4]. \* Sinkhorn divergence [23] and -entropic regularization OT from empirical data. \* Smooth optimal -transport solvers (dual and semi-dual) for KL and squared L2 -regularizations [17]. \* Non regularized Wasserstein barycenters [16] -with LP solver (only small scale). \* Gromov-Wasserstein distances and -barycenters ([13] and regularized [12]) \* Stochastic Optimization for -Large-scale Optimal Transport (semi-dual problem [18] and dual problem -[19]) \* Non regularized free support Wasserstein barycenters [20]. \* -Unbalanced OT with KL relaxation distance and barycenter [10, 25]. \* -Partial Wasserstein and Gromov-Wasserstein (exact [29] and entropic [3] -formulations). - -POT provides the following Machine Learning related solvers: \* Optimal -transport for domain adaptation with group lasso regularization and -Laplacian regularization [5] [30]. \* Linear OT [14] and Joint OT matrix -and mapping estimation [8]. \* Wasserstein Discriminant Analysis [11] -(requires autograd + pymanopt). \* JCPOT algorithm for multi-source -domain adaptation with target shift [27]. +Source Code (MIT): https://github.com/PythonOT/POT + +POT provides the following generic OT solvers (links to examples): + +- `OT Network Simplex + solver `__ + for the linear program/ Earth Movers Distance [1] . +- `Conditional + gradient `__ + [6] and `Generalized conditional + gradient `__ + for regularized OT [7]. +- Entropic regularization OT solver with `Sinkhorn Knopp + Algorithm `__ + [2] , stabilized version [9] [10], greedy Sinkhorn [22] and + `Screening Sinkhorn + [26] `__ + with optional GPU implementation (requires cupy). +- Bregman projections for `Wasserstein + barycenter `__ + [3], `convolutional + barycenter `__ + [21] and unmixing [4]. +- Sinkhorn divergence [23] and entropic regularization OT from + empirical data. +- `Smooth optimal transport + solvers `__ + (dual and semi-dual) for KL and squared L2 regularizations [17]. +- Non regularized `Wasserstein barycenters + [16] `__) + with LP solver (only small scale). +- `Gromov-Wasserstein + distances `__ + and `GW + barycenters `__ + (exact [13] and regularized [12]) +- `Fused-Gromov-Wasserstein distances + solver `__ + and `FGW + barycenters `__ + [24] +- `Stochastic + solver `__ + for Large-scale Optimal Transport (semi-dual problem [18] and dual + problem [19]) +- Non regularized `free support Wasserstein + barycenters `__ + [20]. +- `Unbalanced + OT `__ + with KL relaxation and + `barycenter `__ + [10, 25]. +- `Partial Wasserstein and + Gromov-Wasserstein `__ + (exact [29] and entropic [3] formulations). + +POT provides the following Machine Learning related solvers: + +- `Optimal transport for domain + adaptation `__ + with `group lasso + regularization `__, + `Laplacian + regularization `__ + [5] [30] and `semi supervised + setting `__. +- `Linear OT + mapping `__ + [14] and `Joint OT mapping + estimation `__ + [8]. +- `Wasserstein Discriminant + Analysis `__ + [11] (requires autograd + pymanopt). +- `JCPOT algorithm for multi-source domain adaptation with target + shift `__ + [27]. Some demonstrations are available in the `documentation `__. @@ -45,12 +98,18 @@ Using and citing the toolbox If you use this toolbox in your research and find it useful, please cite POT using the following bibtex reference: +:: + + Rémi Flamary and Nicolas Courty, POT Python Optimal Transport library, Website: https://pythonot.github.io/, 2017 + +In Bibtex format: + :: @misc{flamary2017pot, title={POT Python Optimal Transport library}, author={Flamary, R{'e}mi and Courty, Nicolas}, - url={https://github.com/rflamary/POT}, + url={https://pythonot.github.io/}, year={2017} } -- cgit v1.2.3