Best Subset Binary Prediction
Le-Yu Chen () and
Sokbae (Simon) Lee ()
Papers from arXiv.org
We consider a variable selection problem for the prediction of binary outcomes. We study the best subset selection procedure by which the covariates are chosen by maximizing Manski (1975, 1985)'s maximum score objective function subject to a constraint on the maximal number of selected variables. We show that this procedure can be equivalently reformulated as solving a mixed integer optimization problem, which enables computation of the exact or an approximate solution with a definite approximation error bound. In terms of theoretical results, we obtain non-asymptotic upper and lower risk bounds when the dimension of potential covariates is possibly much larger than the sample size. Our upper and lower risk bounds are minimax rate-optimal when the maximal number of selected variables is fixed and does not increase with the sample size. We illustrate usefulness of the best subset binary prediction approach via Monte Carlo simulations and an empirical application of the work-trip transportation mode choice.
Date: 2016-10, Revised 2018-05
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6) Track citations by RSS feed
Downloads: (external link)
http://arxiv.org/pdf/1610.02738 Latest version (application/pdf)
Journal Article: Best subset binary prediction (2018)
Working Paper: Best subset binary prediction (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1610.02738
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().