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 条
  • [31] ORACLE INEQUALITIES AND OPTIMAL INFERENCE UNDER GROUP SPARSITY
    Lounici, Karim
    Pontil, Massimiliano
    van de Geer, Sara
    Tsybakov, Alexandre B.
    ANNALS OF STATISTICS, 2011, 39 (04): : 2164 - 2204
  • [32] Optimal lockdowns under constraints
    Dagher, Jihad C.
    Parkinson, Christian
    ECONOMIC INQUIRY, 2024,
  • [33] Optimal Search Under Constraints
    Ceberio, Martine
    Kosheleva, Olga
    Kreinovich, Vladik
    FUZZY INFORMATION PROCESSING 2020, 2022, 1337 : 421 - 426
  • [34] Optimal Transport With Relaxed Marginal Constraints
    Li, Jia
    Lin, Lin
    IEEE ACCESS, 2021, 9 : 58142 - 58160
  • [35] Optimal Transition from Coal to Gas and Renewable Power Under Capacity Constraints and Adjustment Costs
    Coulomb, Renaud
    Lecuyer, Oskar
    Vogt-Schilb, Adrien
    ENVIRONMENTAL & RESOURCE ECONOMICS, 2019, 73 (02): : 557 - 590
  • [36] Optimal Transition from Coal to Gas and Renewable Power Under Capacity Constraints and Adjustment Costs
    Renaud Coulomb
    Oskar Lecuyer
    Adrien Vogt-Schilb
    Environmental and Resource Economics, 2019, 73 : 557 - 590
  • [37] Dynamic sampling schemes for optimal noise learning under multiple nonsmooth constraints
    Calatroni, Luca
    De Los Reyes, Juan Carlos
    Schönlieb, Carola-Bibiane
    IFIP Advances in Information and Communication Technology, 2014, 443 : 85 - 95
  • [38] OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints
    Wimalajeewa, Thakshila
    Varshney, Pramod K.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (19) : 5059 - 5072
  • [39] On the stable recovery of deep structured linear networks under sparsity constraints
    Malgouyres, Francois
    MATHEMATICAL AND SCIENTIFIC MACHINE LEARNING, VOL 107, 2020, 107 : 107 - 127
  • [40] Measurement Bounds for Observability of Linear Dynamical Systems Under Sparsity Constraints
    Joseph, Geethu
    Murthy, Chandra Ramabhadra
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (08) : 1992 - 2006