arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.11858math.STmath.DSstat.MLstat.TH
收藏

平稳最优输运计划的估计

Estimation of Stationary Optimal Transport Plans

Kevin O'Connor, Kevin McGoff, Andrew B Nobel

摘要:

研究了取值于有限空间的平稳随机过程的最优输运问题。为了反映底层过程的平稳性,我们将注意力限制在平稳耦合上,也称为连接。由此产生的最优连接问题捕获感兴趣的过程的长期平均行为的差异。我们引入最优连接和最优连接成本的估计,我们建立在温和的条件下的估计的一致性。此外,在更强的混合假设下,我们建立了有限样本差错率的估计最佳连接成本,扩展了最知名的结果在iid的情况下。最后,我们将一致性和速率分析扩展到最优加入问题的熵惩罚版本。

英文摘要:

We study optimal transport for stationary stochastic processes taking values in finite spaces. In order to reflect the stationarity of the underlying processes, we restrict attention to stationary couplings, also known as joinings. The resulting optimal joining problem captures differences in the long run average behavior of the processes of interest. We introduce estimators of both optimal joinings and the optimal joining cost, and we establish consistency of the estimators under mild conditions. Furthermore, under stronger mixing assumptions we establish finite-sample error rates for the estimated optimal joining cost that extend the best known results in the iid case. Finally, we extend the consistency and rate analysis to an entropy-penalized version of the optimal joining problem.

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

↑