arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.10102cs.LGcs.NAmath.DSmath.NA
收藏

遍历伊藤扩散机器学习中不变统计量的误差界

Error Bounds of the Invariant Statistics in Machine Learning of Ergodic Itô Diffusions

The Pennsylvania State University(宾夕法尼亚州立大学);Institute for Computational and Data Sciences(计算与数据科学研究所)

He Zhang, John Harlim, Xiantao Li

摘要:

本文研究了遍历伊藤扩散的机器学习的理论基础。我们的目标是了解的收敛特性的不变统计时,基本系统的随机微分方程(SDES)的经验估计与监督回归框架。利用遍历马尔可夫链的扰动理论和线性响应理论,推导出一点和两点不变统计量的误差与漂移和扩散系数的学习误差的线性关系.更重要的是,我们的研究表明,学习泛化误差的通常$L^2$ -范数特征不足以实现这种线性相关结果。我们发现,这样的线性相关性结果的充分条件是通过学习算法,产生一个一致的Lipschitz和一致的估计在假设空间中,保留某些特性的漂移系数,如通常的线性增长条件,保证存在的解决方案的基础SDES。我们在两个很好理解的学习算法上检查这些条件:基于内核的谱回归方法和具有ReLU激活函数的浅层随机神经网络。

英文摘要:

This paper studies the theoretical underpinnings of machine learning of ergodic Itô diffusions. The objective is to understand the convergence properties of the invariant statistics when the underlying system of stochastic differential equations (SDEs) is empirically estimated with a supervised regression framework. Using the perturbation theory of ergodic Markov chains and the linear response theory, we deduce a linear dependence of the errors of one-point and two-point invariant statistics on the error in the learning of the drift and diffusion coefficients. More importantly, our study shows that the usual $L^2$-norm characterization of the learning generalization error is insufficient for achieving this linear dependence result. We find that sufficient conditions for such a linear dependence result are through learning algorithms that produce a uniformly Lipschitz and consistent estimator in the hypothesis space that retains certain characteristics of the drift coefficients, such as the usual linear growth condition that guarantees the existence of solutions of the underlying SDEs. We examine these conditions on two well-understood learning algorithms: the kernel-based spectral regression method and the shallow random neural networks with the ReLU activation function.

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

↑