Model selection by resampling penalization

Details Model selection by resampling penalization Model selection by resampling penalization

2007-01-19

arxiv.org/abs/math/0701542v2

Mathematics

Statistics Theory

submitted to COLT

Scientific paper

We present a new family of model selection algorithms based on the resampling heuristics. It can be used in several frameworks, do not require any knowledge about the unknown law of the data, and may be seen as a generalization of local Rademacher complexities and $V$-fold cross-validation. In the case example of least-square regression on histograms, we prove oracle inequalities, and that these algorithms are naturally adaptive to both the smoothness of the regression function and the variability of the noise level. Then, interpretating $V$-fold cross-validation in terms of penalization, we enlighten the question of choosing $V$. Finally, a simulation study illustrates the strength of resampling penalization algorithms against some classical ones, in particular with heteroscedastic data.

Affiliated with

Also associated with

No associations

Rating

Model selection by resampling penalization 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 Model selection by resampling penalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model selection by resampling penalization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-70883