Model selection for regression on a random design
ESAIM Probability and StatisticsPublished 1 January 2002Open access
Yannick Baraud
Citations117
SJR quartileQ2
SJR score0.51
SNIP0.78
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
peer reviewed
Keywords
Computer ScienceMathematicsDecision Sciences
Computers in PhysicsTen Lectures on Wavelets
15,386 Citations1992Ingrid Daubechies, Christopher Heil
This paper presents a meta-analyses of the wavelet transforms of Coxeter’s inequality and its applications to multiresolutional analysis and orthonormal bases.
BiometrikaIdeal spatial adaptation by wavelet shrinkage
7,813 Citations1994David L. Donoho, Iain M. Johnstone
A new principle for spatially-adaptive estimation: selective wavelet reconstruction with an oracle inequality is described and a practical spatially adaptive method, RiskShrink, which works by shrinkage of empirical wavelet coefficients is developed.
The Annals of StatisticsAdditive Regression and Other Nonparametric Models
1,241 Citations1985Charles J. Stone
Applied and Computational Harmonic AnalysisWavelets on the Interval and Fast Wavelet Transforms
1,038 Citations1993Albert Cohen, Ingrid Daubechies +1 more
The Annals of StatisticsMinimax estimation via wavelet shrinkage
1,028 Citations1998David L. Donoho, Iain M. Johnstone
A nonlinear method which works in the wavelet domain by simple nonlinear shrinkage of the empirical wavelet coefficients is developed, andVariants of this method based on simple threshold nonlinear estimators are nearly minimax.
Probability Theory and Related FieldsRisk bounds for model selection via penalization
667 Citations1999Andrew R. Barron, Lucien Birgé +1 more
It is shown that the quadratic risk of the minimum penalized empirical contrast estimator is bounded by an index of the accuracy of the sieve, which quantifies the trade-off among the candidate models between the approximation error and parameter dimension relative to sample size.
The Annals of StatisticsInformation-theoretic determination of minimax rates of convergence
579 Citations1999Yuhong Yang, Andrew R. Barron
Some general results determining minimax bounds on statistical risk for density estimation based on certain information-theoretic considerations are presented, which depend only on metric entropy conditions and are used to identify the minimax rates of convergence.
IEEE Transactions on Information TheoryMinimum complexity density estimation
497 Citations1991Andrew R. Barron, Thomas M. Cover
An index of resolvability is proved to bound the rate of convergence of minimum complexity density estimators as well as the information-theoretic redundancy of the corresponding total description length to demonstrate the statistical effectiveness of the minimum description-length principle as a method of inference.
Journal of the European Mathematical SocietyGaussian model selection
477 Citations2001Lucien Birgé, Pascal Massart
The purpose in this paper is to provide a general approach to model selection via penalization for Gaussian regression and to develop the point of view about this subject.
Lecture notes in statisticsMinimax Theory of Image Reconstruction
375 Citations1993A. P. Korostelev, A. B. Tsybakov
This book is concerned with a technique for image reconstruction known as the asymptotic minimax approach, which is based on non-parametric regression and change-point analysis, and presents results under the simplest assumptions.
BernoulliMinimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence
344 Citations1998Lucien Birgé, Pascal Massart +1 more
ESAIM Probability and StatisticsHow many bins should be put in a regular histogram
148 Citations2006Lucien Birgé, Yves Rozenholc
The purpose in this paper is to give a fully automatic and simple method to choose the number of bins of the partition from the data based on a nonasymptotic evaluation of the performances of penalized maximum likelihood estimators in some exponential families due to Castellan and heavy simulations which allowed us to optimize the form of the penalty function.
Journal of Multivariate AnalysisCombining Different Procedures for Adaptive Regression
113 Citations2000Yuhong Yang
It is shown by combining various regression procedures that a single estimator can be constructed to be minimax-rate adaptive over Besov classes of unknown smoothness and interaction order, to converge at rate o(n?1/2) when the regression function has a neural net representation, and at the same time to be consistent over all bounded regression functions.
Probability Theory and Related FieldsModel selection for regression on a fixed design
96 Citations2000Yannick Baraud
This work considers some collection of finite dimensional linear spaces and the least-squares estimator built on a data driven selected model among this collection and deduce adaptivity properties from which the estimator from which it is derived holds under mild moment conditions on the errors.
Constructive ApproximationAn Adaptive Compression Algorithm in Besov Spaces
66 Citations2000Lucien Birgé, Pascal Massart
A new algorithm providing an approximation $\tilde f of f with a prescribed number D of nonzero coefficients in its expansion with the optimal rate D-α of approximation with respect to the Lq -norm when f belongs to some Besov space Bαp,∈fty whenever α>(1/p-1/q)+ .
Iowa State University Digital Repository (Iowa State University)MODEL SELECTION FOR NONPARAMETRIC REGRESSION
66 Citations1997Yuhong Yang
A model complexity penalty term in AIC is incorporated to handle selec- tion bias and resulting estimators are shown to achieve a trade-off among approxima- tion error, estimation error and model complexity without prior knowledge about the true regression function.
Journal of Statistical Planning and InferenceInequalities for uniform deviations of averages from expectations with applications to nonparametric regression
45 Citations2000Michael Köhler
New inequalities for uniform deviations of averages from their expectations are derived and it is shown that the L 2 error of suitable defined least-squares spline estimates converges to zero with rate n −2 p /(2 p + d ) for every distribution of ( X, Y ) with X ∈[0,1] d a.s.
MetrikaNonparametric regression function estimation using interaction least squares splines and comlexity regularization
11 Citations1998Michael Köhler