# In boosting, if the base learner is a linear model, does the final model is just a simple linear model? [duplicate]

This question already has an answer here:

I am confused when I read the boosting papers.

In boosting our model is a sum of base learners:

$$f(x)=\sum_{m=1}^M b_m(x)$$

where $M$ is number of iterations in boosting, $b_m$ is the model for $m^{th}$ iteration.

Now, here is my question: can the base learner be linear? If the base learner is linear, does the whole model reduced into a simpler linear model?

For example, suppose we just run $2$ iterations, and $b_1=\beta_0+ \beta_1x$ and $b_2=\theta_0+ \theta_1x$, then

$$f(x)=\sum_{m=1}^2 b_m(x)=\beta_0+ \beta_1x+\theta_0+ \theta_1x=(\beta_0+\theta_0)+ (\beta_1+ \theta_1)x$$

which is a simple linear model ! In other words, the ensemble model have the "same power" with the base learner!

What's wrong there? Or nothing wrong, we just do not want to select linear model as a base learner?

## marked as duplicate by Haitao Du, Community♦Aug 23 '16 at 16:05

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

• Your argument is correct, if you choose a linear model as your base learning, then since linear functions are closed under addition, the final model will also be linear. – Matthew Drury Aug 23 '16 at 16:00