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 02:22:15 UTC · snapshot created 2026-10-03 03:38:22 UTC · last check 2026-10-03 04:30:10 UTC

CMP.7:8 - Common Anti-Patterns and How to Avoid Them

Misstep exposed by the methodConsequence and repair
Use zero training error as a prediction argumentIdentity and parity agree on the examples but disagree at 2. Retain the ambiguity or supply the selection basis relevant to further use.
Treat an optimization formula as the learning algorithmThe chosen rule can remain unobtainable. Supply effective selection or update with its computational cost.
Use feedback that the agent never receivesA bandit update can silently assume labels for unchosen actions. Match the operation to the actual observation regime.
Keep eliminating candidates after the fixed-target premise failsThe threshold example leaves no survivor. Revise the treatment of noise or change and its result conditions.
Assume more data or computation always resolves the failureAn inadequate family or wrong target can survive both. Locate the changed dependency before choosing more work.