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

That combination, however, creates a blind spot. When data flows from a ROS 2 node into an AUTOSAR AP application and back again, each platform keeps its own records of what happened. ROS 2 offers tracing hooks that capture communication events, while AUTOSAR AP applications typically rely on ara::log, the platform’s standardized logging facility, which was never designed to serve as a precision timing instrument. Stitching these two heterogeneous record streams into a single, coherent picture of end-to-end latency has been a stubborn engineering problem. Developers prototyping a new perception or planning module can easily discover that something feels slow without being able to say whether the delay arose in sensor reception, in cross-platform message translation, in the detection algorithm itself, or in the final command output.

A research team led by Professor Takuya Azumi of the Graduate School of Science and Engineering at Saitama University, working with Astemo, Ltd., has now pushed a solution to that problem much closer to practical reality. The team had previously developed CART, the Combined AUTOSAR AP and ROS 2 Tracing Framework, which integrates trace information from both platforms into a unified timeline. But the original evaluation of CART was confined to a small-scale application configuration, leaving open a question that matters enormously to anyone building real vehicles: would the framework still deliver useful end-to-end latency analysis when confronted with the component count, data volume and complexity of a genuine autonomous-driving stack? The answer, published on August 6, 2026 in the IEEE Open Journal of the Industrial Electronics Society under the title “Evaluation Platform for Tracing of Autonomous Driving System Combined AUTOSAR AP and ROS 2” (DOI: 10.1109/OJIES.2026.3721135), is a carefully qualified yes.

To reach that answer, the researchers built a cloud-based evaluation platform that assembles four major pieces of software into one instrumented pipeline. The high-fidelity CARLA simulator generates realistic LiDAR point-cloud data for a simulated vehicle. Those point clouds flow into Autoware, the well-known open-source autonomous-driving software stack built on ROS 2, which handles the higher-level driving logic. From Autoware, sensor data pass across the platform boundary into an AUTOSAR AP application responsible for object detection, with detection results routed back to Autoware through protocol bridges so that vehicle-control commands can be generated. CART sits alongside this entire chain, ingesting ROS 2 traces and AUTOSAR AP logs and reconstructing the processing path from the moment simulated sensor data are received to the moment a control command emerges at the other end.

The results of the evaluation speak to both the completeness and the realism of the setup. CART reconstructed the entire expected end-to-end communication topology with 100 percent coverage, meaning that no segment of the processing path across the ROS 2–AUTOSAR AP boundary was lost to the tracing process. Under the evaluated workload, the platform sustained a point-cloud reception callback rate of approximately 33 Hz, a figure that reflects the kind of continuous, high-frequency sensor processing real autonomous-driving software must handle. Crucially, all of this was achieved with low tracing overhead, so the act of measurement did not materially distort the behavior being measured — a perennial hazard in performance analysis.

The framework also demonstrated an ability that fixed communication diagrams cannot provide: following dynamic control behavior. In the evaluated scenarios, CART distinguished between processing paths in which object detection triggered a stop command and paths in which no actuation command was issued at all. That distinction matters because autonomous-driving logic is not a static pipeline; it branches depending on what the sensors perceive. A tracing tool that can only follow fixed routes would miss precisely the situations developers care most about — the moments when the vehicle’s software decides to change what it is doing. By capturing those transitions, CART showed it can trace changes in control logic as well as ordinary data flow.

Overhead, the quiet killer of any tracing scheme, was quantified in two separate tests. In a small-scale test, adding ara::log-based instrumentation introduced little CPU load and roughly 0.03 MiB of memory usage, numbers small enough to be negligible for most development purposes. In a separate offline benchmark, converting logs representing one million send/receive pairs into trace data took approximately one second, suggesting that the framework can scale to the volume of logging that a full autonomous-driving stack generates without becoming an analysis bottleneck in itself. The authors assessed the platform at Technology Readiness Level 6, based on its demonstration in a relevant simulation environment, while noting that validation on real hardware remains future work.

“This study is important because autonomous-driving software is becoming increasingly complex, with different software platforms working together within the same system,” said Shunsuke Ito, a master’s student at Saitama University’s Graduate School of Science and Engineering and the corresponding author of the study. “By integrating trace information from AUTOSAR AP and ROS 2, our platform makes it possible to follow the processing path from sensor input to the generation of a control command as a single end-to-end sequence. This allows developers to see more clearly where latency occurs across platform boundaries.” The point is not merely academic. Latency budgets in autonomous driving are unforgiving: a perception-to-control chain that overshoots its deadline can degrade the freshness of the vehicle’s world model, and the difference between a safe response and a dangerous one can hinge on tens of milliseconds.

Ito emphasized that the leap from small test applications to realistic workloads was the heart of the contribution. “It is not enough to confirm that a tracing method works with a small test application,” he explained. “Autonomous-driving systems process large amounts of sensor data through many interconnected software components. By combining CARLA, Autoware, AUTOSAR AP, and ROS 2 in a cloud environment, we were able to test CART under more realistic conditions and show that detailed latency analysis remains possible without imposing a large additional processing burden.” For engineering teams practicing rapid prototyping, that means performance bottlenecks can now be identified during the design-and-test cycle, before software is transferred to physical vehicle hardware — when fixes are cheapest and iteration is fastest.

The implications extend to the broader industry shift toward Software-Defined Vehicles, in which functionality is increasingly delivered and updated through software rather than hardware. By providing a unified view of processing across heterogeneous platforms, unified tracing could shorten development and validation cycles and make complex vehicle software systematically evaluable. The team is candid about the road ahead: practical deployment will require validation with real electronic control units or hardware-in-the-loop systems, clock synchronization across multiple computing systems, larger-scale testing, and further automation of cross-platform message correlation. Looking forward, the researchers plan to extend the platform to lighter-weight simulation environments, incorporate OpenSCENARIO-based systematic testing, automate message linking using standard SOME/IP identifiers, and ultimately evaluate CART on real hardware. “If developers can trace the behavior of those systems across different platforms and identify performance problems earlier, they may be able to shorten development and validation cycles while making complex vehicle software easier to evaluate systematically,” Ito said. “In the future, we hope to extend CART from cloud-based simulation to real ECUs and further automate the tracing process. If these capabilities can be incorporated into practical vehicle-development workflows, unified tracing could become a useful tool for developing autonomous-driving and software-defined vehicle functions more efficiently and reliably.”

Subject of Research: End-to-end latency tracing across mixed ROS 2 and AUTOSAR AP autonomous-driving software platforms

Article Title: New tracing platform pinpoints delays across complex autonomous-driving software

Article References: New tracing platform pinpoints delays across complex autonomous-driving software. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: autonomous driving, CART, AUTOSAR AP, ROS 2, Autoware, CARLA simulator, latency tracing, software-defined vehicles, Saitama University, ara::log, cloud evaluation platform, IEEE Open Journal of the Industrial Electronics Society