• DocumentCode
    1842387
  • Title

    New block recursive MLP training algorithms using the Levenberg-Marquardt algorithm

  • Author

    Stan, Octavian ; Kamen, Edward W.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • Volume
    3
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    1672
  • Abstract
    A block formulation of the Levenberg-Marquardt algorithm to train feedforward MLPs is designed to track time-varying nonlinear functions. The resulting algorithm is called the block Levenberg-Marquardt algorithm. There are two varieties of the algorithm: the overlapping and the non-overlapping block Levenberg-Marquardt. The two algorithms are developed in terms of a block presentation of the input/output training set. The tracking problem can be viewed as one of solving a sequence of nonlinear identification problems. With the persistent excitation and slowly-varying system conditions satisfied, the Levenberg-Marquardt algorithm can be shown to have a uniform rate of convergence over the entire sequence of problems. The block Levenberg-Marquardt algorithms are tested on a nonlinear time-varying function tracking problem. The algorithms show performance that is superior to the performance of existing algorithms like the global extended Kalman filter algorithm with state noise in the system equations
  • Keywords
    convergence; learning (artificial intelligence); multilayer perceptrons; nonlinear functions; tracking; Levenberg-Marquardt algorithm; block recursive learning; convergence; multilayer perceptrons; time-varying nonlinear functions; tracking; Adaptive control; Algorithm design and analysis; Convergence; Frequency; Neural networks; Nonlinear equations; Recursive estimation; System identification; Testing; Time varying systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1999. IJCNN '99. International Joint Conference on
  • Conference_Location
    Washington, DC
  • ISSN
    1098-7576
  • Print_ISBN
    0-7803-5529-6
  • Type

    conf

  • DOI
    10.1109/IJCNN.1999.832625
  • Filename
    832625