Skip to main content
Log in

Global estimation of feedforward networks with a priori constraints

  • Published:
Computational Economics Aims and scope Submit manuscript

Abstract

This paper presents a feedforward network estimation algorithm that addresses two issues, (i) avoiding local inferior minima to the performance criteria, and (ii) imposinga 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 givena priori condition. We provide examples of imposinga priori information to (i) prevent the trained network from making fundamental errors and (ii) to test economically interesting hypotheses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baba, N., 1989, A new approach for finding the global minimum of error function of neural networks.Neural Networks,2, 367–373.

    Google Scholar 

  • Barron, A.R., 1991, Statistical properties of artificial neural networks. InProceedings NATO ASI on Nonparametric Functional Estimation. Kluwer Academic Publishers.

  • Barron, A.R., and Barron, R., 1988, Statistical learning networks: A unifying view. In Wegman, E. (ed.),Computing Science and Statistics: Proc. 20th Symp. Interface., pp. 192–203, Washington, D.C. American Statistical Association.

    Google Scholar 

  • Bishop, C.M., 1990, Curvature-driven smoothing in backpropagation neural networks. InProceedings of the International Conference on Neural Networks, pp. 749–752 New York. IEEE Press.

    Google Scholar 

  • Christensen, L., Jorgensen, D.W., and Lau, L., 1975, Transcendental logarithmic utility functions.American Economic Review,65, 367–383.

    Google Scholar 

  • Corana, A., Marchesi, M., Martini, C., & Ridella, S., 1987, minimizing multimodal functions of continuous variables with the ‘simulated annealing’ algorithm.ACM Transactions on Mathematical Software,13(3), 262–280.

    Google Scholar 

  • Davidson, R., & MacKinnon, J.G. (eds.), 1993,Estimation and Interface in Econometrics. Oxford University Press, New York, NY.

    Google Scholar 

  • Dorsey, R., Johnson, J., and Mayer, W., 1992, A genetic algorithm for the training of feedforward neural networks. In Whinston, A., and Johnson, J. (eds.),Advances in Artificial Intelligence in Economics, Finance, and Management. JAI Press, Greenwich, CN. (forthcoming).

    Google Scholar 

  • Gallant, A., 1981, On the bias in flexible functional forms and an essentially unbiased form.Journal of Econometrics,15, 211–245.

    Google Scholar 

  • Gallant, A., and Golub, G., 1984, Imposing curvature restrictions on flexible functional forms.Journal of Econometrics,26, 295–321.

    Google Scholar 

  • Gallant, A., & White, H. (1988).A Unified Theory of Estimation and Inference for Nonlinear Dynamic Models. Basil Blackwell, Oxford.

    Google Scholar 

  • Geman, S., Bienenstock, E., & Doursat, R. (1992). Neural networks and the bias/variance dilemma.Neural Computation, 4, 1–58.

    Google Scholar 

  • Geman, S., & Hwang, C.-R. (1986). Diffusions for global optimization.Siam Journal of Control and Optimization, 24, 1031–1043.

    Google Scholar 

  • Gill, P., Murray, W., & Wright, M. (1981).Practical Optimization. Academic Press, New York, NY.

    Google Scholar 

  • Goldberg, D. (1989).Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

  • Joerding, W., Li, Y., Hu, S., & Meador, J. (1992). Approximating production technologies with feedforward neural networks. In Whinston, A., & Johnson, J. (eds.),Advances in Artificial Intelligence in Economics, Finance, and Management. JAI Press, Greenwich, CN. forthcoming.

    Google Scholar 

  • Joerding, W.H., & Meador, J.L. (1991). Encoding a priori information in feedforward networks.Neural Networks, 4(6), 847–856.

    Google Scholar 

  • Joerding, W., & Li, Y. (1993). Approximating production functions with feedforward networks. Tech. rep., Washington State University, Department of Economics, Pullman, WA 99164.

    Google Scholar 

  • Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing.Science, 2(220), 671–780.

    Google Scholar 

  • Kruschke, J. (1989). Improving generalization in back-propagation networks with distributed bottlenecks. InInternational Joint Conference on Neural Networks, Vol. I, pp. 443–447 New York. IEEE Press.

    Google Scholar 

  • Li, Y. (1993).Semi-Nonparametric Estimation and Testing of Consumer Demand Systems. Ph.D. thesis, Washington State University.

  • McInerney, J., Haines, K., Biafore, S., & Hecht-Nielsen, R. (1989). Back propagation error surfaces can have local minima. InIEEE Conference on Neural Networks.

  • Morgan, N., & Bourlard, H. (1990). Generalization and parameter estimation in feedforward nets: Some experiments. In Touretzky, D.S. (Eds.),Neural Information Processing Systems II Morgan Kaufmann, San Mateo, CA.

    Google Scholar 

  • Psaltis, D., & Neifeld, M. (1988). The emergence of generalization in networks with constrained representations. InInternational Joint Conference on Neural Networks New York. IEEE Press.

    Google Scholar 

  • Stinchcombe, M., & White, H. (1990). Approximating, and learning unknown mappings using multilayer feedforward networks with bounded weights. InProceedings of the International Joint Conference on Neural Networks, Vol. III, pp. 7–16 New York. IEEE Press.

    Google Scholar 

  • Styblinski, M., & Tang, T.-S. (1990). Experiments in nonconvex optimization: Stochastic approximation with function smoothing and simulated annealing.Neural Networks, 3, 467–483.

    Google Scholar 

  • Szu, H. (1986). Fast simulated annealing. InAIP Conference Proceedings 151: Neural Network for Computing.

  • Szu, H., & Hartley, R. (1987). Fast simulated annealing.Physics Letters A, 122, 157–162.

    Google Scholar 

  • van Laarhoven, P. (1988).Theoretic and Computational Aspects of Simulated Annealing. Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands.

    Google Scholar 

  • van Laarhoven, P., & Aarts, E. (1987).Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Hingham, MA.

    Google Scholar 

  • Wasserman, P.D. (1988). Combined backpropagation/cauchy machine. InNeural Networks: Abstracts of the First INNS Meeting, p. 556 Elmsford, NY. Pergamon Press.

    Google Scholar 

  • Webb, A., & Lowe, D. (1988). A hybrid optimization strategy for adaptive feedforward layered networks. Tech. rep. 4193, Royal Signals and Radar Establishment Memorandum, Ministry of Defence, Malvern, UK.

    Google Scholar 

  • White, H. (1989). Learning in artificial neural networks: A statistical perspective.Neural Computing, 1, 425–464.

    Google Scholar 

  • White, H. (1990). Connectionist nonparametric regression: Multilayer feedforward networks can learn arbitrary mappings.Neural Networks, 3(5), 535–549.

    Google Scholar 

  • Young, D. (1982). Economics of fertilizer use. InThe Fertilizer Handbook, pp. 209–221. The Fertilizer Institute, Washington DC.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was partially funded by National Science Foundation Grant No. SES-9022773 and by an equipment grant from Torque Systems, Inc.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Joerding, W., Li, Y. Global estimation of feedforward networks with a priori constraints. Comput Econ 7, 73–87 (1994). https://doi.org/10.1007/BF01299568

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01299568

Keywords

Navigation