研究人员开发了一种优化随机森林模型中树数量的新方法，解决了超参数调优中的一个常见挑战。他们的方法使用一种基于三元组的平台搜索算法，通过监测袋外分数（out-of-bag score）的变化来适应性地识别出接近最小的足够集成大小。与传统技术相比，该方法旨在提供更自动化和可解释的程序，实验表明，在基准数据集上，它选择的树数量可能少于常用启发式方法，但在某些高维生物信息学数据集上则更多。 AI
影响 引入了一种新颖的集成模型优化技术，有可能提高特定数据集的效率和性能。
排序理由 该集群包含一篇详细介绍优化机器学习模型新研究方法的学术论文。
AI 生成摘要 · Google Gemini · 来自 3 个来源。 我们如何撰写摘要 →
arXiv:2606.03549v1 Announce Type: new Abstract: Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Par…
Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a pred…
Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a pred…