English

Adaptive Classification for Prediction Under a Budget

Machine Learning 2017-05-30 v1 Machine Learning

Abstract

We propose a novel adaptive approximation approach for test-time resource-constrained prediction. Given an input instance at test-time, a gating function identifies a prediction model for the input among a collection of models. Our objective is to minimize overall average cost without sacrificing accuracy. We learn gating and prediction models on fully labeled training data by means of a bottom-up strategy. Our novel bottom-up method first trains a high-accuracy complex model. Then a low-complexity gating and prediction model are subsequently learned to adaptively approximate the high-accuracy model in regions where low-cost models are capable of making highly accurate predictions. We pose an empirical loss minimization problem with cost constraints to jointly train gating and prediction models. On a number of benchmark datasets our method outperforms state-of-the-art achieving higher accuracy for the same cost.

Keywords

Cite

@article{arxiv.1705.10194,
  title  = {Adaptive Classification for Prediction Under a Budget},
  author = {Feng Nan and Venkatesh Saligrama},
  journal= {arXiv preprint arXiv:1705.10194},
  year   = {2017}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1704.07505

R2 v1 2026-06-22T20:02:15.103Z