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.9:8 - Common Anti-Patterns and How to Avoid Them

Tempting moveFailureUseful repair
Sample a convenient law and average without correctionThe estimate converges to another quantity.Derive the weighting or acceptance operation.
Call repeated rows independent drawsShared randomness or chain state can preserve dependence.Model their joint generation and its error consequence.
Assume stationary means already equilibratedThe initial transient can remain large.Establish sufficient mixing or qualify the finite result.
Inspect a fixed-n interval until it looks decisiveIts original coverage need not survive optional stopping.Fix the sample size or use a compatible sequential bound.
Replace uniform records by uniform entities silentlyMultiplicity changes inclusion probabilities.Change the sampling unit and its obtaining algorithm.