Complexity control in statistical learning
From MaRDI portal
Publication:2371223
Recommendations
Cites work
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- scientific article; zbMATH DE number 1322222 (Why is no real title available?)
- Information criteria for selecting possibly misspecified parametric models
- Learning from examples as an inverse problem
- Learning theory estimates via integral operators and their approximations
- Model Selection and Multimodel Inference
- On the mathematical foundations of learning
- Rates of uniform convergence of empirical means with mixing processes
- Regularization networks and support vector machines
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(10)- On rough models of history records
- The complexity of model classes, and smoothing noisy data
- Model complexity control and statistical learning theory
- Complete statistical theory of learning
- Regularization and the small-ball method. II: Complexity dependent error rates
- scientific article; zbMATH DE number 2152981 (Why is no real title available?)
- Concept learning using complexity regularization
- Learning by canonical smooth estimation. II. Learning and choice of model complexity
- scientific article; zbMATH DE number 6401690 (Why is no real title available?)
- Measuring Complexity of Learning Schemes Using Hessian-Schatten Total Variation
This page was built for publication: Complexity control in statistical learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371223)