Learning Nonlinear Functions Using Regularized Greedy Forest

Details Learning Nonlinear Functions Using Regularized Greedy Forest Learning Nonlinear Functions Using Regularized Greedy Forest

2011-09-05

arxiv.org/abs/1109.0887v4

Statistics

Machine Learning

Scientific paper

We consider the problem of learning a forest of nonlinear decision rules with general loss functions. The standard methods employ boosted decision trees such as Adaboost for exponential loss and Friedman's gradient boosting for general loss. In contrast to these traditional boosting algorithms that treat a tree learner as a black box, the method we propose directly learns decision forests via fully-corrective regularized greedy search using the underlying forest structure. Our method achieves higher accuracy and smaller models than gradient boosting (and Adaboost with exponential loss) on many datasets.

Affiliated with

Also associated with

No associations

Rating

Learning Nonlinear Functions Using Regularized Greedy Forest does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Nonlinear Functions Using Regularized Greedy Forest, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Nonlinear Functions Using Regularized Greedy Forest will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450032