Gradient ascent on the logistic log-likelihood from the parent note converges, but slowly and with a hand-tuned learning rate. Newton's method uses second-order (curvature) information to take much larger, self-scaling steps, typically converging in single-digit iterations on well-conditioned problems. This note derives the update and its per-iteration cost.
In this lesson
- Learning objectives
- Newton's method
- The Hessian of the logistic log-likelihood
- Worked example
Before you start
The full lesson, with worked examples and exercise solutions, is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Financial Machine Learning syllabus.