[Machine Learning] Gradient Descent in Practice I - Feature Scaling

Feature scaling: it make gradient descent run much faster and converge in a lot fewer other iterations.
 
Bad cases:
[Machine Learning] Gradient Descent in Practice I - Feature Scaling
Good cases:
[Machine Learning] Gradient Descent in Practice I - Feature Scaling

We can speed up gradient descent by having each of our input values in roughly the same range. This is because θ will descend quickly on small ranges and slowly on large ranges, and so will oscillate inefficiently down to the optimum when the variables are very uneven.

The way to prevent this is to modify the ranges of our input variables so that they are all roughly the same. Ideally:

−1 ≤ x(i)? ≤ 1

or

−0.5 ≤ x(i)? ≤ 0.5

 

These aren‘t exact requirements; we are only trying to speed things up. The goal is to get all input variables into roughly one of these ranges, give or take a few.

Two techniques to help with this are feature scaling and mean normalization. Feature scaling involves dividing the input values by the range (i.e. the maximum value minus the minimum value) of the input variable, resulting in a new range of just 1. Mean normalization involves subtracting the average value for an input variable from the values for that input variable resulting in a new average value for the input variable of just zero. To implement both of these techniques, adjust your input values as shown in this formula:

[Machine Learning] Gradient Descent in Practice I - Feature Scaling

 

Example:

[Machine Learning] Gradient Descent in Practice I - Feature Scaling

(D)

[Machine Learning] Gradient Descent in Practice I - Feature Scaling

上一篇:Linux最常用命令(简单易学,但能解决95%以上的问题)


下一篇:Linux网络编程socket选项之SO_LINGER,SO_REUSEADDR