2 layer neural networks as Wasserstein gradient flows: Difference between revisions
Paigehillen (talk | contribs) No edit summary |
Paigehillen (talk | contribs) No edit summary |
||
Line 11: | Line 11: | ||
: <math> f_N : D \times W \times U \rightarrow \mathbb{R}^k </math> | : <math> f_N : D \times W \times U \rightarrow \mathbb{R}^k </math> | ||
be given by <math> f_N(x, \omega_1, \dots, \omega_N,\theta_1, \dots, \theta_N) = \frac{1}{N} \sum_{i=1}^N \omega_i h(\theta_i,x) </math> where <math> h </math> is an activation function | be given by | ||
: <math> f_N(x, \omega_1, \dots, \omega_N,\theta_1, \dots, \theta_N) = \frac{1}{N} \sum_{i=1}^N \omega_i h(\theta_i,x) </math> | |||
where <math> h </math> is an activation function | |||
Revision as of 04:10, 10 February 2022
Artificial neural networks (ANNs) consist of layers of artificial "neurons" which take in information from the previous layer and output information to neurons in the next layer. Gradient descent is a common method for updating the weights of each neuron based on training data. While in practice every layer of a neural network has only finitely many neurons, it is beneficial to consider a neural network layer with infinitely many neurons, for the sake of developing a theory that explains how ANNs work. In particular, from this viewpoint the process of updating the neuron weights for a shallow neural network can be described by a Wasserstein gradient flow.
Motivation
Shallow Neural Networks
Let us introduce the mathematical framework and notation for a neural network with a single hidden layer. Let be open . The set represents the space of inputs into the network. There is some unknown function which we would like to approximate. Let be the number of neurons in the hidden layer. Define
be given by
where is an activation function