arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.02445math.STstat.MEstat.TH
收藏

基于目标随机投影的高维特征预测

Targeted Random Projection for Prediction from High-Dimensional Features

Minerva Mukhopadhyay, David B. Dunson

摘要:

我们认为,在具有挑战性的设置,准确的变量选择是不可能的计算效率高的预测高维和高度相关的预测的问题。直接应用惩罚或使用马尔可夫链蒙特卡罗实现的贝叶斯方法可能在计算上令人生畏且不稳定。因此,在统计分析之前,需要进行某种类型的降维。常见的解决方案包括应用筛选算法来减少回归量,或使用设计矩阵的投影来减少维数。前一种方法可能对有限样本中的阈值选择高度敏感,而后者在非常高维的设置中性能较差。我们提出了一个目标随机投影(TARP)的方法,结合了这两种策略的积极方面,以提高性能。特别是,我们建议使用来自独立筛选的信息来排序用于降维的投影矩阵中特征的包含概率,从而获得数据信息稀疏性。我们提供了理论支持的贝叶斯预测算法的基础上TARP,包括统计和计算复杂性的保证。模拟和真实数据应用的例子说明了相对于各种竞争对手的收益。

英文摘要:

We consider the problem of computationally-efficient prediction from high dimensional and highly correlated predictors in challenging settings where accurate variable selection is effectively impossible. Direct application of penalization or Bayesian methods implemented with Markov chain Monte Carlo can be computationally daunting and unstable. Hence, some type of dimensionality reduction prior to statistical analysis is in order. Common solutions include application of screening algorithms to reduce the regressors, or dimension reduction using projections of the design matrix. The former approach can be highly sensitive to threshold choice in finite samples, while the later can have poor performance in very high-dimensional settings. We propose a TArgeted Random Projection (TARP) approach that combines positive aspects of both strategies to boost performance. In particular, we propose to use information from independent screening to order the inclusion probabilities of the features in the projection matrix used for dimension reduction, leading to data-informed sparsity. We provide theoretical support for a Bayesian predictive algorithm based on TARP, including both statistical and computational complexity guarantees. Examples for simulated and real data applications illustrate gains relative to a variety of competitors.

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

↑