A local minimum is a point where a function has the smallest value among nearby points. It may be local without being the smallest value on the entire domain. section 4.1
Identify a candidate local minimum by:
- Finding points where the derivative is zero. section 4.1
- Checking that each candidate is a minimum rather than a maximum or saddle point. section 4.1
- Using repeated steps opposite the gradient to approach a local minimum during gradient descent. section 2.6
Function minimization
For f(x) = x**4 + 12*x + 1/x, search for points where the derivative is zero, then classify those points. The same idea scales to neural-network training: gradient descent adjusts weights opposite the loss gradient until a stopping criterion is reached. section 4.1 section 2.6
Inspect the compact function definition used for the minimization example. section 4.1








