GLOBAL OPTIMIZATION METHODS
Lonnie Hamm and
No 36631, 2002 Annual Meeting, July 28-31, 2002, Long Beach, California from Western Agricultural Economics Association
Training a neural network is a difficult optimization problem because of numerous local minimums. Many global search algorithms have been used to train neural networks. However, local search algorithms are more efficient with computational resources, and therefore numerous random restarts with a local algorithm may be more effective than a global algorithm. This study uses Monte-Carlo simulations to determine the relative efficiency of a local search algorithm to 9 stochastic global algorithms. The computational requirements of the global algorithms are several times higher than the local algorithm and there is little gain in using the global algorithms to train neural networks.
Keywords: Research; Methods/; Statistical; Methods (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ags:waealb:36631
Access Statistics for this paper
More papers in 2002 Annual Meeting, July 28-31, 2002, Long Beach, California from Western Agricultural Economics Association Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().