Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nonclosedness of Sets of Neural Networks in Sobolev Spaces

Published 23 Jul 2020 in stat.ML and cs.LG | (2007.11730v4)

Abstract: We examine the closedness of sets of realized neural networks of a fixed architecture in Sobolev spaces. For an exactly mm-times differentiable activation function ρ\rho, we construct a sequence of neural networks (Φn)n∈N(\Phi_n)_{n \in \mathbb{N}} whose realizations converge in order-(m−1)(m-1) Sobolev norm to a function that cannot be realized exactly by a neural network. Thus, sets of realized neural networks are not closed in order-(m−1)(m-1) Sobolev spaces W<sup>m−1,pW<sup>{m-1,p} for p∈[1,∞]p \in [1,\infty]. We further show that these sets are not closed in W<sup>m,pW<sup>{m,p} under slightly stronger conditions on the mm-th derivative of ρ\rho. For a real analytic activation function, we show that sets of realized neural networks are not closed in W<sup>k,pW<sup>{k,p} for any k∈Nk \in \mathbb{N}. The nonclosedness allows for approximation of non-network target functions with unbounded parameter growth. We partially characterize the rate of parameter growth for most activation functions by showing that a specific sequence of realized neural networks can approximate the activation function's derivative with weights increasing inversely proportional to the L<sup>pL<sup>p approximation error. Finally, we present experimental results showing that networks are capable of closely approximating non-network target functions with increasing parameters via training.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.