English

Dynamic Model Selection for Prediction Under a Budget

Machine Learning 2017-04-26 v1 Machine Learning

Abstract

We present a dynamic model selection approach for 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 is a recursive scheme whereby a high-accuracy complex model is first trained. Then a low-complexity gating and prediction model are subsequently learnt 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.1704.07505,
  title  = {Dynamic Model Selection for Prediction Under a Budget},
  author = {Feng Nan and Venkatesh Saligrama},
  journal= {arXiv preprint arXiv:1704.07505},
  year   = {2017}
}
R2 v1 2026-06-22T19:26:43.257Z