ReLU network approximation error conjecture
ReLU network approximation error conjecture
Let be the input domain and let satisfy . Let be the output of a ReLU network with trainable parameters , consisting of layers and neurons in each layer. Then there is a constant such that
ReLU approximation error conjecture. Under these assumptions, the displayed bound holds.
This conjecture is presented as an analogue for ReLU networks of a previously established result for Fourier-feature residual networks. It is intended to support complexity comparisons for residual multi-fidelity neural-network surrogates, but the source gives no proof or resolution.
Sources & referencesView supporting material
Primary source
Owen Davis, Mohammad Motamed and Raul Tempone, “Residual Multi-Fidelity Neural Network Computing”, arXiv:2310.03572 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.