BIROn - Birkbeck Institutional Research Online

    Convergence analysis of the quickprop method

    Vrahatis, M.N. and Magoulas, George and Plagianakos, V.P. (1999) Convergence analysis of the quickprop method. In: UNSPECIFIED (ed.) International Joint Conference Neural Networks: IJCNN 1999. IEEE Computer Society, pp. 1209-1214. ISBN 0780355296.

    Full text not available from this repository.

    Abstract

    A mathematical framework for the convergence analysis of the well known Quickprop method is described. The convergence of this method is analyzed. Furthermore, we present modifications of the algorithm that exhibit improved convergence speed and stability and at the same time, alleviate the use of heuristic learning parameters. Simulations are conducted to compare and evaluate the performance of a proposed modified Quickprop algorithm with various popular training algorithms. The results of the experiments indicate that the increased convergence rates, achieved by the proposed algorithm, affect by no means its generalization capability and stability.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 06 Jul 2021 13:23
    Last Modified: 06 Jul 2021 13:23
    URI: https://eprints.bbk.ac.uk/id/eprint/45007

    Statistics

    Downloads
    Activity Overview
    0Downloads
    7Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item