Global Estimation of Feedforward Networks with a Priori Constraints

Wayne H Joerding and Ying Li

Computational Economics, 1994, vol. 7, issue 2, 73-87

Abstract: This paper presents a feedforward network estimation algorithm that addresses two issues, (i) avoiding local inferior minima to the performance criteria, and (ii) imposing a priori constraints to improve generalization and test economic hypotheses. The algorithm combines methods either previously developed or obviously beneficial but not yet combined. These involve combining linear least squares with simulated annealing, along with weight space reducing methods, to considerably improve its speed relative to pure simulated annealing. We present evidence on the algorithm's reliability at finding a global minimum. We also demonstrate how to constrain the estimation process to find networks that satisfy a given a priori condition. We provide examples of imposing a priori information to (i) prevent the trained network from making fundamental errors and (ii) to test economically interesting hypotheses. Citation Copyright 1994 by Kluwer Academic Publishers.

Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:compec:v:7:y:1994:i:2:p:73-87

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2

Access Statistics for this article

Computational Economics is currently edited by Hans Amman

More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().