.png){kind=icon}
返回
Greedy function approximation: A gradient boosting machine
.png){kind=icon}
OA
AI
DOI：10.1214/aos/1013203451.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest-descent minimization. A general gradient descent boosting paradigm is developed for additive expansions based on any fitting criterion. Specific algorithms are presented for least-squares, least absolute deviation, and Huber-M loss functions for regression, and multiclass logistic likelihood for classification. Special enhancements are derived for the particular case where the individual additive components are regression trees, and tools for interpreting such TreeBoost models are presented. Gradient boosting of regression trees produces competitive, highly robust, interpretable procedures for both regression and classification, especially appropriate for ruining less than clean data. Connections between this approach and the boosting methods of Freund and Shapire and Friedman, Hastie and Tibshirani are discussed.
Keyword:
function estimation
boosting
decision trees
robust nonparametric regression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
Doped Semiconductor Nanocrystals: Synthesis, Characterization, Physical Properties, and Applications
PREAI
分享收藏
分享收藏Mobile markerless augmented reality and its application in forensic medicine移动无标记增强现实技术及其在法医学中的应用
PREAI
分享收藏Two-dimensional bricklayer arrangements of tolans using halogen bonding interactions使用卤素键相互作用的tolans的二维瓦工层布置
PREAI
分享收藏
查看更多内容