<?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>Random-Forest on The Standard Error</title><link>https://jongha-jeon-dev.github.io/standarderror/tags/random-forest/</link><description>Recent content in Random-Forest on The Standard Error</description><generator>Hugo -- 0.123.7</generator><language>en-gb</language><lastBuildDate>Mon, 12 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jongha-jeon-dev.github.io/standarderror/tags/random-forest/index.xml" rel="self" type="application/rss+xml"/><item><title>ML 9: The Bias–Variance U Belongs to a Knob, Not to Complexity</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-9-bias-variance/</link><pubDate>Thu, 08 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-9-bias-variance/</guid><description>Test error is said to be U-shaped in model complexity. Computed exactly, it is for the number of neighbours and is not for the number of trees: one knob trades bias for variance, the other only averages.</description></item><item><title>ML 12: Impurity Importance Rewards Features With Many Places to Split</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-12-impurity/</link><pubDate>Mon, 12 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-12-impurity/</guid><description>A forest&amp;#39;s default feature importance is computed on the data it was fitted to. On a design where the answer is known, it never ranks the only useful feature first, and ranks it last in 19 of 20 datasets.</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 15: A Forest Cannot Predict Beyond the Largest Value It Has Seen</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-15-extrapolation/</link><pubDate>Mon, 12 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-15-extrapolation/</guid><description>Tree ensembles are said to approximate any function. Inside the training range they do; outside it their predictions go flat, below the largest label they saw, and the best single model becomes the worst.</description></item></channel></rss>