paper-with-me

홈 › Papers

Enhancing Robustness of Gradient-Boosted Decision Trees through One-Hot Encoding and Regularization

2023-04-26 · Shijie Cui, Agus Sudjianto, Aijun Zhang, Runze Li

Gradient-boosted decision trees (GBDT) are widely used and highly effective machine learning approach for tabular data modeling. However, their complex structure may lead to low robustness against small covariate perturbation in unseen data. In this study, we apply one-hot encoding to convert a GBDT model into a linear framework, through encoding of each tree leaf to one dummy variable. This allows for the use of linear regression techniques, plus a novel risk decomposition for assessing the robustness of a GBDT model against covariate perturbations. We propose to enhance the robustness of GBDT models by refitting their linear regression forms with $L_1$ or $L_2$ regularization. Theoretical results are obtained about the effect of regularization on the model performance and robustness. It is demonstrated through numerical experiments that the proposed regularization approach can enhance the robustness of the one-hot-encoded GBDT models.

📄 PDF Abstract BibTeX arXiv:2304.13761

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Gradient Boosted Filters For Signal Processing

2024-05-15 · Jose A. Lopez, Georg Stemmer, Hector A. Cordourier

Gradient boosted decision trees have achieved remarkable success in several domains, particularly those that work with static tabular data. However, the application of gradient boosted models to signal processing is unde…

Gradient Boosted Decision Tree Neural Network

2019-10-17 · Mohammad Saberian, Pablo Delgado, Yves Raimond

In this paper we propose a method to build a neural network that is similar to an ensemble of decision trees. We first illustrate how to convert a learned ensemble of decision trees to a single neural network with one hi…

Tree-Structured Boosting: Connections Between Gradient Boosted Stumps and Full Decision Trees

2017-11-18 · José Marcio Luna, Eric Eaton, Lyle H. Ungar, Eric Diffenderfer 외

Additive models, such as produced by gradient boosting, and full interaction models, such as classification and regression trees (CART), are widely used algorithms that have been investigated largely in isolation. We sho…

Additive modelsGeneral Classification

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded

2018-03-02 · Miten Mistry, Dimitrios Letsios, Gerhard Krennrich, Robert M. Lee 외

Decision trees usefully represent sparse, high dimensional and noisy data. Having learned a function from this data, we may want to thereafter integrate the function into a larger decision-making problem, e.g., for picki…

Chemical ProcessDecision Making

Forecasting with Hyper-Trees

2024-05-13 · Alexander März, Kashif Rasul

We introduce the concept of Hyper-Trees and offer a new direction in applying tree-based models to time series data. Unlike conventional applications of decision trees that forecast time series directly, Hyper-Trees are …

Inductive BiasTime SeriesTime Series Forecasting