Targeted Random Projection for Prediction from High-Dimensional Features

arXiv1909.05117MaRDI QIDQ6325100FDOQ6325100

Authors: Minerva Mukhopadhyay, David Dunson 

Publication date: 10 September 2019

Abstract: We consider the problem of computationally-efficient prediction with high dimensional and highly correlated predictors when 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. A common solution is first stage dimension reduction through screening or projecting the design matrix to a lower dimensional hyper-plane. Screening is highly sensitive to threshold choice, while projections often have poor performance in very high-dimensions. We propose TArgeted Random Projection (TARP) to combine positive aspects of both strategies. TARP uses 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 statistical and computational complexity guarantees. Examples for simulated and real data applications illustrate gains relative to a variety of competitors.

This page was built for publication: Targeted Random Projection for Prediction from High-Dimensional Features

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325100)