arXiv Analytics

Sign in

arXiv:2312.14276 [math.NA]AbstractReferencesReviewsResources

Deep Neural Networks and Finite Elements of Any Order on Arbitrary Dimensions

Juncai He, Jinchao Xu

Published 2023-12-21Version 1

In this study, we establish that deep neural networks employing ReLU and ReLU$^2$ activation functions are capable of representing Lagrange finite element functions of any order on simplicial meshes across arbitrary dimensions. We introduce a novel global formulation of the basis functions for Lagrange elements, grounded in a geometric decomposition of these elements and leveraging two essential properties of high-dimensional simplicial meshes and barycentric coordinate functions. This representation theory facilitates a natural approximation result for such deep neural networks. Our findings present the first demonstration of how deep neural networks can systematically generate general continuous piecewise polynomial functions.

Related articles: Most relevant | Search more
arXiv:2105.12080 [math.NA] (Published 2021-05-25)
Operator Compression with Deep Neural Networks
arXiv:1803.00092 [math.NA] (Published 2018-02-28)
NETT: Solving Inverse Problems with Deep Neural Networks
arXiv:2404.03761 [math.NA] (Published 2024-04-04)
Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks