AI engineering glossary · Calculus optimisation
What is global minimum?
Global minimum: The point where a function takes its lowest value over its entire domain. Finding it is easy for convex functions, but for non-convex ones such as neural network losses optimisers usually settle for a good local minimum.
Global minimum: an example
f(x) = x^2 - 4x + 7 has its global minimum at x = 2, where f = 3.
Related terms
More Calculus optimisation terms
- Gradient
- Gradient accumulation
- Gradient checking
- Gradient clipping
- Gradient descent
- Hessian matrix
- Integral
- Jacobian matrix
Where you learn it
Global minimum is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.