# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Heuristics of instability and stabilization in model selection. (English) Zbl 0867.62055

Summary: In model selection, usually a “best” predictor is chosen from a collection $\left\{\stackrel{^}{\mu }\left(·,s\right)\right\}$ of predictors where $\stackrel{^}{\mu }\left(·,s\right)$ is the minimum least-squares predictor in a collection ${𝒰}_{s}$ of predictors. Here, $s$ is a complexity parameter; that is, the smaller $s$, the lower dimensional/smoother the models in ${𝒰}_{s}$. If $ℒ$ is the data used to derive the sequence $\left\{\stackrel{^}{\mu }\left(·,s\right)\right\}$, the procedure is called unstable if a small change in $ℒ$ can cause large changes in $\left\{\stackrel{^}{\mu }\left(·,s\right)\right\}$. With a crystal ball, one could pick the predictor in $\left\{\stackrel{^}{\mu }\left(·,s\right)\right\}$ having minimum prediction error. Without prescience, one uses test sets, cross-validation and so forth. The difference in prediction error between the crystal ball seletion and the statistician’s choice we call predictive loss. For an unstable procedure the predictive loss is large.

This is shown by some analytics in a simple case and by simulation results in a more complex comparison of four different linear regression methods. Unstable procedures can be stabilized by perturbing the data, getting a new predictor sequence $\left\{{\stackrel{^}{\mu }}^{\text{'}}\left(·,s\right)\right\}$ and then averaging over many such predictor sequences.

##### MSC:
 62H99 Multivariate analysis 62J05 Linear regression