|
Fan, J. and Lv, J. (2008). Sure independence screening for ultrahigh dimensional feature space. Journal of the Royal Statistical Society. Series B: Statistical Methodology, 70(5):849–911. Gao, F., Ing, C. K., and Yang, Y. (2013). Metric entropy and sparse linear approximation of ff q-hulls for 0 < q ff 1. Journal of Approximation Theory, 166(1):42–55. Ing, C.-K. and Lai, T. L. (2011). A Stepwise Regression Method And Consistent Model Selection For High-dimensional Sparse Linear Models. Statistica Sinica, 21:1473–1513. Ing, C.-K. and Lai, T. L. (2018). An Efficient Pathwise Variable Selection Criterion In Weakly Sparse Regression Models. submitted to Annals of Statistics. 29 Meinshausen, N. and Bühlmann, P. (2006). High-dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34(3):1436–1462. Temlyakov, V. N. (2000). Weak greedy algorithms. Advances in Computational Mathematics, 12:213. Tibshirani, R. (1996). Rregression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological), 58:267–288. Wu, W. B. and Wu, Y. N. (2016). Performance bounds for parameter estimates of high-dimensional linear models with correlated errors. Electronic Journal of Statistics, 10(1):352–379. Zou, H. (2006). The adaptive lasso and its oracle properties. Journal of the American Statistical Association, 101(476):1418–1429. |