arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.07976stat.MLcs.LG
收藏

二维深度ReLU卷积神经网络对Korobov函数的近似:一种构造性方法

Two-Dimensional Deep ReLU CNN Approximation for Korobov Functions: A Constructive Approach

Information and Engineering College, Dalian University(大连大学信息与工程学院);School of Mathematical Sciences and Shanghai Key Laboratory for Contemporary Applied Mathematics, Fudan University(复旦大学数学学院及上海当代应用数学重点实验室);School of Mathematical Sciences, Dalian University of Technology(大连理工大学数学学院);School of Mathematics and Statistics, University of Sydney(悉尼大学数学与统计学学院)

Qin Fang, Lei Shi, Min Xu, Ding-Xuan Zhou

AI总结:

本文研究二维深度卷积神经网络对Korobov函数的近似能力,提出构造性方法构建网络并分析复杂度,证明在连续权重选择模型下近似率接近最优,缓解维度诅咒。

摘要:

本文研究二维深度卷积神经网络对Korobov函数的近似能力,以Korobov函数为基准。我们关注由多通道卷积层(含零填充和ReLU激活)及全连接层组成的二维CNN。我们提出一种构建二维CNN以近似Korobov函数的构造性方法,并提供所构造网络复杂度的严格分析。我们的结果表明,在连续权重选择模型下,二维CNN实现接近最优的近似率,显著缓解了维度诅咒。本文为二维CNN提供了坚实的理论基础,并展示了其在函数近似中的广泛应用潜力。

英文摘要:

This paper investigates approximation capabilities of two-dimensional (2D) deep convolutional neural networks (CNNs), with Korobov functions serving as a benchmark. We focus on 2D CNNs, comprising multi-channel convolutional layers with zero-padding and ReLU activations, followed by a fully connected layer. We propose a fully constructive approach for building 2D CNNs to approximate Korobov functions and provide a rigorous analysis of the complexity of the constructed networks. Our results demonstrate that 2D CNNs achieve near-optimal approximation rates under the continuous weight selection model, significantly alleviating the curse of dimensionality. This work provides a solid theoretical foundation for 2D CNNs and illustrates their potential for broader applications in function approximation.

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

↑