16.58 min read
Quadratic Approximation
You know the linear (first-order) approximation to at : . This is good "to first order."
The quadratic (second-order) approximation adds a curvature term using the Hessian:
This is the multivariable Taylor expansion up to second order. The factor comes directly from the in .
The approximation is "really good" near : the error goes to zero faster than . This is what it means to be a local quadratic approximation.
Formal View
Definition 16.4 — Local Quadratic Approximation
A quadratic function is a local quadratic approximation of at if
Theorem 16.3 — Existence and Uniqueness
A function has a local quadratic approximation at if and only if at . In this case the unique approximation is:
Why This Matters
The quadratic approximation is the foundation of second-order optimization: Newton's method, trust region methods, and more.
- Newton's method minimizes the local quadratic approximation at each step
- Fisher information matrix in statistics is a Hessian of the log-likelihood
- Curvature-aware learning rates in deep learning (AdaHessian, K-FAC)
- Structural analysis: the potential energy of a deformed structure is approximated quadratically
Quiz
Question 1
The quadratic approximation to at requires knowing:
Question 2
If is a critical point, the linear term vanishes from the quadratic approximation.
Question 3
The error in the quadratic approximation near behaves as:
Common Mistakes
- Forgetting the factor in the Hessian term of the quadratic approximation.
- Confusing the quadratic approximation (a local model) with the actual function values far from .
- Applying the quadratic approximation at a non-differentiable point.