HackerPapers

arXiv:1808.03698stat.ML

BooST: Boosting Smooth Trees for Partial Effect Estimation in Nonlinear Regressions

Yuri Fonseca, Marcelo Medeiros, Gabriel Vasconcelos, Alvaro Veiga

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

In this paper, we introduce a new machine learning (ML) model for nonlinear regression called the Boosted Smooth Transition Regression Trees (BooST), which is a combination of boosting algorithms with smooth transition regression trees. The main advantage of the BooST model is the estimation of the derivatives (partial effects) of very general nonlinear models. Therefore, the model can provide more interpretation about the mapping between the covariates and the dependent variable than other tree-based models, such as Random Forests. We present several examples with both simulated and real data.

arXiv comments
Journal reference
DOI
Subjects
stat.MLMachine Learning (Statistics) cs.LGMachine Learning econ.EMEconometrics stat.MEMethodology (Statistics)

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Aug 2018 to Aug 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.