Linear Programming Boosting by Column and Row Generation

Abstract

We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimization problem. In preliminary experiments, our algorithm outperforms a state-of-the-art LP solver and LPBoost especially when the solution is given by a small set of relevant hypotheses and support vectors.

Topics

2 Figures and Tables

Download Full PDF Version (Non-Commercial Use)