随机控制关系:Richard Sinkhorn在Schrödinger桥上遇到Gaspard Monge

IF 10.8 1区 数学 Q1 MATHEMATICS, APPLIED SIAM Review Pub Date : 2021-01-01 DOI:10.1137/20M1339982
Yongxin Chen, T. Georgiou, M. Pavon
{"title":"随机控制关系:Richard Sinkhorn在Schrödinger桥上遇到Gaspard Monge","authors":"Yongxin Chen, T. Georgiou, M. Pavon","doi":"10.1137/20M1339982","DOIUrl":null,"url":null,"abstract":"In 1931--1932, Erwin Schr\\\"odinger studied a hot gas Gedankenexperiment (an instance of large deviations of the empirical distribution). Schr\\\"odinger's problem represents an early example of a fundamental inference method, the so-called maximum entropy method, having roots in Boltzmann's work and being developed in subsequent years by Jaynes, Burg, Dempster, and Csisz\\'ar. The problem, known as the Schr\\\" odinger bridge problem (SBP) with ``uniform\"\" prior, was more recently recognized as a regularization of the Monge-Kantorovich optimal mass transport (OMT) problem, leading to effective computational schemes for the latter. Specifically, OMT with quadratic cost may be viewed as a zerotemperature limit of the problem posed by Schr\\\"odinger in the early 1930s. The latter amounts to minimization of Helmholtz's free energy over probability distributions that are constrained to possess two given marginals. The problem features a delicate compromise, mediated by a temperature parameter, between minimizing the internal energy and maximizing the entropy. These concepts are central to a rapidly expanding area of modern science dealing with the so-called Sinkhorn algorithm, which appears as a special case of an algorithm first studied in the more challenging continuous space setting by the French analyst Robert Fortet in 1938--1940 specifically for Schr\\\"odinger bridges. Due to the constraint on end-point distributions, dynamic programming is not a suitable tool to attack these problems. Instead, Fortet's iterative algorithm and its discrete counterpart, the Sinkhorn iteration, permit computation of the optimal solution by iteratively solving the so-called Schr\\\" odinger system. Convergence of the iteration is guaranteed by contraction along the steps in suitable metrics, such as Hilbert's projective metric. In both the continuous as well as the discrete time and space settings, stochastic control provides a reformulation of and a context for the dynamic versions of general Schr\\\" odinger bridge problems and of their zero-temperature limit, the OMT problem. These problems, in turn, naturally lead to steering problems for flows of one-time marginals which represent a new paradigm for controlling uncertainty. The zero-temperature problem in the continuous-time and space setting turns out to be the celebrated Benamou--Brenier characterization of theMcCann displacement interpolation flow in OMT. The formalism and techniques behind these control problems on flows of probability distributions have attracted significant attention in recent years as they lead to a variety of new applications in spacecraft guidance, control of robot or biological swarms, sensing, active cooling, and network routing as well as in computer and data science. This multifaceted and versatile framework, intertwining SBP and OMT, provides the substrate for the historical and technical overview \\ast Received by the editors May 22, 2020; accepted for publication (in revised form) October 29, 2020; published electronically May 6, 2021. https://doi.org/10.1137/20M1339982 Funding: This work was partially supported by the NSF under grants 1807664, 1839441, 1901599, and 1942523, by the AFOSR under grant FA9550-17-1-0435, and by University of Padova Research Project CPDA 140897. \\dagger School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (yongchen@gatech.edu). \\ddagger Department of Mechanical and Aerospace Engineering, University of California, Irvine, CA 92697 USA (tryphon@uci.edu). \\S Dipartimento di Matematica ``Tullio Levi-Civita,\"\" Universit\\` a di Padova, 35121 Padova, Italy (pavon@math.unipd.it). 249 D ow nl oa de d 11 /0 9/ 21 to 1 47 .1 62 .2 13 .1 11 R ed is tr ib ut io n su bj ec t t o SI A M li ce ns e or c op yr ig ht ; s ee h ttp s: //e pu bs .s ia m .o rg /p ag e/ te rm s","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":null,"pages":null},"PeriodicalIF":10.8000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"78","resultStr":"{\"title\":\"Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge\",\"authors\":\"Yongxin Chen, T. Georgiou, M. Pavon\",\"doi\":\"10.1137/20M1339982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 1931--1932, Erwin Schr\\\\\\\"odinger studied a hot gas Gedankenexperiment (an instance of large deviations of the empirical distribution). Schr\\\\\\\"odinger's problem represents an early example of a fundamental inference method, the so-called maximum entropy method, having roots in Boltzmann's work and being developed in subsequent years by Jaynes, Burg, Dempster, and Csisz\\\\'ar. The problem, known as the Schr\\\\\\\" odinger bridge problem (SBP) with ``uniform\\\"\\\" prior, was more recently recognized as a regularization of the Monge-Kantorovich optimal mass transport (OMT) problem, leading to effective computational schemes for the latter. Specifically, OMT with quadratic cost may be viewed as a zerotemperature limit of the problem posed by Schr\\\\\\\"odinger in the early 1930s. The latter amounts to minimization of Helmholtz's free energy over probability distributions that are constrained to possess two given marginals. The problem features a delicate compromise, mediated by a temperature parameter, between minimizing the internal energy and maximizing the entropy. These concepts are central to a rapidly expanding area of modern science dealing with the so-called Sinkhorn algorithm, which appears as a special case of an algorithm first studied in the more challenging continuous space setting by the French analyst Robert Fortet in 1938--1940 specifically for Schr\\\\\\\"odinger bridges. Due to the constraint on end-point distributions, dynamic programming is not a suitable tool to attack these problems. Instead, Fortet's iterative algorithm and its discrete counterpart, the Sinkhorn iteration, permit computation of the optimal solution by iteratively solving the so-called Schr\\\\\\\" odinger system. Convergence of the iteration is guaranteed by contraction along the steps in suitable metrics, such as Hilbert's projective metric. In both the continuous as well as the discrete time and space settings, stochastic control provides a reformulation of and a context for the dynamic versions of general Schr\\\\\\\" odinger bridge problems and of their zero-temperature limit, the OMT problem. These problems, in turn, naturally lead to steering problems for flows of one-time marginals which represent a new paradigm for controlling uncertainty. The zero-temperature problem in the continuous-time and space setting turns out to be the celebrated Benamou--Brenier characterization of theMcCann displacement interpolation flow in OMT. The formalism and techniques behind these control problems on flows of probability distributions have attracted significant attention in recent years as they lead to a variety of new applications in spacecraft guidance, control of robot or biological swarms, sensing, active cooling, and network routing as well as in computer and data science. This multifaceted and versatile framework, intertwining SBP and OMT, provides the substrate for the historical and technical overview \\\\ast Received by the editors May 22, 2020; accepted for publication (in revised form) October 29, 2020; published electronically May 6, 2021. https://doi.org/10.1137/20M1339982 Funding: This work was partially supported by the NSF under grants 1807664, 1839441, 1901599, and 1942523, by the AFOSR under grant FA9550-17-1-0435, and by University of Padova Research Project CPDA 140897. \\\\dagger School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (yongchen@gatech.edu). \\\\ddagger Department of Mechanical and Aerospace Engineering, University of California, Irvine, CA 92697 USA (tryphon@uci.edu). \\\\S Dipartimento di Matematica ``Tullio Levi-Civita,\\\"\\\" Universit\\\\` a di Padova, 35121 Padova, Italy (pavon@math.unipd.it). 249 D ow nl oa de d 11 /0 9/ 21 to 1 47 .1 62 .2 13 .1 11 R ed is tr ib ut io n su bj ec t t o SI A M li ce ns e or c op yr ig ht ; s ee h ttp s: //e pu bs .s ia m .o rg /p ag e/ te rm s\",\"PeriodicalId\":49525,\"journal\":{\"name\":\"SIAM Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":10.8000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"78\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Review\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/20M1339982\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Review","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/20M1339982","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 78

摘要

1931- 1932年,埃尔温·薛定谔研究了热气体格丹肯实验(经验分布大偏差的一个实例)。薛定谔的问题代表了一种基本推理方法的早期例子,即所谓的最大熵法,它植根于玻尔兹曼的工作,并在随后的几年里由杰恩斯、伯格、登普斯特和cissar发展。该问题被称为具有“均匀”先验的Schr\ odinger桥问题(SBP),最近被认为是Monge-Kantorovich最优质量传递(OMT)问题的正则化,导致后者的有效计算方案。具体来说,具有二次代价的OMT可以看作是20世纪30年代初Schr\ odinger提出的问题的零温度极限。后者相当于亥姆霍兹自由能在概率分布上的最小化,这些概率分布被限制为具有两个给定的边际。这个问题的特点是一个微妙的折衷,由温度参数调解,在最小化内能和最大化熵之间。这些概念是处理所谓的Sinkhorn算法的现代科学快速扩展领域的核心,该算法是1938年至1940年法国分析师Robert Fortet在更具挑战性的连续空间设置中专门研究Schr\ odinger桥的算法的一个特例。由于端点分布的限制,动态规划不是解决这些问题的合适工具。相反,Fortet的迭代算法和它的离散对应,Sinkhorn迭代,允许通过迭代求解所谓的Schr\ odinger系统来计算最优解。迭代的收敛性是通过在适当的度量(如希尔伯特射影度量)中沿着步长收缩来保证的。在连续和离散的时间和空间设置中,随机控制为一般Schr\ odinger桥问题及其零温度极限OMT问题的动态版本提供了一个重新表述和上下文。这些问题,反过来,自然会导致一次性边际流动的控制问题,这代表了控制不确定性的新范式。连续时空条件下的零温度问题是OMT中themcann位移插值流的著名的Benamou—Brenier表征。近年来,这些概率分布流控制问题背后的形式主义和技术引起了人们的极大关注,因为它们导致了航天器制导、机器人或生物群控制、传感、主动冷却和网络路由以及计算机和数据科学等领域的各种新应用。这个多方面和多功能的框架,将SBP和OMT交织在一起,为历史和技术概述提供了基础。接受发表(修订版)2020年10月29日;于2021年5月6日以电子方式发布。https://doi.org/10.1137/20M1339982资助:本研究由美国国家科学基金会(NSF)资助1807664,1839441,1901599和1942523,AFOSR资助FA9550-17-1-0435,以及帕多瓦大学研究项目CPDA 140897部分支持。美国佐治亚理工学院航空航天工程学院,佐治亚州亚特兰大30332 (yongchen@gatech.edu)。美国加州大学尔湾分校机械与航天工程系,CA 92697 USA (tryphon@uci.edu)。“图里奥·列维-奇维塔数学学系”,“帕多瓦大学”,意大利帕多瓦35121 (pavon@math.unipd.it)。249 D噢问oa de D 11/0 9/21 62 47。1。2 13 1。11 R ed tr ib ut io n苏bj ec t t o如果M李ce ns e或c op年ig ht;请参阅TTP: //请参阅TTP: //请参阅TTP: //请参阅TTP: //请参阅TTP: //请参阅TTP: //请参阅TTP
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge
In 1931--1932, Erwin Schr\"odinger studied a hot gas Gedankenexperiment (an instance of large deviations of the empirical distribution). Schr\"odinger's problem represents an early example of a fundamental inference method, the so-called maximum entropy method, having roots in Boltzmann's work and being developed in subsequent years by Jaynes, Burg, Dempster, and Csisz\'ar. The problem, known as the Schr\" odinger bridge problem (SBP) with ``uniform"" prior, was more recently recognized as a regularization of the Monge-Kantorovich optimal mass transport (OMT) problem, leading to effective computational schemes for the latter. Specifically, OMT with quadratic cost may be viewed as a zerotemperature limit of the problem posed by Schr\"odinger in the early 1930s. The latter amounts to minimization of Helmholtz's free energy over probability distributions that are constrained to possess two given marginals. The problem features a delicate compromise, mediated by a temperature parameter, between minimizing the internal energy and maximizing the entropy. These concepts are central to a rapidly expanding area of modern science dealing with the so-called Sinkhorn algorithm, which appears as a special case of an algorithm first studied in the more challenging continuous space setting by the French analyst Robert Fortet in 1938--1940 specifically for Schr\"odinger bridges. Due to the constraint on end-point distributions, dynamic programming is not a suitable tool to attack these problems. Instead, Fortet's iterative algorithm and its discrete counterpart, the Sinkhorn iteration, permit computation of the optimal solution by iteratively solving the so-called Schr\" odinger system. Convergence of the iteration is guaranteed by contraction along the steps in suitable metrics, such as Hilbert's projective metric. In both the continuous as well as the discrete time and space settings, stochastic control provides a reformulation of and a context for the dynamic versions of general Schr\" odinger bridge problems and of their zero-temperature limit, the OMT problem. These problems, in turn, naturally lead to steering problems for flows of one-time marginals which represent a new paradigm for controlling uncertainty. The zero-temperature problem in the continuous-time and space setting turns out to be the celebrated Benamou--Brenier characterization of theMcCann displacement interpolation flow in OMT. The formalism and techniques behind these control problems on flows of probability distributions have attracted significant attention in recent years as they lead to a variety of new applications in spacecraft guidance, control of robot or biological swarms, sensing, active cooling, and network routing as well as in computer and data science. This multifaceted and versatile framework, intertwining SBP and OMT, provides the substrate for the historical and technical overview \ast Received by the editors May 22, 2020; accepted for publication (in revised form) October 29, 2020; published electronically May 6, 2021. https://doi.org/10.1137/20M1339982 Funding: This work was partially supported by the NSF under grants 1807664, 1839441, 1901599, and 1942523, by the AFOSR under grant FA9550-17-1-0435, and by University of Padova Research Project CPDA 140897. \dagger School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (yongchen@gatech.edu). \ddagger Department of Mechanical and Aerospace Engineering, University of California, Irvine, CA 92697 USA (tryphon@uci.edu). \S Dipartimento di Matematica ``Tullio Levi-Civita,"" Universit\` a di Padova, 35121 Padova, Italy (pavon@math.unipd.it). 249 D ow nl oa de d 11 /0 9/ 21 to 1 47 .1 62 .2 13 .1 11 R ed is tr ib ut io n su bj ec t t o SI A M li ce ns e or c op yr ig ht ; s ee h ttp s: //e pu bs .s ia m .o rg /p ag e/ te rm s
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
SIAM Review
SIAM Review 数学-应用数学
CiteScore
16.90
自引率
0.00%
发文量
50
期刊介绍: Survey and Review feature papers that provide an integrative and current viewpoint on important topics in applied or computational mathematics and scientific computing. These papers aim to offer a comprehensive perspective on the subject matter. Research Spotlights publish concise research papers in applied and computational mathematics that are of interest to a wide range of readers in SIAM Review. The papers in this section present innovative ideas that are clearly explained and motivated. They stand out from regular publications in specific SIAM journals due to their accessibility and potential for widespread and long-lasting influence.
期刊最新文献
Combinatorial and Hodge Laplacians: Similarities and Differences Cardinality Minimization, Constraints, and Regularization: A Survey When Data Driven Reduced Order Modeling Meets Full Waveform Inversion Survey and Review SIGEST
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1