资源分类
》 资源 》论文》Boosting on a Budget: Sampling for Feature-Efficient Prediction

Boosting on a Budget: Sampling for Feature-Efficient Prediction

2020-02-27 | |  48 |   34 |   0

Abstract

In this paper, we tackle the problem of feature-efficient prediction: classification using a limited number of features per test example. We show that modifying an ensemble classifier such as AdaBoost, by sampling hypotheses from its final weighted predictor, is well-suited for this task. We further consider an extension of this problem, where the costs of examining the various features can differ from one another, and we give an algorithm for this more general setting. We prove the correctness of our algorithms and derive bounds for the number of samples needed for given error rates. We also experimentally verify the effectiveness of our methods.

上一篇：Large-Scale Convex Minimization with a Low-Rank Constraint

下一篇：A PAC-Bayes Sample Compression Approach to Kernel Methods

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...