CSpace
Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units
Li, Bo1,2,3; Tang, Shanshan4; Yu, Haijun1,2,3
2020-02-01
Source PublicationCOMMUNICATIONS IN COMPUTATIONAL PHYSICS
ISSN1815-2406
Volume27Issue:2Pages:379-411
AbstractDeep neural networks with rectified linear units (ReLU) are getting more and more popular due to their universal representation power and successful applications. Some theoretical progress regarding the approximation power of deep ReLU network for functions in Sobolev space and Korobov space have recently been made by [D. Yarotsky, Neural Network, 94:103-114, 2017] and [H. Montanelli and Q. Du, SIAM J Math. Data Sci., 1:78-92, 2019], etc. In this paper, we show that deep networks with rectified power units (RePU) can give better approximations for smooth functions than deep ReLU networks. Our analysis bases on classical polynomial approximation theory and some efficient algorithms proposed in this paper to convert polynomials into deep RePU networks of optimal size with no approximation error. Comparing to the results on ReLU networks, the sizes of RePU networks required to approximate functions in Sobolev space and Korobov space with an error tolerance epsilon, by our constructive proofs, are in general O(log1/epsilon) times smaller than the sizes of corresponding ReLU networks constructed in most of the existing literature. Comparing to the classical results of Mhaskar [Mhaskar, Adv. Comput. Math. 1:61-80, 1993], our constructions use less number of activation functions and numerically more stable, they can be served as good initials of deep RePU networks and further trained to break the limit of linear approximation theory. The functions represented by RePU networks are smooth functions, so they naturally fit in the places where derivatives are involved in the loss function.
KeywordDeep neural network high dimensional approximation sparse grids rectified linear unit rectified power unit rectified quadratic unit
DOI10.4208/cicp.OA-2019-0168
Indexed BySCI
Language英语
Funding ProjectChina National Program on Key Basic Research Project[2015CB856003] ; NNSFC[11771439] ; NNSFC[91852116] ; China Science Challenge Project[TZ2018001]
WOS Research AreaPhysics
WOS SubjectPhysics, Mathematical
WOS IDWOS:000501534800002
PublisherGLOBAL SCIENCE PRESS
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/50326
Collection中国科学院数学与系统科学研究院
Corresponding AuthorYu, Haijun
Affiliation1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, NCMIS, Beijing 100190, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, LSEC, Beijing 100190, Peoples R China
3.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
4.China Justice Big Data Inst, Beijing 100043, Peoples R China
Recommended Citation
GB/T 7714
Li, Bo,Tang, Shanshan,Yu, Haijun. Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units[J]. COMMUNICATIONS IN COMPUTATIONAL PHYSICS,2020,27(2):379-411.
APA Li, Bo,Tang, Shanshan,&Yu, Haijun.(2020).Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units.COMMUNICATIONS IN COMPUTATIONAL PHYSICS,27(2),379-411.
MLA Li, Bo,et al."Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units".COMMUNICATIONS IN COMPUTATIONAL PHYSICS 27.2(2020):379-411.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li, Bo]'s Articles
[Tang, Shanshan]'s Articles
[Yu, Haijun]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li, Bo]'s Articles
[Tang, Shanshan]'s Articles
[Yu, Haijun]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li, Bo]'s Articles
[Tang, Shanshan]'s Articles
[Yu, Haijun]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.