`

Timezone: »

 
Poster
Screening Sinkhorn Algorithm for Regularized Optimal Transport
Mokhtar Z. Alaya · Maxime Berar · Gilles Gasso · Alain Rakotomamonjy

Thu Dec 12 05:00 PM -- 07:00 PM (PST) @ East Exhibition Hall B + C #53
in Algorithms -- Sparsity and Compressed Sensing »

We introduce in this paper a novel strategy for efficiently approximating the Sinkhorn distance between two discrete measures. After identifying neglectable components of the dual solution of the regularized Sinkhorn problem, we propose to screen those components by directly setting them at that value before entering the Sinkhorn problem. This allows us to solve a smaller Sinkhorn problem while ensuring approximation with provable guarantees. More formally, the approach is based on a new formulation of dual of Sinkhorn divergence problem and on the KKT optimality conditions of this problem, which enable identification of dual components to be screened. This new analysis leads to the Screenkhorn algorithm. We illustrate the efficiency of Screenkhorn on complex tasks such as dimensionality reduction and domain adaptation involving regularized optimal transport.

Keywords: Convex Optimization · Similarity and Distance Learning · Algorithms · Algorithms -> Large Scale Learning; Optimization
[ Paper]  [ Slides] 

Author Information

Mokhtar Z. Alaya (LITIS Lab, University Rouen Normandy)
Maxime Berar (Université de Rouen)
Gilles Gasso (LITIS - INSA de Rouen)
Alain Rakotomamonjy (Université de Rouen Normandie Criteo AI Lab)

More from the Same Authors