Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 12:30:19 UTC

CMP.7:4.4 - Give an effective selection or update procedure

Choose how data and feedback change the candidate:

ConstructionEffective operationPrincipal condition
Select from a finite familyEvaluate each rule on the relevant examples and select by the stated criterion, with an explicit treatment of ties.The family and evaluations must be affordable.
Retain consistent candidatesRemove rules contradicted by newly observed feedback; use or combine the survivors.Every observed label used for elimination must agree with one fixed target rule in the initial family.
Optimize a parameterized criterionConstruct updates or search using CMP.6 or CMP.4, including initialization, constraint handling and stopping.Optimization progress and the meaning of the learning criterion both need their stated conditions.

For empirical risk minimization, a typical criterion is the average loss L_S(h)=(1/n)*sum loss(h(x_i),y_i). Regularization or another restriction can change the criterion. An argmin expression specifies the desired rule; the actual learner needs an obtaining procedure, including what it does when the minimum is not obtained or several rules tie.

Look for shared work and useful ordering. For thresholds, sorting examples once can let successive threshold scores be updated from counts rather than reevaluated on the whole dataset. CMP.3 supplies sharing when its identity conditions hold. For a parameterized learner, compare the work of one update, the updates needed and the later cost of applying the result.