arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.02738stat.MEecon.EM
收藏

最佳子集二元预测

Best Subset Binary Prediction

Le-Yu Chen, Sokbae Lee

摘要:

我们考虑一个二元结果预测的变量选择问题。我们研究了最佳子集选择过程,通过最大化Manski(1975,1985)的最大得分目标函数的约束下,选择的协变量的最大数量。我们表明,这个过程可以等价地重新制定为解决一个混合整数优化问题,这使得计算的精确或近似解具有一定的近似误差界。根据理论结果,当潜在协变量的维数可能远大于样本量时,我们得到了非渐近的风险上、下界。当所选变量的最大数量固定且不随样本量增加时,我们的风险上限和下限是极大极小率最优的。我们通过蒙特卡罗模拟和工作行程交通方式选择的实证应用说明了最佳子集二进制预测方法的实用性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑