Journal article · 2026 · Open access

Improving Random Forests by Smoothing

Ziyi Liu, Phuc Luong, Mario Boley, Daniel F. Schmidt

Machine Learning, 115(7) · Published 18 June 2026 · DOI 10.1007/s10994-026-07077-z

Free PDFView at the publisherCite this paper

In brief

“Improving Random Forests by Smoothing” is a 2026 journal article by Ziyi Liu and 3 co-authors, published in Machine Learning. OpenAlex counts 4 citations as of 16 November 2026, which puts it in the top 9% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Machine Learning.

Citations
4
Most cited in
2025 (3)
Field-weighted impact
1.97
References
20
Authors
4

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 methods. We show that this smoothing procedure can be interpreted as capturing the variability/uncertainty in the tree cut points under resampling of the training inputs. Empirical results demonstrate that the proposed smoothed random forest model consistently improves predictive performance across diverse test cases, particularly in data-scarce settings. Code, datasets, and experiment results are publicly available at https://github.com/Neal-Liu-Ziyi/SmoothedRandomForest.git .

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Liu, Z., Luong, P., Boley, M., & Schmidt, D. F. (2026). Improving Random Forests by Smoothing. Machine Learning, 115(7). https://doi.org/10.1007/s10994-026-07077-z

MLA 9

Liu, Ziyi, et al. “Improving Random Forests by Smoothing.” Machine Learning, vol. 115, no. 7, 2026. https://doi.org/10.1007/s10994-026-07077-z.

Chicago

Liu, Ziyi, Phuc Luong, Mario Boley, and Daniel F. Schmidt. 2026. “Improving Random Forests by Smoothing.” Machine Learning 115 (7). https://doi.org/10.1007/s10994-026-07077-z.

Harvard

Liu, Z. et al. (2026) ‘Improving Random Forests by Smoothing’, Machine Learning, 115(7). doi:10.1007/s10994-026-07077-z.

IEEE

Z. Liu, P. Luong, M. Boley, and D. F. Schmidt, “Improving Random Forests by Smoothing,” Machine Learning, vol. 115, no. 7, 2026, doi: 10.1007/s10994-026-07077-z.

BibTeX

@article{liu2026improving,
  title     = {{Improving Random Forests by Smoothing}},
  author    = {Liu, Ziyi and Luong, Phuc and Boley, Mario and Schmidt, Daniel F.},
  journal   = {Machine Learning},
  year      = {2026},
  volume    = {115},
  number    = {7},
  doi       = {10.1007/s10994-026-07077-z},
  url       = {https://doi.org/10.1007/s10994-026-07077-z}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference

  • random forest regression
  • kernel smoothing
  • small data regime
  • uncertainty estimation
  • adaptive partitioning
  • nonparametric regression

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Liu, Z., Luong, P., Boley, M., & Schmidt, D. F. (2026). Improving Random Forests by Smoothing. Machine Learning, 115(7). https://doi.org/10.1007/s10994-026-07077-z

How many times has this paper been cited?

4 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at Machine Learning.

Who wrote this paper?

Ziyi Liu, Phuc Luong, Mario Boley, Daniel F. Schmidt.

What is the DOI of this paper?

10.1007/s10994-026-07077-z. The permanent link is https://doi.org/10.1007/s10994-026-07077-z.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.