mlsanityData to 7 Oct 2026

Approximation of Smoothness Classes by Deep Rectifier Networks

arXiv 2007.15645 ↗First posted 30 Jul 2020math.FA cs.LG cs.NAcited by 6

Not on the map. Why?

Abstract (arXiv)

We consider approximation rates of sparsely connected deep rectified linear unit (ReLU) and rectified power unit (RePU) neural networks for functions in Besov spaces Bαq(Lp) in arbitrary dimension d, on general domains. We show that alertdeep rectifier networks with a fixed activation function attain optimal or near to optimal approximation rates for functions in the Besov space Bατ(Lτ) on the critical embedding line 1/τ=α/d+1/p for arbitrary smoothness order α>0. Using interpolation theory, this implies that the entire range of smoothness classes at or above the critical line is (near to) optimally approximated by deep ReLU/RePU networks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1; 2025: 0; 2026: 1.

6 papers.