On the consistency of feature selection using greedy least squares regression

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 555-568

  Zhang, Tong ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Feature selection; Greedy algorithm; Sparsity

Indexed keywords

DESIGN MATRICES; EIGEN VALUES; FEATURE SELECTION; FEATURE SELECTION PROBLEMS; GREEDY ALGORITHM; LEAST SQUARES REGRESSIONS; NOISE LEVELS; NON-ZERO COEFFICIENTS; SAMPLE SIZES; SPARSITY; WORST CASE;

CURVE FITTING; LEAST SQUARES APPROXIMATIONS;

ALGORITHMS;

EID: 64149088421     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. S. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41(12):3397-3415, 1993.
2. Nicolai Meinshausen and Peter Buhlmann. High-dimensional graphs and variable selection with the Lasso. The Annals of Statistics, 34:1436-1462, 2006.
3. Nicolai Meinshausen and Bin Yu. Lasso-type recovery of sparse representations for highdimensional data. Annals of Statistics, 2008. to appear.
4. B. K. Natarajan. Sparse approximate solutions to linear systems. SIAM J. Comput., 24(2):227-234, 1995. ISSN 0097-5397.
5. Joel A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Info. Theory, 50(10):2231-2242, 2004.
6. 1 regularization. The Annals of Statistics, 2009. to appear.
7. Tong Zhang. Forward-backward greedy algorithm for learning sparse representations. Technical report, Rutgers Statistics Department, 2008. A short version is to appear in NIPS 08.
8. Peng Zhao and Bin Yu. On model selection consistency of Lasso. Journal of Machine Learning Research, 7:2541-2567, 2006.