<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Cross-Validation on The Standard Error</title><link>https://jongha-jeon-dev.github.io/standarderror/tags/cross-validation/</link><description>Recent content in Cross-Validation on The Standard Error</description><generator>Hugo -- 0.123.7</generator><language>en-gb</language><lastBuildDate>Tue, 13 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jongha-jeon-dev.github.io/standarderror/tags/cross-validation/index.xml" rel="self" type="application/rss+xml"/><item><title>ML 2: Cross-Validation Estimates the Error of a Model You Did Not Train</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-2-cv-target/</link><pubDate>Thu, 08 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-2-cv-target/</guid><description>K-fold CV is described as estimating how well your model will do. Where that is known exactly, the estimate is uncorrelated with it. What CV estimates is how models like yours do on average.</description></item><item><title>ML 3: Not Every Leak Leaks, and the Ones That Do Can Be Measured</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-3-leakage/</link><pubDate>Thu, 08 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-3-leakage/</guid><description>&amp;#39;Fit every preprocessing step inside the folds&amp;#39; is right, and taught as if every violation were equally bad. Measured, seven of them range from nothing to a third of the accuracy scale.</description></item><item><title>ML 13: Out-of-Bag Error Is Free, Pessimistic When Small and Blind to Copies</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-13-oob/</link><pubDate>Mon, 12 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-13-oob/</guid><description>A random forest estimates its own test error from the rows each tree did not see. With enough trees that is as good as cross-validation, for a sixth of the work. With few trees, or rows that are not independent, it is not.</description></item><item><title>ML 35: The Best Cross-Validated Score Is the Search's Best Luck</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-35-tuning/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-35-tuning/</guid><description>Cross-validation estimates one model fairly. The best of many cross-validated scores is the maximum of noisy estimates, and it overstates the model it picks.</description></item><item><title>ML 36: Shuffling a Time Series Is Safe Until the Errors Remember</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-36-time-series/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-36-time-series/</guid><description>The rule against shuffled folds is right for a reason that is narrower than time: something the model cannot see changing slowly. Forward splitting is not the cure it is sold as.</description></item><item><title>ML 37: Rows From the Same People Are Not New Data</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-37-subjects/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-37-subjects/</guid><description>When subjects contribute many rows each, row-level cross-validation measures how well the model knows the people it has met, and extra rows from the same people are worth little.</description></item><item><title>ML 44: Cross-Validation Folds Are Not Independent Samples, and the t-Test Assumes They Are</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-44-model-tests/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-44-model-tests/</guid><description>Two algorithms built to be exactly equal, compared 400 times. The most common test found a difference one time in seven, the most thorough-looking one more often than not, and three others were honest.</description></item></channel></rss>