Hessian of a Quadratic
Quadratic functions are the cleanest case. For with symmetric, let us compute the Hessian directly.
Expanding: . For off-diagonal terms : (using symmetry of ). For diagonal: .
The stunning conclusion: for a quadratic , the Hessian is constant and equal to everywhere: for all .
This means we can recover the quadratic from its Hessian: . Adding linear or constant terms to does not change the Hessian.
Formal View
Adding any linear term or constant does not change the Hessian — only the quadratic part contributes.
Why This Matters
Quadratics are the canonical second-order approximation to any smooth function. Understanding the quadratic case tells us how to interpret the Hessian at any point.
- Any smooth function looks like a quadratic near a point — the Hessian is its defining matrix
- Newton's method replaces the function with its local quadratic and minimizes that
- Quadratic programming (QP) solves optimization over quadratic objectives — foundational in robotics and control
- Understanding loss landscape curvature in neural networks via quadratic approximation
Quiz
For with symmetric, equals:
For , what is ?
For a general smooth function , the Hessian is constant (same at every point).
Given for a quadratic , how do we recover ?
Common Mistakes
- Forgetting the when reconstructing from — writing instead of .
- Assuming the Hessian of a non-quadratic is constant — only quadratics have constant Hessians.
- Forgetting to require symmetric when using this theorem.