.png){kind=icon}
返回
Best subset binary prediction
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2018.05.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2018 The Author(s). Published by Elsevier B.V.
Keyword:
Binary choice
Maximum score estimation
Best subset selection
l(0)-constrained maximization
Mixed integer optimization
Minimax optimality
Finite sample property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.2K
被引数:
3.0W
机构
引用论文
Who Should Be Treated? Empirical Welfare Maximization Methods for Treatment Choice谁应该被治疗？治疗选择的经验福利最大化方法.png)
ECONOMETRICAOAAI
ECONOMETRICAIF7.1
OAAI分享收藏
查看更多内容