user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Linearly Constrained Weights: Resolving the Vanishing Gradient Problem by Reducing Angle Bias

Paper content:
In this paper, we first identify \textit{angle bias}, a simple but remarkable phenomenon that causes the vanishing gradient problem in a multilayer perceptron (MLP) with sigmoid activation functions.
We then propose \textit{linearly constrained weights (LCW)} to reduce the angle bias in a neural network, so as to train the network under the constraints that the sum of the elements of each weight vector is zero.
A reparameterization technique is presented to efficiently train a model with LCW by embedding the constraints on weight vectors into the structure of the network.
Interestingly, batch normalization (Ioffe & Szegedy, 2015) can be viewed as a mechanism to correct angle bias.
Preliminary experiments show that LCW helps train a 100-layered MLP more efficiently than does batch normalization.
Neural networks with a single hidden layer have been shown to be universal approximators BID6 BID8 .
However, an exponential number of neurons may be necessary to approximate complex functions.
A solution to this problem is to use more hidden layers.
The representation power of a network increases exponentially with the addition of layers BID17 BID2 .
A major obstacle in training deep nets, that is, neural networks with many hidden layers, is the vanishing gradient problem.
Various techniques have been proposed for training deep nets, such as layer-wise pretraining BID5 , rectified linear units BID13 BID9 , variance-preserving initialization BID3 , and normalization layers BID7 BID4 .In
this paper, we first identify the angle bias that arises in the dot product of a nonzero vector and a random vector. The
mean of the dot product depends on the angle between the nonzero vector and the mean vector of the random vector. We
show that this simple phenomenon is a key cause of the vanishing gradient in a multilayer perceptron (MLP) with sigmoid activation functions. We
then propose the use of so-called linearly constrained weights (LCW) to reduce the angle bias in a neural network. LCW
is a weight vector subject to the constraint that the sum of its elements is zero. A reparameterization
technique is presented to embed the constraints on weight vectors into the structure of a neural network. This enables us to train
a neural network with LCW by using optimization solvers for unconstrained problems, such as stochastic gradient descent. Preliminary experiments
show that we can train a 100-layered MLP with sigmoid activation functions by reducing the angle bias in the network. Interestingly, batch normalization
BID7 can be viewed as a mechanism to correct angle bias in a neural network, although it was originally developed to overcome another problem, that is, the internal covariate shift problem. Preliminary experiments suggest that
LCW helps train deep MLPs more efficiently than does batch normalization.In Section 2, we define angle bias and discuss its relation to the vanishing gradient problem. In Section 3, we propose LCW as an approach
to reduce angle bias in a neural network. We also present a reparameterization technique
to efficiently train a model with LCW and an initialization method for LCW. In Section 4, we review related work; mainly,
we examine existing normalization techniques from the viewpoint of reducing the angle bias. In Section 5, we present empirical results that
show that it is possible to efficiently train a 100-layered MLP by reducing the angle bias using LCW. Finally, we conclude with a discussion of future
works.
In this paper, we have first identified the angle bias that arises in the dot product of a nonzero vector and a random vector.
The mean of the dot product depends on the angle between the nonzero vector and the mean vector of the random vector.
In a neural network, the preactivation value of a neuron is biased depending on the angle between the weight vector of the neuron and the mean of the activation vector in the previous layer.
We have shown that such biases cause a vanishing gradient in a neural network with sigmoid activation functions.
To overcome this problem, we have proposed linearly constrained weights to reduce the angle bias in a neural network; these can be learned efficiently by the reparameterization technique.
Preliminary experiments suggest that reducing the angle bias is essential to train deep MLPs with sigmoid activation functions.

assistant: text: We identify angle bias that causes the vanishing gradient problem in deep nets and propose an efficient method to reduce the bias.