Improving Deep Neural Networks学习笔记(三)

5. Hyperparameter tuning

5.1 Tuning process

Hyperparameters:

α\alpha, β\beta, β1,β2,ϵ\beta_1,\beta_2, \epsilon, layers, hidden units, learning rate decay, mini-batch size.

The learning rate is the most important hyperparameter to tune. β\beta, mini-batch size and hidden units is second in importance to tune.

Try random values: Don’t use a grid. Corarse to fine.

5.2 Using an appropriate scale to pick hyperparameters

Appropriate scale to hyperparameters:

α=[0.0001,1]\alpha = [0.0001, 1], r = -4 * np.random.rand(), α=10r\alpha = 10^r.

If α=[10a,10b]\alpha = [10^a, 10^b], random pick from [a, b] uniformly, and set α=10r\alpha = 10^r.

Hyperparameters for exponentially weighted average

β=[0.9,0.999]\beta = [0.9, 0.999], don’t random pick from [0.9,0.999][0.9, 0.999]. Use 1−β=[0.001,0.1]1-\beta = [0.001, 0.1], use similar method lik α\alpha.

Why don’t use linear pick? Because when β\beta is close one, even if a little change, it will have a huge impact on algorithm.

5.3 Hyperparameters tuning in practice: Pandas vs Caviar

• Re-test hyperparamters occasionally
• Babysitting one model(Pandas)
• Training many models in parallel(Caviar)

6. Batch Normalization

6.1 Normalizing activations in a network

In logistic regression, normalizing inputs to speed up learning.

1. compute meansμ=1m∑ni=1x(i)\mu = \frac {1} {m} \sum_{i=1}^n x^{(i)}
2. subtract off the means from training set x=x−μx = x - \mu\
3. compute the variances σ2=1m∑ni=1x(i)2\sigma ^2 = \frac {1} {m} \sum_{i=1}^n {x^{(i)}}^2
4. normalize training set X=Xσ2X = \frac {X} {\sigma ^2}

Similarly, in order to speed up training neural network, we can normalize intermediate values in layers（z in hidden layer）, it is called Batch Normalization or Batch Norm.

Implementing Batch Norm

1. Given some intermediate value in neural network, z(1),z(2),...,z(m)z^{(1)}, z^{(2)},...,z^{(m)}
2. compute means μ=1m∑i=1z(i)\mu = \frac {1} {m} \sum_{i=1} z^{(i)}
3. compute the variances σ2=1m∑i=1(z(i)−μ)2\sigma ^2 = \frac {1} {m} \sum_{i=1} (z^{(i)} - \mu)^2
4. normalize zz, z(i)=z(i)−μ(σ2+ϵ)√z^{(i)} = \frac {z^{(i)} - \mu} {\sqrt {(\sigma ^2 + \epsilon)}}
5. compute ẑ \hat z, ẑ =γz(i)+β\hat z = \gamma z^{(i)} + \beta.

Now we have normalized Z to have mean zero and standard unit variance. But maybe it makes sense for hidden units to have a different distribution. So we use ẑ \hat z instead of zz, γ\gamma and β\beta are learnable parameters of your model.

6.2 Fitting Batch Norm into a neural network

Add Batch Norm to a network

X→Z→Ẑ →a→Z→Ẑ →a...X \rightarrow Z^{} \rightarrow {\hat Z^{}} \rightarrow {a^{}} \rightarrow Z^{} \rightarrow {\hat Z^{}} \rightarrow {a^{}}...

Parameters: W,bW^{}, b^{}, W,b...W^{}, b^{}... γ,β\gamma^{}, \beta^{}, γ,β...\gamma^{}, \beta^{}...

If you use Batch Norm, you need to computing means and subtracting means, so b[i]b^{[i]} is useless, so we can set b[i]=0b^{[i]} = 0 permanently.

6.3 Why does Batch Norm work?

Covariate Shift: You have learned a function from x→yx \rightarrow y, it works well. If the distribution of xx changes, you need to learn a new function to make it work well.

Hidden unit values change all the time, and so it’s suffering from the problem of covariate.

Batch Norm as regularization

• Each mini-batch is scaled by the mean/variance computed on just that mini-batch.
• This adds some noise to the values z[l]z^{[l]} within that mini-batch. So similar to dropout, it adds some noise to each hidden layer’s activations.
• This has a slight regularization effect.

6.4 Batch Norm at test time

In order to apply neural network at test time, come up with some seperate estimate of mu and sigma squared.

7. Multi-class classification

7.2 Training a softmax classifier

Hard max.

Loss function.

Gradient descent with softmax.

8. Programming Frameworks

8.1 Deep Learning frameworks

• Caffe/Caffe2
• TensorFlow
• Torch
• Theano
• mxnet
• Keras
• CNTK

Choosing deep learning frameworks

• Ease of programming (development and deployment)
• Running speed
• Truly open (open source with good governance)

0 条评论

相关文章

26530

82970

26020

深度学习: Jacobian矩阵 & Hessian矩阵

 Functions - Gradient, Jacobian and Hessian  Deep Learning Book

62230

354100

16650

33290

25960

向量和矩阵的各种范数比较（1范数、2范数、无穷范数等等

60930 