GradVis
None
view repo
Current training methods for deep neural networks boil down to very high dimensional and non-convex optimization problems which are usually solved by a wide range of stochastic gradient descent methods. While these approaches tend to work in practice, there are still many gaps in the theoretical understanding of key aspects like convergence and generalization guarantees, which are induced by the properties of the optimization surface (loss landscape). In order to gain deeper insights, a number of recent publications proposed methods to visualize and analyze the optimization surfaces. However, the computational cost of these methods are very high, making it hardly possible to use them on larger networks. In this paper, we present the GradVis Toolbox, an open source library for efficient and scalable visualization and analysis of deep neural network loss landscapes in Tensorflow and PyTorch. Introducing more efficient mathematical formulations and a novel parallelization scheme, GradVis allows to plot 2d and 3d projections of optimization surfaces and trajectories, as well as high resolution second order gradient information for large networks.
READ FULL TEXT VIEW PDF
First-order methods such as stochastic gradient descent (SGD) are curren...
05/28/2019 ∙ by Tianle Cai, et al. ∙
0
∙
share
read it
We explain that the difficulties of training deep neural networks come f...
08/02/2017 ∙ by Chengxi Ye, et al. ∙
0
∙
share
read it
Learning to optimize - the idea that we can learn from data algorithms t...
01/22/2018 ∙ by Louis Faury, et al. ∙
0
∙
share
read it
Nonconvex optimization problems such as the ones in training deep neural...
05/30/2015 ∙ by Martin Arjovsky, et al. ∙
0
∙
share
read it
Minimizing non-convex and high-dimensional objective functions is
challe...
03/13/2017 ∙ by Nanyang Ye, et al. ∙
0
∙
share
read it
Numerically locating the critical points of non-convex surfaces is a
lon...
01/29/2019 ∙ by Charles G. Frye, et al. ∙
0
∙
share
read it
In this paper, we reveal the importance and benefits of introducing
seco...
03/20/2017 ∙ by Yan Wang, et al. ∙
0
∙
share
read it
None
Training neural networks is a NP-hard problem [3]
, as it requires finding minima of a high-dimensional non-convex loss function. In practice, most theoretical implications of the non-convexity are simply ignored by the deep learning community and it has become the standard approach to use methods that only provide convergence guarantees for convex problems. In most cases, optimizers such as Stochastic Gradient Descent (SGD)
[14] are actually able to converge into local minima. However, while this approach appears to be working in practice, there is still a wide range of open theoretical questions associated with these optimization problems. Some of which could have major impact on the practical application, like the current discussion about the affect of minima shapes on the generalization abilities of the resulting model.These seemingly contradicting results can be explained
by their different approaches to measure flatness.
[6] showed that one can
reparametrize the loss function, thereby altering the geometry of the parameter
space without affecting how the network evaluates unseen data. Hence,
one can simply reparametrize the weights in a neural network layer
without changing the value of the loss function^{1}^{1}1 This is true for positively
homogeneous layer activations (e.g. ReLUs) and batch-norm layers
[11]. As a result, one is able to make minima
seem arbitrarily sharp or wide..
This current discussion shows, that it is necessary to gain further theoretical insights into these optimization problems. A crucial contribution to such efforts
could come from tools for the visualization and high resolution quantification of loss surface properties during the training process.
First attempts to visualize loss landscapes were presented by [9]. The authors drew samples along a line in weight space, connecting the initialization point to the converged minimum. Along this line, the loss is calculated and plotted. As one result of their experiments, they were able to show that the loss along this line follows a monotonically decreasing path. [17] introduced a new method on how to visualize the loss landscape. Their main contribution is to use filter-wise normalization to combat the scaling invariance of the weights. The authors also use a PCA [21] on the training paths, reducing the problem onto a 2D plane. The landscape is then plotted by spanning a plane in parameter space around the converged point and taking the loss at each point on this plane. Since PCA’s complexity is cubic, both in the number of samples and their dimensionality, and comes with high memory demands, it is quite difficult to implement this approach for larger networks. Additionally, this approach has been criticised by [2], who showed that performing PCA on high-dimensional random walks always results in Lissajous trajectories. They argue that the training trajectory, if plotted using PCA, always performs the same patterns, thereby rendering the information one can extract from the trajectory useless.
Another approach to gain further insight into the loss landscape is to compute the eigenvalues of the Hessian at different points in parameter space. The eigenvalues of the Hessian are a measure of curvature of the loss landscape. Positive eigenvalues correspond to positive curvature along its corresponding eigenvector, meaning the network is inside a minimum in this direction. Also its magnitude corresponds to how steep this minimum is. Calculating the eigenvalues of the Hessian of a neural network has a complexity of
. For regular networks with parameters in the range of , this is infeasible to compute. Especially for all of the usualevaluations points during the iterations of the optimization process. Therefore, in order to compute the full eigenvalue spectrum, we adopt two common compute ”tricks” from other fields: First we are able to compute the Hessian-vector product efficiently in
instead of without having to store the Hessian during this process. This is done by using the R-operator [20], which is a linear operator that wraps around the forward and backward propagation in order to compute the Hessian-vector product. Second, by using the Lanczos algorithm [16], it only requires the Hessian-vector product to compute the eigenvalues. As [8] shows, one can approximate the full eigenvalue spectrum by only performing Lanczos iteration steps and by then diagonalizing the resulting tridiagonal matrix. This procedure is done times with different starting vectors. Using the resulting eigenvalues and eigenvectors of this tridiagonal matrix, one can approximate the full eigenvalue spectrum using Gaussians to high accuracy in only . The first paper to apply this method for neural networks was [18]. Through out this paper, we largely follow the notation of [7], using the stochastic Lanczos quadrature algorithm.In this paper, we present an open source toolbox^{2}^{2}2GradVis will be released on GitHub after acceptance of this paper for Python which is both compatible with Tensorflow [1] and PyTorch [19], introducing and implementing efficient and scalable algorithms for the analysis of loss surfaces during the training of deep neural networks. GradVis enables the user to visualize the trajectory of their model as well as the loss landscape and the eigenvalues of its Hessian. We propose efficient mathematical formulations of the key operators and a novel parallelization scheme that allows the investigation of the optimization process using practically relevant neural networks. First experiments show how the combination of visualizing the loss landscape and plotting the eigenvalue density spectrum leads to further insights into DNN training. In detail, our contributions are:
Implementing efficient mathematical formulations for the computation of the Eigenvalue spectrum of the Hessian, reducing the complexity.
Introducing a novel method-parallelization computation of the Eigenvalue spectrum, improving the parallel efficiency from of a data-parallel approach to over
We propose a solution to finding good directions in the high dimensional loss landscape for visualization, solving the problem of using a PCA for the approximation of the trajectory, as discussed in [2].
Using our fast methods, we conducted several experiments that were (to our best knowledge) not possible before:
Computing the eigenvalue density spectrum at every iteration, crating high resolution videos of the trajectories and second order information while training a neural network.
Plotting a high resolution loss landscape in between two minima and analysing the eigenvalue density spectrum at all intermediate points
The Toolbox visualizes loss landscapes by projecting it onto two directional vectors in parameter space and . It normalizes them and plots the loss along the plane that is spanned by those directions:
(1) |
where corresponds to the converged point in weight space.
Following [17], the Visualization Toolbox performs filter-wise normalization on the weights of the network to overcome the scale invariance of the parameter space. Given weights of a convolutional filter , filter wise-normalization performs the following operation:
(2) |
where are the convolution weights of the directional vector and corresponds to the jth filter for the ith convolution inside the neural network. corresponds to the Frobenius norm. The directional vector
is either a random Gaussian vector, a custom vector provided by the user or it is calculated using principal component analysis (PCA) over all the saved iterations. All batch-norm parameters are set to zero.
PCA is a dimensionality reduction method. It allows finding the direction and magnitude of maximum data variation to the inverse of the covariance matrix [4]. The Toolbox can perform a PCA over the training runs where are the networks weights at a certain iteration. We obtain the first two PCA directions and .
The pseudocode is described in Algorithm 1.
The stochastic Lanczos quadrature algorithm [16] is a method for the approximation of the eigenvalue density of very large matrices. The eigenvalue density spectrum is given by:
(3) |
where is the number of parameters in the network and is the i-th eigenvalue of the Hessian.
The eigenvalue density spectrum is approximated by a sum of Gaussian functions:
(4) |
where
(5) |
We use the Lanczos algorithm with full reorthogonalization in order to compute eigenvalues and eigenvectors of the Hessian and to ensure orthogonality between the different eigenvectors. Since the Hessian is symmetric we can diagonalize it. All eigenvalues will be real. The Lanczos algorithm returns a tridiagonal matrix. This matrix is diagonalized:
(6) |
By setting and
, the resulting eigenvalues and eigenvectors are used to estimate the true eigenvalue density spectrum:
(7) |
(8) |
The pseudocode for the stochastic Lanczos quadrature algorithm is shown in Algorithm 2.
Data-Parallel Visualization. The visualization method is trivially parallelizable by assigning parts of the evaluation grid to different workers. After each worker is done computing its values, the master-worker collects the values of each worker using MPI_Gatherv. The peudocode for the parallelized version is shown in Algorithm 3.
Data-Parallel Lanczos. The Lanczos algorithm only requires the Hessian-vector product instead of the full Hessian matrix in order to compute eigenvalues. This allows using the R-operator to calculate these products effieciently. Using MPI, we distribute the batches to different workers, where each worker accumulates its own Hessian-vector products by using the R-operator. After all workers are done computing their batches the resulting vectors are sent to the master-worker and summed by using the MPI_Reduce operation. The pseudocode is shown in Algorithm 4.
This data parallel approach allowed us to use far more samples in our eigenvalue spectrum computation. Future research could look into model parallelism as well, since the R-operator works exactly like a neural network with forward and backward propagation.
Novel Iteration-Parallel Lanczos. We introduce another approach to parallelize the Lanczos method, that proved to be much more scalable. The basic idea is to let each worker compute one iteration of the stochstic Lanczos quadrature algorithm for different initializations and then accumulating all the results at the end on the master-worker. This approach can be seen in Algorithm 5.
As seen in Algorithm 1, the toolbox evaluates the network on the training samples times, where N is the number of points on the grid along the x- and y-axis. On each grid point, the network evaluates batches and the evaluation of each batch takes time . Hence, the time to evaluate all the grid points is of the order of , with some overhead for the computation of the PCA components, as well as for performing the filter-wise normalization. But this overhead is small for large enough . For example, performing experiments with a Resnet-32 for a batch size of 256 and 2 batches resulted in and . Table 1 shows, that the overhead stays constant while computation time for the loss landscape scales like
Timing in seconds | ||||
---|---|---|---|---|
N=2 | N=10 | N=50 | N=100 | |
0.51 | 12.72 | 320 | 1890 | |
8.21 | 8.01 | 8.09 | 8.11 |
Scalability. The scalability is measured by measuring the speedup given by
(9) |
where is the time for one process and the time for
processes. In our setting each node contains two Nvidia GTX 1080ti GPUs and they are assigned sequentially by first filling one node and then populating the next node with increasing number of ranks. The standard deviation on the datapoints is calculated as follows:
(10) |
We measure strong scaling by keeping the problem size fixed and varying the number of GPUs, computing the parallelizable fraction according to Amdahls law:
(11) |
where is the parallelizable fraction of our implementation and refers to the number of GPUs working in parallel on the problem. For the stochstic Lanczos quadrature algorithm presented in Algorithm 5, the scaling plot is shown in Figure 2. One can see that fitting Formula 11 to our data we obtain a parallelizable fraction of . Comparing this to the data parallel approach, here we obtain the strong scaling plot in Figure 2.
Fitting the model yields a parallelizable fraction of , which much is worse than our novel method.
Here we see that we get a parallelizable fraction of . Due to the trivially parallelizable nature of the algorithm at hand, the parallelizable fraction is very high.
In order to circumvent the issue of using PCA on the training data (as discussed by [2]
), we propose using different eigenvectors to plot the loss landscape together with the trajectory. Here we make use of the Lanczos algorithm that we combined with the R-operator in order to efficiently compute Hessian-vector products. Since the Lanczos algorithm is an iterative eigenvalue solver we are able to pick certain eigenvectors we are interested in. Therefore, instead of choosing random directions or PCA directions we propose using eigenvectors in order to visualize the training trajectory on the loss landscape. We compare the different methods to find directions in order to plot the trajectory. First we choose two randomly initialized vectors with entries drawn from a normal distribution. The resulting plot is shown in Figure
6.Next we use PCA to extract the two directions with the highest variance. The resulting visualization is shown in Figure 6. Lastly we use our proposed method of choosing eigenvectors to plot the trajectory. Here we choose the eigenvectors corresponding to the highest two eigenvalues. The resulting plot can be seen in Figure 6.
We can see how the random direction method in Figure 6 provides little to no information on what happens during training. The loss landscape is very noisy and relatively flat, the training path barely moves from its initial position.
On the contrary, the PCA directions show the trajectory spiraling into the minimum, which is clearly visible. The path that the trajectory takes is exactly what one would expect [2], if a PCA is taken on a high-dimensional random walk with drift. Therefore even though it seems that the trajectory offers insight into the training procedure, in reality we will always get the same trajectory, thereby rendering this method useless.
Our proposed method on the other hand, shows how the trajectory moves along the gradient and after reaching the valley slowly creeps towards the minimum. This method also allows picking interesting eigenvalues where our network seems to ”fail” during training, such as negative or zero eigenvalues. This allows monitoring what the training trajectory was doing in these directions.
We present the loss landscape together with the trajectory of a LeNet architecture that is trained on CIFAR10 [15]
. The neural network is trained for 1 epoch with 196 iterations with a batch size of 256 and a learning rate of 0.001, using SGD. Also a momentum of 0.9 is used. After each iteration the weights of the model are saved onto the hard drive.
For visualization a grid size of N=50 is used with an additional border of 40 % around the trajectory. The evaluation uses of all the samples in the training set. The loss landscape is plotted along the two eigenvectors corresponding to the two highest eigenvalues of the Hessian. For the eigenvalue density plots iterations were used and iterations were performed in the Lanczos algorithm. Also 20% of the CIFAR10 samples were used. The resulting plots are shown in Figure 7. These only show a select number of plots out of the 196 generated ^{3}^{3}3A video of the full trajectory can be viewed on https://youtu.be/0AKSjp-SHlo.
At the beginning, during initialization the network finds itself inside a relatively flat saddle point with all eigenvalues being almost zero. The network struggles to escape this flat saddle point, it only manages to converge towards minima in some directions after 89 iterations, as seen in Figure 6(b).
One can see in Figure6(c), at the end of the first epoch after 196 iterations, the network has converged into minima in some dimensions, while overall the network still sits on a saddle point. The bulge on eigenvalues around zero has spread out a little bit more, meaning that in some dimensions the network sits at a maximum. Looking at the loss landscape, the network converged into a minimum in the depicted two dimensions. The trajectory oscillates around the minimum and it looks like the trajectory is about to escape the minimum again, which could be due to the fixed learning rate and the momentum which was used in SGD. Also, it seems that the loss landscape is convex in this area.
We train a LeNet network two times with different initializations on CIFAR10, using a SGD optimizer with a learning rate of and a momentum of . The batch size is and the network is trained for 10 epochs. The resulting minima are plotted using the visualization method with a grid size of and 20% of all samples. Both minima are connected by a straight line. We extract 20 points along the line connecting both minima. Using the stochastic lanczos quadrature with the same parameters as in section 3.3, we obtain Figure 8^{4}^{4}4A video showing all points connecting the minima can be viewed on https://youtu.be/8UIwPV6yU6I.
As show in Figure 8, the eigenvalues inside both minima indicate, that the network is sitting on a saddle point, as there are always small negative eigenvalues present. Also there are a few eigenvalues that are much bigger, indicating a sharp minimum in the corresponding eigenvector directions. Going toward the middle of the interpolation those big eigenvalues shift back towards zero. This shows that in between those minima we are still in a saddle point but there is no big maximum that separates them, which would be indicated by large negative eigenvalues.
Looking at the training of a LeNet architecture during its first epoch in Figure 7, one can observe that the network starts off at a flat saddle point and only gradually falls into minima in some directions. In most directions the network has zero eigenvalues and some are also negative. The negative eigenvalues also get more negative during training, which indicates that the network is located on a maximum in the direction of the corresponding eigenvector.
Comparing the different methods to plot the loss landscape together with the trajectory, we see that choosing random directions result in plots that show little to no information. Here the trajectory barely moves away from its initial position. The PCA directions seem to offer a good choice to plot the trajectory. But PCA actually chooses its directions in such a way that one always obtains the same figure of the trajectory. Therfore this method is insufficient in offering any useful information of the training procedure. On the other hand, one can see that choosing eigenvectors results in interesting directions where minima as well as trajectories are present. Here the trajectories always look different and represent the ”true” path taken by the optimizer. Looking at the eigenvalues of the interpolation between two different minima in Figure 8 one can observe that the area in between those two minima is relatively flat. Most positive eigenvalues get pushed toward zero while the negative ones are not changing by a lot compared to the minima. Also looking at the scalability of the algorithms, we see that the visualization method is highly parallelizable, this is to be expected as we are able to split the grid and each worker can compute its values independently. For the stochastic Lanczos quadrature algorithm our algorithm is also highly parallelizable, again this is possible because the different initializations in the outer loop of the algorithm are independent of each other. On the other hand, using data parallelism in this algotrithm is much less parallelizable. One reason could be that after each time the dataset has been computed, all GPUs have to wait on the algorithm to finish the rest of the computations for this iteration. Still, if one attempts to scale to hundreds of GPUs, the best approach would be to perform a mix of both approaches, as the number of independent iterations in the stochastic Lanczos quadrature algorithm is on a scale of . So using more GPUs than iterations to compute would make no sense, therefore the remaining ones could compute samples in a data parallel fashion.
The presented GradVis tool box now makes it feasible to compute high resolution (in terms of optimization space and iterations) visualizations of the loss surfaces, gradient trajectories and eigenvalue spectra of the Hessians of full training runs of practically relevant deep neural networks. Especially our fast implementation and novel scalable parallelization of the Lanczos algorithm will make GradVis a valuable tool towards a better theoretical understanding of SDG based optimizations methods for deep learning. First experimental results already show very interesting insights. The next step for future work will be to compute full scale evaluations for large prominent networks on large data sets, like ResNet on ImageNet.
TensorFlow: Large-scale machine learning on heterogeneous systems, 2015.
Software available from tensorflow.org.Proceedings of the First Annual Workshop on Computational Learning Theory
, COLT ’88, pages 9–18, San Francisco, CA, USA, 1988. Morgan Kaufmann Publishers Inc.