Cross-validation — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Choosing without knowing
Three published rules for choosing a regularisation parameter, scored against an oracle that requires the exact answer and is therefore not a method. Generalised cross-validation lands on the oracle's λ exactly; the discrepancy principle costs 6%; the L-curve costs 129%. And told a noise level ten times too small, the discrepancy principle's error goes from 0.112 to 10,449.
The degree that is safe to overshoot
The rules that choose a Tikhonov parameter miss by factors of millions on one draw in twenty. Transplanted to the degree of a polynomial fit, in a basis orthonormal on the data, the same rules never cost more than 2.7 times the best degree's error in three hundred draws. The reason is the shape of the valley they search: six degrees too few costs from 44 to 16,000 times the best error, forty degrees too many costs about twice it. The one rule with a tail, the discrepancy principle, has its threshold half a standard deviation above the residual it is waiting for.
Named alongside it
The objects these essays reach for when they reach for this one.
Discrepancy principleBias varianceGeneralised cross-validationIll-posed problemL-curveLeast-squaresLeverageNoise floorOrthonormal basisParameter choiceLeast squares by QRRegularisation