Approximating and simulating the stochastic growth model: Parameterized expectations, neural networks, and the genetic algorithm
From MaRDI portal
Publication:5941340
DOI10.1016/S0165-1889(99)00077-9zbMath0981.91069MaRDI QIDQ5941340
No author found.
Publication date: 20 August 2001
Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)
Related Items
A taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study, Feedback approximation of the stochastic growth model by genetic neural networks, Central bank learning and Taylor rules with sticky import prices, Inflation targeting, learning and Q volatility in small open economies, COMPUTATION OF BUSINESS CYCLE MODELS: A COMPARISON OF NUMERICAL METHODS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection methods for solving aggregate growth models
- Tackling real-coded genetic algorithms: operators and tools for behavioural analysis
- Algorithms and economic dynamics. Selected papers from the 2nd annual meeting of the Society for Computational Economics, Geneva, Switzerland, 1996
- Genetic algorithm learning and the cobweb model
- Functional search in economics using genetic programming
- Algorithms for solving dynamic models with occasionally binding constraints
- Multilayer feedforward networks are universal approximators
- A distributed parallel genetic algorithm for solving optimal growth models
- LEARNING AND EXCESS VOLATILITY
- Quadrature-Based Methods for Obtaining Approximate Solutions to Nonlinear Asset Pricing Models
- Universal approximation bounds for superpositions of a sigmoidal function
- Accuracy in Simulations
- Artificial neural networks: an econometric perspective∗