This tour explores a fast algorithm to compute the solution of a regularized optimal transportation problem. This corresponds to the resolution of a convex program which is the projection on the transport polytope for a Kulback-Leibler divergence.
This tour explores a fast algorithm to compute the solution of a regularized optimal transportation problem. This corresponds to the resolution of a convex program which is the projection on the transport polytope for a Kulback-Leibler divergence.