TL;DR
This paper introduces a kernel-based smoothing technique for random forests, enhancing their predictive smoothness and performance, especially with limited data, by combining tree adaptability with kernel regularity.
Contribution
It proposes a novel smoothing method that improves random forest predictions by integrating kernel smoothing, capturing uncertainty in tree cut points, and enhancing performance in small data regimes.
Findings
Smoothed random forests outperform standard ones in predictive accuracy.
The method effectively captures uncertainty in tree cut points.
Performance gains are especially notable in data-scarce scenarios.
Abstract
Random forest regression is a powerful non-parametric method that adapts to local data characteristics through data-driven partitioning, making it effective across diverse application domains. However, the piecewise constant nature of random forest predictions means each partition is predicted independently, ignoring potential smoothness in the underlying function. Particularly in the small data regime, this lack of information sharing across the input space can lead to suboptimal performance. In this work, we propose a kernel-based smoothing mechanism that enhances random forests by introducing local regularity to their predictions while preserving their adaptive partitioning capabilities. Our approach applies kernel smoothing to the piecewise constant outputs of random forests, effectively combining the adaptability of tree-based methods with the smoothness assumptions of kernel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Adversarial Robustness in Machine Learning · Machine Learning and ELM
MethodsSparse Evolutionary Training
