Sign inSign in
ConceptAI & ML

Gauss-Newton method

An optimization algorithm that approximates the Hessian of a composite objective function by ignoring the second-order curvature of the model and assuming a squared error loss.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Graduate

    A heuristic iterative method for solving non-linear least squares problems by linearizing the residual function at each step and solving the resulting linear least squares problem.
    • 53:30Least-Norm Solutions of Underdetermined Equations

Connections

8

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.