arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.05372cs.CCmath.DS
收藏

遍历测度计算中的紧空间-噪声折衷

Tight space-noise tradeoffs in computing the ergodic measure

Mark Braverman, Cristobal Rojas, Jon Schneider

摘要:

本文给出了高斯噪声影响下低维离散动力系统遍历测度计算的空间复杂度的严格界。如果噪声的尺度是$\varepsilon$,并且描述系统演化的函数本身不是计算复杂性的来源,则遍历测度的密度函数可以在$\log 1/\varepsilon+\log\log 1/δ$中的空间多项式中的精确$δ$内近似。我们还表明,这个界是紧多项式的因素。在证明上述结果的过程中,我们证明了一个在空间有界计算中独立有趣的结果:在$n$中,可以用$n$矩阵对$n$进行指数化,使其在空间多项式中的幂指数化.

英文摘要:

In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is $\varepsilon$, and the function describing the evolution of the system is not by itself a source of computational complexity, then the density function of the ergodic measure can be approximated within precision $δ$ in space polynomial in $\log 1/\varepsilon+\log\log 1/δ$. We also show that this bound is tight up to polynomial factors. In the course of showing the above, we prove a result of independent interest in space-bounded computation: that it is possible to exponentiate an $n$ by $n$ matrix to an exponentially large power in space polylogarithmic in $n$.

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

↑