期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 63, 期 1, 页码 698-714出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2016.2621111
关键词
High dimensional regression; predictive modeling; model selection; thresholding; two-stage prediction; graphical models
资金
- U.S. National Science Foundation [CCF-1217880, DMS-CMG-1025465, AGS-1003823, DMS-1106642, DMS-CAREER-1352656]
- U.S. Air Force Office of Scientific Research [FA9550-13-1-0043]
- U.S. Army Research Office [W911NF-15-1-0479]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [1352656] Funding Source: National Science Foundation
This paper proposes a general adaptive procedure for budget-limited predictor design in high dimensions called two-stage Sampling, Prediction and Adaptive Regression via Correlation Screening (SPARCS). The SPARCS can be applied to high-dimensional prediction problems in experimental science, medicine, finance, and engineering, as illustrated by the following. Suppose that one wishes to run a sequence of experiments to learn a sparse multivariate predictor of a dependent variable Y (disease prognosis for instance) based on a p dimensional set of independent variables X = [X-1,..., X-p](T) (assayed biomarkers). Assume that the cost of acquiring the full set of variables X increases linearly in its dimension. The SPARCS breaks the data collection into two stages in order to achieve an optimal tradeoff between sampling cost and predictor performance. In the first stage, we collect a few (n) expensive samples {y(i), s(i)}(i=1)(n), at the full dimension p >> n of X, winnowing the number of variables down to a smaller dimension l < p using a type of cross correlation or regression coefficient screening. In the second stage, we collect a larger number (t - n) of cheaper samples of the l variables that passed the screening of the first stage. At the second stage, a low-dimensional predictor is constructed by solving the standard regression problem using all t samples of the selected variables. The SPARCS is an adaptive online algorithm that implements false positive control on the selected variables, is well suited to small sample sizes, and is scalable to high dimensions. We establish asymptotic bounds for the familywise error rate, specify high dimensional convergence rates for support recovery, and establish optimal sample allocation rules to the first and second stages.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据