BriefGPT.xyz
Dec, 2023
深度逼近空间的抽样复杂性
Sampling Complexity of Deep Approximation Spaces
HTML
PDF
Ahmed Abdeljawad, Philipp Grohs
TL;DR
基于信息复杂性工具,本研究扩展了先前工作,证明了存在可以用带有ReLU激活函数的神经网络进行任意速率逼近的函数,但其数值计算需要指数级增长的样本数量,并展示了对于ReQU激活函数类似的结果。
Abstract
While it is well-known that
neural networks
enjoy excellent
approximation capabilities
, it remains a big challenge to compute such approximations from point samples. Based on tools from
→