Optimizing Prediction Intervals by Tuning Random Forest via Meta-Validation
Not on the map. Why?
Abstract (arXiv)
Recent studies have shown that tuning prediction models increases prediction accuracy and that Random Forest can be used to construct prediction intervals. However, to our best knowledge, no study has investigated the need to, and the manner in which one can, tune Random Forest for optimizing prediction intervals { this paper aims to fill this gap. We explore a tuning approach that combines an effectively exhaustive search with a validation technique on a single Random Forest parameter. This paper investigates which, out of eight validation techniques, are beneficial for tuning, i.e., which automatically choose a Random Forest configuration constructing prediction intervals that are reliable and with a smaller width than the default configuration. Additionally, we present and validate three meta-validation techniques to determine which are beneficial, i.e., those which automatically chose a beneficial validation technique. This study uses data from our industrial partner (Keymind Inc.) and the Tukutuku Research Project, related to post-release defect prediction and Web application effort estimation, respectively. Results from our study indicate that: i) the default configuration is frequently unreliable, ii) most of the validation techniques, including previously successfully adopted ones such as 50/50 holdout and bootstrap, are counterproductive in most of the cases, and iii) the 75/25 holdout meta-validation technique is always beneficial; i.e., it avoids the likely counterproductive effects of validation techniques.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Jan 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 1; 2024: 0; 2025: 1.
9 papers.
- 2021SINGA-Easy: An Easy-to-Use Framework for MultiModal Analysiscited by 0
- 2021VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Searchcited by 0
- 2021Text is NOT Enough: Integrating Visual Impressions into Open-domain Dialogue Generationcited by 0
- 2022Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectorscited by 0
- 2022Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networkscited by 0
- 2022Explanation-Guided Fairness Testing through Genetic Algorithmcited by 0
- 2022Using Graph Neural Networks for Program Terminationcited by 0
- 2023Tribe or Not? Critical Inspection of Group Differences Using TribalGramcited by 0
- 2025Targeted tuning of random forests for quantile estimation and prediction intervalscited by 0
- 2025Targeted tuning of random forests for quantile estimation and prediction intervals2 Jul 2025
- 2023Tribe or Not? Critical Inspection of Group Differences Using TribalGram16 Mar 2023
- 2022Using Graph Neural Networks for Program Termination28 Jul 2022
- 2022Explanation-Guided Fairness Testing through Genetic Algorithm16 May 2022
- 2022Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks8 Mar 2022
- 2022Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectors6 Feb 2022
- 2021Text is NOT Enough: Integrating Visual Impressions into Open-domain Dialogue Generation13 Sep 2021
- 2021VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search5 Aug 2021
- 2021SINGA-Easy: An Easy-to-Use Framework for MultiModal Analysis3 Aug 2021