This paper compares alternative methods for approximating and solving the stochastic growth model with parameterized expectations. We compare polynomial and neural netowork specifications for expectations, and we employ both genetic algorithm and gradient-descent methods for solving the alternative models of parameterized expectations. Many of the statistics generated by the neural network specification in combination with the genetic algorithm and gradient descent optimization methods approach the statistics generated by the exact solution with risk aversion coefficients close to unity and full depreciation of the capital stock. For the alternative specification, with no depreciation of capital, the neural network results approach those generated by computationally-intense methods. Our results suggest that the neural network specification and genetic algorithm solution methods should at least complement parameterized expectation solutions based on polynomial approximation and pure gradient-descent optimization.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 34 pages Date of creation: 30 Apr 1998 Date of revision:
04 May 1998 Handle: RePEc:wpa:wuwpge:9804004
Note: Type of Document - MS Word 97; prepared on IBM PC; to print on HP; pages: 34 ; figures: included Contact details of provider: Web page: http://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.