SISTA : Learning Optimal Transport Costs under Sparsity Constraints - Archive ouverte HAL Access content directly
Journal Articles Communications on Pure and Applied Mathematics Year : 2020

SISTA : Learning Optimal Transport Costs under Sparsity Constraints

(1, 2) , (3) , (4, 5) , (4)
1
2
3
4
5

Abstract

In this paper, we describe a novel iterative procedure called SISTA to learn the underlying cost in optimal transport problems. SISTA is a hybrid between two classical methods, coordinate descent (“S”-inkhorn) and proximal gradient descent (“ISTA”). It alternates between a phase of exact minimization over the transport potentials and a phase of proximal gradient descent over the parameters of the transport cost. We prove that this method converges linearly, and we illustrate on simulated examples that it is significantly faster than both coordinate descent and ISTA. We apply it to estimating a model of migration, which predicts the flow of migrants using country-specific characteristics and pairwise measures of dissimilarity between countries. This application demonstrates the effectiveness of machine learning in quantitative social sciences. © 2022 Wiley Periodicals LLC.

Dates and versions

hal-03893060 , version 1 (10-12-2022)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Guillaume Carlier, Arnaud Dupuy, Alfred Galichon, Yifei Sun. SISTA : Learning Optimal Transport Costs under Sparsity Constraints. Communications on Pure and Applied Mathematics, In press, ⟨10.1002/cpa.22047⟩. ⟨hal-03893060⟩
0 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More