Decision trees are among the oldest and most widely deployed tools in machine learning. From the early rule-induction systems of the late 1970s to the CART algorithm of Breiman and colleagues in 1984 and the C4.5 system of Quinlan, the basic recipe has barely changed: recursively split the data along one feature at a time, choosing at each step the cut that maximizes the increase in purity. Random forests and gradient boosting machines built on this recipe now power everything from credit scoring to medical diagnosis. Yet a new study published in the journal Machine Learning by Qin-Cheng Zheng, Shao-Qun Zhang, Shen-Huan Lyu, Yuan Jiang and Zhi-Hua Zhou of Nanjing University and Hohai University reveals a startling theoretical blind spot at the heart of this forty-year-old procedure, and proposes an elegant fix based on a simple grid.
The blind spot concerns consistency, the property that as training data grows without bound, the learned classifier’s error converges to the best achievable error, known as the Bayes error. Consistency is the most fundamental guarantee one can ask of a learning algorithm: without it, there is no assurance that more data actually helps. For classical statistical methods such as kernel estimators and nearest-neighbor rules, consistency was established decades ago. For greedy decision tree algorithms like CART, however, the question has remained stubbornly open, even as the algorithms conquered industry. The new paper shows why the question is so hard, and why the answer is worse than many theorists feared.
The authors demonstrate a counterexample in which the worst-case purity gain of any possible split is exactly zero, even when the training error is far from zero. The construction is a real-valued analogue of the XOR problem: features are distributed uniformly on the unit square, and the target function is the exclusive OR of whether each coordinate exceeds one half. Every axis-aligned cut leaves both children with the same class balance as the parent, so the impurity, measured by a standard function such as the Gini index, does not decrease at all. Because greedy algorithms stop or stall when purity gain vanishes, a zero gain typically leads to a non-convergent training error. In other words, there exist perfectly reasonable learning problems on which the greedy purity-maximization heuristic that underlies CART simply cannot make progress.
This obstruction is not a marginal curiosity. The paper proves a sharp characterization: under a product feature distribution, a greedy tree learner obtains no purity gain if and only if it has already reached zero error. The proof exploits the strong concavity of standard impurity functions, which lower bounds the purity gain of any split by a quantity proportional to the squared difference of conditional class means between the two children. When that difference is zero everywhere, the target function must be constant within every leaf, which is precisely the condition of zero error. The result connects decision tree learning to the classical theory of influences of variables on Boolean functions, a field pioneered by Kahn, Kalai and Linial in 1988, and shows that the impurity measure acts as a potential whose decrease is tied to the variance of the target.
The escape route proposed by the authors is disarmingly simple: restrict candidate split points to a fixed grid. Their earlier work introduced GridCART, a decision tree in which cuts are allowed only at the boundaries of a uniform grid over each feature dimension. This restriction guarantees that whenever the target function is grid-aligned, meaning it is piecewise constant on grid cells, some split always yields strictly positive purity gain. The paper quantifies this with a lower bound showing that the best purity gain over grid cuts is at least the squared variance of the target divided by a polynomial in the number of grid pieces. A potential argument then shows that the impurity of the tree decays inversely with depth, yielding a fitting error of order N cubed over K, where N is the number of grid pieces and K the tree depth.
Combining this fitting guarantee with classical results on histogram density estimation and histogram classifiers produces the headline theorem: GridCART is consistent with a rate of order n to the power of minus one over d plus two, where n is the sample size and d the dimension, provided the conditional probability function is Lipschitz smooth and the features follow a product distribution. The rate is achieved by choosing the grid width on the order of n to the minus one over d plus two, which balances the bias of approximating a smooth function on coarse cells against the variance of estimating cell probabilities from finite samples. The analysis extends beyond binary classification to multiclass problems, where the rate picks up a factor of the number of classes, and to regression under squared loss, where an Efron-Stein inequality replaces the Boolean influence machinery.
The truly new contribution of this article, however, is the extension of the grid-based construction to ensemble methods. The authors introduce GridForest, a random forest in which each tree is grown on grid-restricted cuts with the usual random selection of a subset of features at every node. Because the best feature is included in the sampled subset with probability m over d, where m is the subset size, the potential decrease slows by exactly that factor, and the consistency analysis carries through with an extra d over m in the bound. Under an additional margin condition of the kind introduced by Audibert and Tsybakov, which assumes the conditional probability rarely sits near the decision boundary of one half, GridForest achieves a fast rate of n to the minus alpha plus one over d plus two, matching the optimal rates known for plug-in classifiers. The proof carefully handles boundary cells, density estimation error, and the transfer of guarantees from the estimated to the true distribution.
The third algorithm, GridGBDT, applies the same grid restriction to gradient boosting decision trees, the family of methods behind celebrated systems such as XGBoost, LightGBM and CatBoost. In the square-loss specialization analyzed here, each boosting round fits a grid-based regression tree to the current residuals on the histogram estimate. The authors prove a contraction lemma showing that the square root of the squared error contracts by a factor of one minus the shrinkage at every round, plus a term governed by the per-round fitting accuracy. Unrolling this recursion over M rounds yields an excess error bound in which the optimization error decays exponentially in the number of rounds while the statistical terms match those of GridCART. Choosing the number of boosting rounds on the order of log n suffices, and under a margin condition the required tree depth can even be reduced.
Skeptics might worry that restricting splits to a grid sacrifices the adaptivity that makes conventional trees so effective in practice. The empirical evidence suggests otherwise. Across twenty datasets drawn from the OpenML repository, the public benchmarking platform for networked machine learning science, both GridForest and GridGBDT performed comparably to their conventional counterparts, random forests and standard gradient boosting decision trees. The grid-based ensembles matched predictive accuracy while carrying something their competitors lack: provable convergence guarantees. The code and experimental results are slated for release alongside the publication, and the datasets themselves are freely available, making the claims straightforward to verify and build upon.
The significance of this work extends beyond one algorithm family. It closes a conceptual gap that has lingered since the 1980s, showing that the greedy purity-gain heuristic is not merely hard to analyze but provably broken in the worst case, and that a minimal, computationally cheap modification restores full theoretical soundness. Grid-based splitting adds essentially no overhead, since candidate cut points are fixed in advance rather than searched over continuous ranges. As machine learning increasingly demands algorithms whose reliability can be certified, the message of this research is resonant: sometimes the path to trustworthy artificial intelligence runs not through exotic new architectures, but through a careful re-examination of the humble tools already running the world, and a grid drawn at exactly the right spacing.
Subject of Research: Theoretical consistency guarantees for grid-based decision tree, random forest, and gradient boosting learning algorithms
Article Title: Grid-based Decision Tree Learning
Article References: Zheng, Q.-C., Zhang, S.-Q., Lyu, S.-H., Jiang, Y., & Zhou, Z.-H. (2026). Grid-based Decision Tree Learning. Machine Learning, 115(10), Article 242. https://doi.org/10.1007/s10994-026-07165-0
Image Credits: AI Generated
DOI: 10.1007/s10994-026-07165-0
Keywords: decision trees, CART, consistency, random forests, gradient boosting, statistical learning theory, purity gain, ensemble learning, histogram classifiers, machine learning theory, OpenML, XGBoost
News Source: Denise Maddox. (October 8, 2026). Grid-Based Decision Trees Finally Get the Guarantees They Always Needed. Scienmag.
