Skip to main navigation Skip to search Skip to main content

Adaptive Regularization in Neural Network Modelling

  • Jan Larsen
  • , C Svarer
  • , Lars Nonboe Andersen
  • , Lars Kai Hansen
  • , G.B. Orr (Editor)
  • , K. Muller (Editor)
  • , R. Caruana (Editor)

    Research output: Book/ReportBookResearchpeer-review

    Abstract

    In this paper we address the important problem of optimizing regularization parameters in neural network modeling. The suggested optimization scheme is an extended version of the recently presented algorithm [25]. The idea is to minimize an empirical estimate - like the cross-validation estimate - of the generalization error with respect to regularization parameters. This is done by employing a simple iterative gradient descent scheme using virtually no additional programming overhead compared to standard training. Experiments with feed-forward neural network models for time series prediction and classification tasks showed the viability and robustness of the algorithm. Moreover, we provided some simple theoretical examples in order to illustrate the potential and limitations of the proposed regularization framework.
    Original languageEnglish
    PublisherSpringer Verlag
    Number of pages111
    Publication statusPublished - 1997
    SeriesLecture Notes in Computer Science
    Volume7700
    ISSN0302-9743

    Fingerprint

    Dive into the research topics of 'Adaptive Regularization in Neural Network Modelling'. Together they form a unique fingerprint.

    Cite this