SISTA: Learning Optimal Transport Costs under Sparsity Constraints

Guillaume Carlier, Arnaud Dupuy, Alfred Galichon, Yifei Sun

    Research output: Contribution to journalArticlepeer-review


    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.

    Original languageEnglish (US)
    Pages (from-to)1659-1677
    Number of pages19
    JournalCommunications on Pure and Applied Mathematics
    Issue number9
    StatePublished - Sep 2023

    ASJC Scopus subject areas

    • General Mathematics
    • Applied Mathematics


    Dive into the research topics of 'SISTA: Learning Optimal Transport Costs under Sparsity Constraints'. Together they form a unique fingerprint.

    Cite this