Learning Out of Leaders

Details Learning Out of Leaders Learning Out of Leaders

2010-01-12

arxiv.org/abs/1001.1919v2

Mathematics

Statistics Theory

Scientific paper

This paper investigates the estimation problem in a regression-type model. To be able to deal with potential high dimensions, we provide a procedure called LOL, for Learning Out of Leaders with no optimization step. LOL is an auto-driven algorithm with two thresholding steps. A first adaptive thresholding helps to select leaders among the initial regressors in order to obtain a first reduction of dimensionality. Then a second thresholding is performed on the linear regression upon the leaders. The consistency of the procedure is investigated. Exponential bounds are obtained, leading to minimax and adaptive results for a wide class of sparse parameters, with (quasi) no restriction on the number p of possible regressors. An extensive computational experiment is conducted to emphasize the practical good performances of LOL.

Affiliated with

Also associated with

No associations

Rating

Learning Out of Leaders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Out of Leaders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Out of Leaders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459466