[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A new penalty-based criterion for model selection in regularized nonlinear models

  • Conference paper
  • First Online:
Computational Methods in Neural Modeling (IWANN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2686))

Included in the following conference series:

  • 1042 Accesses

Abstract

In this paper we describe a new penalty-based model selection criterion for nonlinear models which is based on the influence of the noise in the fitting. According to Occam’s razor we should seek simpler models over complex ones and optimize the trade-off between model complexity and the accuracy of a model’s description to the training data. An empirical derivation is developed and computer simulations for multilayer perceptron with weight decay regularization are made in order to show the efficiency and robustness of the method in comparison with other well-known criteria for nonlinear systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akaike, H. Statistical predictor identification. Ann. Inst. Statist. Math. 22 (1970) 203–217

    Article  MATH  MathSciNet  Google Scholar 

  2. Akaike, H. Information theory and an extension of the maximum likelihood principle. In B.N. Petrov and Csaki ed. 2nd Intl. Symp. Inform. Theory (1973) 267–281, Budapest.

    Google Scholar 

  3. Barron, A. Predicted squared error: a criterion for automatic model selection. Self-Organizing Methods in Modeling, S. Farlow, ed., Marcel Dekker, New York (1984)

    Google Scholar 

  4. Cherkassky V., Mulier F.: Learning from data: concepts, theory and methods. New York, Wiley (1998)

    MATH  Google Scholar 

  5. Craven P., Wahba G. Smoothing noisy data with spline functions: estimating the correct degree of smoothing by the method of generalized cross-validation. Numer. Math., 31:377–403(1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Efron B. & Tibshirani R. J., An Introduction to the Bootstrap. London, U.K.: Chapman & Hall (1993)

    MATH  Google Scholar 

  7. Larsen J., Hansen L.K.: Generalization performance of regularized neural network models. Proc. IEEE Workshop: Neural Networks for Signal Processing IV, Piscataway, New Jersey (1994) 42–51

    Google Scholar 

  8. Mallows, C. L. Some comments on CP. Technometrics 15 (1973):661–675

    Article  MATH  Google Scholar 

  9. Moody, J.: The effective number of parameters: an analysis of generalization and regularization in nonlinear learning systems. NIPS (1992) 847–854

    Google Scholar 

  10. Moody, J.: Prediction Risk and Architecture Selection for Neural Networks. In Cherkassky, V., et al. editors, From Statistics to Neural Networks: Theory and Pattern Recognition Applications, NATO ASI Series F. Springer-Verlag (1994)

    Google Scholar 

  11. Murata N., Yoshizawa S., Amari S.: Network Information Criterion— Determining the Number of Hidden Units for an Artificial Neural Network Model. IEEE Transactions on Neural Networks (1994) 5, 865–872

    Article  Google Scholar 

  12. Pizarro J., et al.: Noise derived information criterion for model selection. Proceedings of European Symposium on Artificial Neural Networks, ESANN (2002) pp. 155–160

    Google Scholar 

  13. Sarle W.: Donojo-Jonhstone benchmarks: neural nets results, ftp://ftp.sas.com/pub/neural/dojo/dojo.html (1999)

  14. Stone, M.. Cross-validation: a review. Math. Operations for Sch. Statist., ser. Statistic, (1978) 9, 1.

    Google Scholar 

  15. Vapnik, V. Statistical Learning Theory John Wiley, New York (1995)

    Google Scholar 

  16. Zapranis A., Refenes A.: Principles of Neural Model Identification, Selection and Adequacy: with applications to financial economics. (Perspectives in neural computing). Springer-Verlag London (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guerrero, E., Pizarro, J., Yáñez, A., Galindo, P. (2003). A new penalty-based criterion for model selection in regularized nonlinear models. In: Mira, J., Álvarez, J.R. (eds) Computational Methods in Neural Modeling. IWANN 2003. Lecture Notes in Computer Science, vol 2686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44868-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-44868-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40210-7

  • Online ISBN: 978-3-540-44868-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics