SpeedBoost: Anytime Prediction with Uniform Near-Optimality

We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by selecting from a set of simpler candidate predictors. These anytime predictors not only generate approximate predictions rapidly, but are capable of using extra resources at prediction time, when available, to improve performance. We also demonstrate how our framework can be used to select weak predictors which target certain subsets of the data, allowing for efficient use of computational resources on difficult examples. We also show that variants of the SpeedBoost algorithm produce predictors which are provably competitive with any possible sequence of weak predictors with the same total complexity.

• Type: Journal
• Year: 2012
• Where: JMLR
• Authors: Alexander Grubb, Drew Bagnell
• Keywords: Gradient Descent, JMLR 2012, Prediction Time, Predictive Accuracy, Programming Languages