Tag
model-selection
- Jun 16, 2026 Cost-Complexity Pruning and the Weakest-Link Sequence How a maximal tree is collapsed into a nested family of subtrees indexed by one penalty parameter, and why the sequence makes cross-validation cheap. machine learning
- Mar 17, 2026 Kolmogorov Complexity and the Two-Part MDL Code Why the shortest program describing an object is uncomputable yet still useful, how the two-part minimum description length principle turns that idea into a model selection criterion, and where the criterion misleads. computation theory
- May 30, 2025 Cluster Validity, Stability, and Choosing the Number of Clusters Internal indices measure geometry that a clustering may not assume, stability is not a consistent selector, and chance-corrected agreement between resampled partitions answers a narrower question than it appears to. machine learning