Model selection for high-dimensional linear regression with dependent observations
We investigate the prediction capability of the orthogonal greedy algorithm (OGA) in high-dimensional regression models with dependent observations. The rates of convergence of the prediction error of OGA are obtained under a variety of sparsity conditions. To prevent OGA from overfitting, we introduce a high-dimensional Akaike's information criterion (HDAIC) to determine the number of OGA iterations. A key contribution of this work is to show that OGA, used in conjunction with HDAIC, can achieve the optimal convergence rate without knowledge of how sparse the underlying high-dimensional model is.
Code (0)
등록된 구현이 없습니다.
Tasks
Model SelectionPredictionregressionVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Bayesian high-dimensional linear regression with generic spike-and-slab priors
Spike-and-slab priors are popular Bayesian solutions for high-dimensional linear regression problems. Previous theoretical studies on spike-and-slab methods focus on specific prior formulations and use prior-dependent co…
Model SelectionregressionVocal Bursts Intensity PredictionNearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
We consider the stochastic contextual bandit problem under the high dimensional linear model. We focus on the case where the action space is finite and random, with each action associated with a randomly generated contex…
Sharp Convergence Rates for Forward Regression in High-Dimensional Sparse Linear Models
Forward regression is a statistical model selection and estimation procedure which inductively selects covariates that add predictive power into a working statistical regression model. Once a model is selected, unknown r…
Model SelectionregressionVocal Bursts Intensity PredictionN$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way. Specifically, we propose a nonlinear extension of the non-negative least-angle regression (…
Distributed Computingfeature selectionregressionA Consistent and Scalable Algorithm for Best Subset Selection in Single Index Models
Analysis of high-dimensional data has led to increased interest in both single index models (SIMs) and best subset selection. SIMs provide an interpretable and flexible modeling framework for high-dimensional data, while…
Model Selectionregression