Problem 2.6: Modified BIC estimator #
From Rigollet Chapter 2, Problem 2.6.
The standard BIC estimator (Definition 2.12) uses a uniform penalty τ²|θ|₀, which yields an MSE bound of order |θ*|₀ · σ² · log(ed) / n (Theorem 2.14). The factor log(ed) does not depend on the true sparsity |θ*|₀.
The modified BIC estimator replaces the uniform penalty with an adaptive penalty λ|θ|₀ · log(ed/|θ|₀) that depends on the sparsity level of the candidate θ itself. This yields the sharper rate:
MSE ≲ |θ*|₀ · σ² · log(ed / |θ*|₀) / n
which matches the ℓ₀-constrained LS rate of Corollary 2.9 (up to constants), eliminating the gap between log(ed) and log(ed/k). This shows the modified BIC can match the oracle benchmark without knowing the true sparsity k = |θ*|₀.
The proof follows the same "sup-out" technique as Theorem 2.14, but uses the refined combinatorial bound log(C(d,k)) ≤ k · log(ed/k) from Lemma 2.7.
Problem 2.6. Under sub-Gaussian noise, the modified BIC estimator with appropriately chosen λ satisfies: MSE(Xθ̂) = (1/n)|X(θ̂ - θ*)|₂² ≤ C · |θ*|₀ · σ² · log(ed/|θ*|₀) / n with probability at least 0.99.