Assoc Comput Mach. Yoav Freund and Robert E. Schapire. Game theory, on- line prediction and boosting . In particular, boosting can be viewed as repeated play of a certain game, and AdaBoost can be shown to be a special case of a more general algorithm for playing repeated games and for approximately solving a game. A different approach is used to search efficiently in high dimensional space.
Quadratic programming is more computationally demanding than linear programming.
However , there is a much more important computational difference between SVM and boosting algorithms. Game theory, on- line prediction and boosting . Yoav Freund and Robert E. Schapire. Game theory, on- line prediction and boosting . Given a game matrix M, we have a choice of whether to solve M or GammaM T .