arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.08656cs.LGstat.ML
收藏

深入研究决策树和森林:一个理论论证

Dive into Decision Trees and Forests: A Theoretical Demonstration

Jinxiong Zhang

摘要:

基于决策树,近年来许多领域都取得了巨大的进展。简单地说,决策树使用“分而治之”的策略将输入特征与标签之间的依赖关系这一复杂问题分解为较小的问题。虽然决策树有很长的历史,但最近的进展大大提高了它们在计算广告、推荐系统、信息检索等方面的性能。贝叶斯CART,贝叶斯回归样条)和训练技术(例如,混合整数规划、交替优化、梯度下降)。一路上,我们强调基于树的模型的概率特性,并解释其实际和理论上的好处。除了机器学习和数据采掘之外,本文还试图从统计学和运筹学等其他领域展示树型模型的理论进展。我们在每个方法的末尾列出了可重复的资源。

英文摘要:

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and labels into smaller ones. While decision trees have a long history, recent advances have greatly improved their performance in computational advertising, recommender system, information retrieval, etc. We introduce common tree-based models (e.g., Bayesian CART, Bayesian regression splines) and training techniques (e.g., mixed integer programming, alternating optimization, gradient descent). Along the way, we highlight probabilistic characteristics of tree-based models and explain their practical and theoretical benefits. Except machine learning and data mining, we try to show theoretical advances on tree-based models from other fields such as statistics and operation research. We list the reproducible resource at the end of each method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑