We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a8acfc3 commit 55164e9Copy full SHA for 55164e9
docs/source/quickstart.rst
@@ -176,7 +176,7 @@ solution of the resulting optimization problem can be expressed as:
176
where :math:`u` and :math:`v` are vectors and :math:`K=\exp(-M/\lambda)` where
177
the :math:`\exp` is taken component-wise. In order to solve the optimization
178
problem, on can use an alternative projection algorithm called Sinkhorn-Knopp that can be very
179
-efficient for large values if regularization.
+efficient for large values of regularization.
180
181
The Sinkhorn-Knopp algorithm is implemented in :any:`ot.sinkhorn` and
182
:any:`ot.sinkhorn2` that return respectively the OT matrix and the value of the
0 commit comments