SISTA: Learning Optimal Transport Costs under Sparsity Constraints

被引:1
|
作者
Carlier, Guillaume [1 ]
Dupuy, Arnaud [2 ]
Galichon, Alfred [3 ]
Sun, Yifei [3 ]
机构
[1] Univ Paris 09, PSL, CEREMADE, Pl Marechal deLattre de Tassigny, F-75775 Paris 16, France
[2] Univ Luxembourg, Campus Kirchberg,6 Rue Richard Coudenhove Kalergi, L-1359 Luxembourg, Luxembourg
[3] Courant Inst, 251 Mercer St, New York, NY 10012 USA
基金
美国国家科学基金会; 欧洲研究理事会;
关键词
MIGRATION;
D O I
10.1002/cpa.22047
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (c) 2022 Wiley Periodicals LLC.
引用
收藏
页码:1659 / 1677
页数:19
相关论文
共 50 条
  • [1] GRAPH LEARNING UNDER SPECTRAL SPARSITY CONSTRAINTS
    Subbareddy, B.
    Siripuram, Aditya
    Zhang, Jingxin
    2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021), 2021, : 5405 - 5409
  • [2] Graph learning under spectral sparsity constraints
    2021, Institute of Electrical and Electronics Engineers Inc. (2021-June):
  • [3] Exploration under Sparsity Constraints
    Manss, Christoph
    Shutin, Dmitriy
    Ruiz, Alberto Viseras
    Wiedemann, Thomas
    Mueller, Joachim
    2015 EUROPEAN CONFERENCE ON MOBILE ROBOTS (ECMR), 2015,
  • [4] Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
    Gruettemeier, Niels
    Komusiewicz, Christian
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 74 : 1225 - 1267
  • [5] Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
    Gruettemeier, Niels
    Komusiewicz, Christian
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4245 - 4251
  • [6] Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
    Grüttemeier, Niels
    Komusiewicz, Christian
    Journal of Artificial Intelligence Research, 2022, 74 : 1225 - 1267
  • [7] METRIC LEARNING WITH RANK AND SPARSITY CONSTRAINTS
    Bah, Bubacarr
    Becker, Stephen
    Cevher, Volkan
    Goezcue, Baran
    2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [8] ON A PROBLEM OF OPTIMAL TRANSPORT UNDER MARGINAL MARTINGALE CONSTRAINTS
    Beiglboeck, Mathias
    Juillet, Nicolas
    ANNALS OF PROBABILITY, 2016, 44 (01): : 42 - 106
  • [9] Learning Optimal Decision Trees Under Memory Constraints
    Aglin, Gael
    Nijssen, Siegfried
    Schaus, Pierre
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT V, 2023, 13717 : 393 - 409
  • [10] Tikhonov Regularization is Optimal Transport Robust under Martingale Constraints
    Li, Jiajin
    Lin, Sirui
    Blanchet, Jose
    Nguyen, Viet Anh
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,