arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.09211cs.LGcs.SYeess.SYmath.OCstat.ML
收藏

时间卷积网对输入输出映射的泛逼近

Universal Approximation of Input-Output Maps by Temporal Convolutional Nets

University of Illinois(伊利诺伊大学)

Joshua Hanson, Maxim Raginsky

摘要:

最近序列到序列建模从递归网络架构转移到卷积网络架构,这是由于在训练和操作中的计算优势,同时仍然实现了有竞争力的性能。对于具有有限的长期时间依赖性的系统,递归网络的近似能力基本上等同于时间卷积网络(TCN)。我们证明了TCN可以近似一个大类的输入-输出映射具有近似有限的内存任意容错。此外,我们根据网络的宽度和深度以及原始输入-输出映射的连续性模量推导出深度ReLU TCN的定量近似率,并将这些结果应用于允许有限维状态空间实现的系统的输入-输出映射(即,循环模型)。

英文摘要:

There has been a recent shift in sequence-to-sequence modeling from recurrent network architectures to convolutional network architectures due to computational advantages in training and operation while still achieving competitive performance. For systems having limited long-term temporal dependencies, the approximation capability of recurrent networks is essentially equivalent to that of temporal convolutional nets (TCNs). We prove that TCNs can approximate a large class of input-output maps having approximately finite memory to arbitrary error tolerance. Furthermore, we derive quantitative approximation rates for deep ReLU TCNs in terms of the width and depth of the network and modulus of continuity of the original input-output map, and apply these results to input-output maps of systems that admit finite-dimensional state-space realizations (i.e., recurrent models).

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

↑