Concept

Iteratively reweighted least squares — where it appears

The algorithm most robust fits are computed by: weight each row by its residual, refit, and repeat until nothing moves. The weights at convergence show what the loss decided about each row, and where the iteration starts can decide where it stops.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

Breakdown pointClosed formEfficiencyLeast trimmed squaresLeverageLocal minimumM estimatorMaskingOutliersRobust regressionHuber lossInfluence function

All concepts