Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem

@article{Cucker2002BestCF,
  title={Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem 
},
  author={F. Cucker and S. Smale},
  journal={Foundations of Computational Mathematics},
  year={2002},
  volume={2},
  pages={413-428}
}
  • F. Cucker, S. Smale
  • Published 2002
  • Mathematics, Computer Science
  • Foundations of Computational Mathematics
Abstract. No abstract.  
237 Citations

Topics from this paper

Regularization in kernel learning
  • 91
  • PDF
Regularization Approaches to Learning Theory
  • 2
  • PDF
Concentration estimates for learning with unbounded sampling
  • 33
  • PDF
Local Learning Estimates by Integral Operators
  • 7
Risk Bounds and Model Selection for Regularized Least Squares
  • PDF
Least Square Regression with lp-Coefficient Regularization
  • 28
Learning Rates of Regularized Regression for Functional Data
  • 7
Fast Rates for Regularized Least-squares Algorithm
  • 26
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Risk bounds for model selection via penalization
  • 712
  • PDF
Regularization Networks and Support Vector Machines
  • 1,242
  • PDF
Generalization bounds for function approximation from scattered noisy data
  • 81
On the mathematical foundations of learning
  • 1,353
  • PDF
Approximation and Estimation Bounds for Artificial Neural Networks
  • 398
  • PDF
Mathematics for computer algebra
  • 225
Neural Networks for Pattern Recognition
  • 14,094
Empirical Processes in M-Estimation
  • 514
  • PDF
Arsenin, Solutions of Ill-Posed Problems
  • Arsenin, Solutions of Ill-Posed Problems
  • 1977
...
1
2
...