Neural Information Processing Systems http://nips.cc/

Applications of optimal transport have recently gained remarkable attention as a result of the computational advantages of entropic regularization. However, in most situations the Sinkhorn approximation to the Wasserstein distance is replaced by a regularized version that is less accurate but easy to differentiate. In this work we characterize the differential properties of the original Sinkhorn approximation, proving that it enjoys the same smoothness of its regularized version and we explicitly provide an efficient algorithm to compute its gradient. We show that this result benefits both theory and applications: on one hand, high order smoothness confers statistical guarantees to learning with Wasserstein approximations. On the other hand, the gradient formula is used to efficiently solve learning and optimization problems in practice. Promising preliminary experiments complement our analysis.

But despite its wide applicability (see 2.2) and elegance, convergence theory for CCCP is quite limited.

Cooperativecommunication plays acentral role intheories ofhuman cognition, language, development, culture, and human-robot interaction. Computational simulations support and elaborate our theoretical results, and demonstrate fit to human behavior.