Subsampling estimates of the Lasso distribution.
Subsampling estimates of the Lasso distribution.
Subsampling estimates of the Lasso distribution.
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
4.3 Marginal regressors as initial <strong>estimates</strong> 41<br />
holds, and one easily verifies that σ 2 ∑ n<br />
i=1 vi 2 = 1. So by <strong>the</strong> Lebesgue’s dominated convergence<br />
<strong>the</strong>orem it is sufficient to show that<br />
max |v i| = max<br />
1≤i≤n i≤i≤n n−1/2 s −1 ∣<br />
n ∣α nC ′ −1<br />
n1 u i∣ → 0.<br />
This claim follows from assumptions B.5 and B.6 as<br />
max<br />
i≤i≤n n−1/2 s −1 ∣<br />
n<br />
∣α ′ nC −1<br />
n1 u ∣<br />
i<br />
∣ ≤ max<br />
1≤i≤n n−1/2 s −1<br />
n<br />
≤= σ −1 n −1/2 max<br />
1≤i≤n<br />
( )<br />
α ′ nC −1 1/2 ( )<br />
n1 α′ n u ′ iC −1 1/2<br />
n1 u i<br />
( )<br />
u ′ iC −1 1/2<br />
n1 u i<br />
≤ n −1/2 σ −1 ‖C −1<br />
n1 ‖ max<br />
1≤i≤n (u′ iu i ) 1/2<br />
≤ σ −1 τ −1<br />
1 n−1/2 max<br />
1≤i≤n (u′ iu i ) 1/2 → 0.<br />
4.3 Marginal regressors as initial <strong>estimates</strong><br />
The validity <strong>of</strong> both Theorem 4.1.0.9 and 4.2.0.10 requires <strong>the</strong> existence <strong>of</strong> an initial<br />
estimator ˜β n which satisfies assumption B.2, that is, is r n -consistent for <strong>the</strong> estimation<br />
<strong>of</strong> a proxy η n <strong>of</strong> <strong>the</strong> true parameters β 0 . In this section we show that under a weak<br />
correlation assumption between relavant and noise variables, this assumption is satisfied<br />
by marginal regressors which also <strong>of</strong>fer <strong>the</strong> advantage to be computationally attrative.<br />
The marginal regressor ˜β n is defined as<br />
and <strong>the</strong> proxies η nj are chosen as<br />
˜β nj = x′ j Y<br />
n , j = 1, . . . , p n (4.3.0.9)<br />
η nj = E( ˜β nj ) = x′ j Xβ 0<br />
n<br />
(4.3.0.10)<br />
The weak correlation assumption is formally stated as:<br />
Assumption C.<br />
C.1 Condition B.1 holds.<br />
C.2 For 1 ≤ j ≤ k n and k n < k ≤ p n , it holds that<br />
∣ 1<br />
n∑ ∣∣∣∣ ∣ x<br />
∣ ij x ik =<br />
1 ∣∣∣<br />
n<br />
∣n x jx k ≤ ρ n , 1 ≤ j ≤ k n , k n < k ≤ p n<br />
i=1<br />
with ρ n satisfying<br />
for some 0 < κ < 1.<br />
(<br />
) ⎛<br />
c n = max |η nj | ⎝<br />
k n