ReLU deep neural networks from the hierarchical basis perspective[Formula presented]

N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study ReLU deep neural networks (DNNs) by investigating their connections with the hierarchical basis method in finite element methods. First, we show that the approximation schemes of ReLU DNNs for x2 and xy are composition versions of the hierarchical basis approximation for these two functions. Based on this fact, we obtain a geometric interpretation and systematic proof for the approximation result of ReLU DNNs for polynomials, which plays an important role in a series of recent exponential approximation results of ReLU DNNs. Through our investigation of connections between ReLU DNNs and the hierarchical basis approximation for x2 and xy, we show that ReLU DNNs with this special structure can be applied only to approximate quadratic functions. Furthermore, we obtain a concise representation to explicitly reproduce any linear finite element function on a two-dimensional uniform mesh by using ReLU DNNs with only two hidden layers.

Cite

CITATION STYLE

APA

He, J., Li, L., & Xu, J. (2022). ReLU deep neural networks from the hierarchical basis perspective[Formula presented]. Computers and Mathematics with Applications, 120, 105–114. https://doi.org/10.1016/j.camwa.2022.06.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free