Change point — where it appears
Named by 7 essays across 3 fields — each of them below, with the objects they name alongside it.
A break that was looked for
A two-regime whitening finds its change point by maximising a profile, and then reads a criterion that counts parameters. Under no break there is no parameter to count, because every position describes the same model.
Two effects in one number
How much two searches over one sample share is measured as the net of two things — ground both of them find, and configurations only the joint search reaches. One extra supremum per draw separates them exactly.
A search that is already the other
A break search shifts every coefficient after a row, so a step column is one of the directions it can move in. Paired with a dictionary of them it reads exactly one, on every draw, and that fixes the top of the scale.
What a search costs in parameters
An information criterion's penalty is an estimate of the optimism a fit carries. For a break point the optimism can be measured and cannot be counted, and it comes to about two and a half parameters.
A split that depends on the order
Run the second search first and pin that instead, and the same draw gives a different overlap and a different interaction — with the same difference. And one pair has no second order at all.
Choosing whether to break
Charging what the search manufactures takes a rule from splitting a stationary sample on 99% of draws to 16%. It also costs regret, because the two mistakes a rule can make are not the same size.
A second break on a flat profile
Searching a hundred and twenty rows for one change point manufactures five units of likelihood. Searching for a second manufactures four more, on a series that has at most one — and on a profile whose whole range is under seven.
Named alongside it
The objects these essays reach for when they reach for this one.
Likelihood ratioSelection effectSpecification searchStructural breakSupremum statisticIdentificationDegrees of freedomInformation criterionModel selectionProfile likelihoodBasis functionsCombinatorial search