Article (Scientific journals)
SISTA: Learning Optimal Transport Costs under Sparsity Constraints
DUPUY, Arnaud; Carlier, Guillaume; Galichon, Alfred et al.
In pressIn Communications on Pure and Applied Mathematics
Peer Reviewed verified by ORBi
 

Files


Full Text
2009.08564.pdf
Author preprint (616.61 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
: inverse optimal transport, coordinate descent, ISTA
Abstract :
[en] 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.
Disciplines :
Mathematics
Author, co-author :
DUPUY, Arnaud ;  University of Luxembourg > Faculty of Law, Economics and Finance (FDEF) > Department of Economics and Management (DEM)
Carlier, Guillaume
Galichon, Alfred
Sun, Yifei
External co-authors :
yes
Language :
English
Title :
SISTA: Learning Optimal Transport Costs under Sparsity Constraints
Publication date :
In press
Journal title :
Communications on Pure and Applied Mathematics
ISSN :
0010-3640
eISSN :
1097-0312
Publisher :
John Wiley & Sons, Hoboken, United States - New Jersey
Peer reviewed :
Peer Reviewed verified by ORBi
Focus Area :
Computational Sciences
Available on ORBilu :
since 04 January 2021

Statistics


Number of views
167 (12 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
3
Scopus citations®
without self-citations
3
OpenCitations
 
0
OpenAlex citations
 
2
WoS citations
 
1

Bibliography


Similar publications



Contact ORBilu