AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (217 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

On the uniform approximation estimation of deep ReLU networks via frequency decomposition

Liang Chen( )Wenjun Liu
Department of Mathematics, Jiujiang University, Jiujiang 332005, China
Show Author Information

Abstract

A recent line of works established the approximation complexity estimation of deep ReLU networks for the bandlimited functions in the MSE (mean square error) sense. In this note, we significantly enhance this result, that is, we estimate the approximation complexity in the L sense. The key to the proof is to establish a frequency decomposition lemma which may be of independent interest.

CLC number: 41A30, 41A63

References

【1】
【1】
 
 
AIMS Mathematics
Pages 19018-19025

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chen L, Liu W. On the uniform approximation estimation of deep ReLU networks via frequency decomposition. AIMS Mathematics, 2022, 7(10): 19018-19025. https://doi.org/10.3934/math.20221045

59

Views

0

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 30 March 2022
Revised: 07 August 2022
Accepted: 08 August 2022
Published: 15 October 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)