Enhanced Random Subspace Local Projections for High-Dimensional Time Series Analysis
High-dimensional time series forecasting suffers from severe overfitting when the number of predictors exceeds available observations, making standard local projection methods unstable and unreliable. We propose an enhanced Random Subspace Local Projection (RSLP) framework designed to deliver robust impulse response estimation in the presence of hundreds of correlated predictors. The method introduces weighted subspace aggregation, category-aware subspace sampling, adaptive subspace size selection, and a bootstrap inference procedure tailored to dependent data. These enhancements substantially improve estimator stability at longer forecast horizons while providing more reliable finite-sample inference. Experiments on synthetic data, macroeconomic indicators, and the FRED-MD dataset demonstrate a 33 percent reduction in estimator variability at horizons h >= 3 through adaptive subspace size selection. The bootstrap inference procedure produces conservative confidence intervals that are 14 percent narrower at policy-relevant horizons in very high-dimensional settings (FRED-MD with 126 predictors) while maintaining proper coverage. The framework provides practitioners with a principled approach for incorporating rich information sets into impulse response analysis without the instability of traditional high-dimensional methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Time Series ForecastingTime Series AnalysisSimilar Papers 제목 키워드 기반
Random Subspace Local Projections
We show how random subspace methods can be adapted to estimating local projections with many controls. Random subspace methods have their roots in the machine learning literature and are implemented by averaging over reg…
Dimensionality Reductionsubspace methodsEnhanced Expressive Power and Fast Training of Neural Networks by Random Projections
Random projections are able to perform dimension reduction efficiently for datasets with nonlinear low-dimensional structures. One well-known example is that random matrices embed sparse vectors into a low-dimensional su…
compressed sensingDimensionality ReductionGeometrically Principled Randomized Optimization for Efficient LLM Training
Low-rank gradient optimization for large language models is currently divided into two categories: structured methods that rigorously identify subspaces, and randomized approaches employed primarily for computational eff…
Computational EfficiencyAn Analysis of Random Projections in Cancelable Biometrics
With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable te…
Face RecognitionOn Projections to Linear Subspaces
The merit of projecting data onto linear subspaces is well known from, e.g., dimension reduction. One key aspect of subspace projections, the maximum preservation of variance (principal component analysis), has been thor…
Dimensionality Reduction