arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.04062math.OCmath.PR
收藏

离散时间中的因果输运及其应用

Causal transport in discrete time and applications

Julio Backhoff Veraguas, Mathias Beiglböck, Yiqing Lin, Anastasiia Zalashko

摘要:

不严格地说,因果交通计划是适应过程的放松,就像康托洛维奇交通计划扩展蒙格型交通地图一样。相应的因果版本的运输问题最近介绍了拉萨尔。工作在离散时间设置,我们建立了一个动态规划原则,因果运输问题的运输问题,最近考虑的一般成本Gozlan等人。基于这个递归的原则,我们给出的条件下,著名的Knothe-Rosenblatt重排可以被看作是一个因果模拟的Brenier的地图。此外,这些考虑提供了运输信息不等式的随机过程之间的嵌套距离Pflug和Pichler开创的,因此用于衡量不同的噪声分布驱动的随机程序之间的差异。

英文摘要:

Loosely speaking, causal transport plans are a relaxation of adapted processes in the same sense as Kantorovich transport plans extend Monge-type transport maps. The corresponding causal version of the transport problem has recently been introduced by Lassalle. Working in a discrete time setup, we establish a dynamic programming principle that links the causal transport problem to the transport problem for general costs recently considered by Gozlan et al. Based on this recursive principle, we give conditions under which the celebrated Knothe-Rosenblatt rearrangement can be viewed as a causal analogue to the Brenier's map. Moreover, these considerations provide transport-information inequalities for the nested distance between stochastic processes pioneered by Pflug and Pichler, and so serve to gauge the discrepancy between stochastic programs driven by different noise distributions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑