Universal Approximation in Dropout Neural Networks

by   Oxana A. Manita, et al.

We prove two universal approximation theorems for a range of dropout neural networks. These are feed-forward neural networks in which each edge is given a random {0,1}-valued filter, that have two modes of operation: in the first each edge output is multiplied by its random filter, resulting in a random output, while in the second each edge output is multiplied by the expectation of its filter, leading to a deterministic output. It is common to use the random mode during training and the deterministic mode during testing and prediction. Both theorems are of the following form: Given a function to approximate and a threshold ε>0, there exists a dropout network that is ε-close in probability and in L^q. The first theorem applies to dropout networks in the random mode. It assumes little on the activation function, applies to a wide class of networks, and can even be applied to approximation schemes other than neural networks. The core is an algebraic property that shows that deterministic networks can be exactly matched in expectation by random networks. The second theorem makes stronger assumptions and gives a stronger result. Given a function to approximate, it provides existence of a network that approximates in both modes simultaneously. Proof components are a recursive replacement of edges by independent copies, and a special first-layer replacement that couples the resulting larger network to the input. The functions to be approximated are assumed to be elements of general normed spaces, and the approximations are measured in the corresponding norms. The networks are constructed explicitly. Because of the different methods of proof, the two results give independent insight into the approximation properties of random dropout networks. With this, we establish that dropout neural networks broadly satisfy a universal-approximation property.


page 1

page 2

page 3

page 4


Universal Approximation Theorems

The universal approximation theorem established the density of specific ...

A closer look at the approximation capabilities of neural networks

The universal approximation theorem, in one of its most general versions...

Abstract Universal Approximation for Neural Networks

With growing concerns about the safety and robustness of neural networks...

Universal Approximation Power of Deep Neural Networks via Nonlinear Control Theory

In this paper, we explain the universal approximation capabilities of de...

Dropout with Expectation-linear Regularization

Dropout, a simple and effective way to train deep neural networks, has l...

Noise-Resilient Designs for Optical Neural Networks

All analog signal processing is fundamentally subject to noise, and this...

The Indentifiable Elicitation Complexity of the Mode is Infinite

A property is a real- or vector-valued function on a set of probability ...

Please sign up or login with your details

Forgot password? Click here to reset