From fb7a3af6a87bcac7c5a95304f269fcd49340df7f Mon Sep 17 00:00:00 2001 From: Florian Kalinke Date: Fri, 28 Aug 2020 10:24:38 +0200 Subject: [PATCH] Fix minor typo take #2 As recommended in your comment. --- docs/source/quickstart.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/source/quickstart.rst b/docs/source/quickstart.rst index d56f81211..8d8b03f34 100644 --- a/docs/source/quickstart.rst +++ b/docs/source/quickstart.rst @@ -176,7 +176,7 @@ solution of the resulting optimization problem can be expressed as: where :math:`u` and :math:`v` are vectors and :math:`K=\exp(-M/\lambda)` where the :math:`\exp` is taken component-wise. In order to solve the optimization problem, on can use an alternative projection algorithm called Sinkhorn-Knopp that can be very -efficient for large values if regularization. +efficient for large values of regularization. The Sinkhorn-Knopp algorithm is implemented in :any:`ot.sinkhorn` and :any:`ot.sinkhorn2` that return respectively the OT matrix and the value of the