{'fraction_non_alphanumeric': 0.03107658157602664, 'fraction_numerical': 0.0022197558268590455, 'mean_word_length': 5.397163120567376, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Approximation in Lp(µ) with deep ReLU neural networks

We discuss the expressive power of neural networks which use the non-smooth ReLU activation function ϱ(x) = max{0, x} by analyzing the approximation theoretic properties of such networks. The existing results mainly fall into two categories: approximation using ReLU networks with a fixed depth, or using ReLU networks whose depth increases with the approximation accuracy. After reviewing these findings, we show that the results concerning networks with fixed depth—which up to now only consider approximation in Lp(λ) for the Lebesgue measure λ—can be generalized to approximation in Lp(µ), for any finite Borel measure µ. In particular, the generalized results apply in the usual setting of statistical learning theory, where one is interested in approximation in L2(ℙ), with the probability measure ℙ describing the distribution of the data.