<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Information Entropy on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/information-entropy/</link><description>Recent content in Information Entropy on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 26 Jan 2026 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/information-entropy/index.xml" rel="self" type="application/rss+xml"/><item><title>ML Math Derivations (7): Decision Trees</title><link>https://www.chenk.top/en/ml-math-derivations/07-decision-trees/</link><pubDate>Mon, 26 Jan 2026 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/ml-math-derivations/07-decision-trees/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>Hook.&lt;/strong> A decision tree mimics how humans actually decide things: ask a question, branch on the answer, ask the next question. The math under that intuition is surprisingly rich — entropy from information theory tells us &lt;em>which&lt;/em> question to ask first, the Gini index gives a cheaper proxy that lands on essentially the same trees, and cost-complexity pruning gives a principled way to stop the tree from memorising noise. Almost every modern boosted ensemble (XGBoost, LightGBM, CatBoost) is just a clever sum of these objects, so getting the foundations right pays off many times over.&lt;/p></description></item></channel></rss>