Skip to main content

Large Ensemble Averaging

  • Chapter
  • First Online:
Neural Networks: Tricks of the Trade

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1524))

  • 5409 Accesses

Abstract

Averaging over many predictors leads to a reduction of the variance portion of the error. We present a method for evaluating the mean squared error of an infinite ensemble of predictors from finite (small size) ensemble information. We demonstrate it on ensembles of networks with difierent initial choices of synaptic weights.We find that the optimal stopping criterion for large ensembles occurs later in training time than for single networks. We test our method on the suspots data set and obtain excellent results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Elman and D. Zipser. Learning the Hidden Structure of Speech. J. Acoust. Soc. Amer. 83, 1615–1626. 1988.

    Article  Google Scholar 

  2. S. Geman, E. Bienenstock and R. Doursat. Neural networks and the bias/variance dilemma. Neural Comp., 4(1):1–58. 1992.

    Article  Google Scholar 

  3. W.P. Lincoln and J. Skrzypek. Synergy of clustering multiple back propagation networks. In Touretzky, D. S, editors, Advances in Neural Information Processing Systems 2, pages 650–657, SanMateo, CA. Morgan Kaufmann 1990.

    Google Scholar 

  4. J. Morris Forecasting the sunspot cycle. J. Roy. Stat. Soc. Ser. A, 140, 437–447 1977.

    Google Scholar 

  5. U. Naftaly, N. Intrator and D. Horn. Optimal Ensemble Averaging of Neural Networks. Network, Comp. Neural Sys., 8, 283–296 1997.

    Article  MATH  Google Scholar 

  6. S.J. Nowlan and G.E. Hinton. Simplifying neural networks by soft weight-sharing. Neural Computation. 4, 473–493 1992.

    Article  Google Scholar 

  7. P.M. Perrone. Improving regression estimation: averaging methods for variance reduction with extensions to general convex measure optimization. PhD thesis BrownUniversity, Institute for Brain and Neural Systems, 1993.

    Google Scholar 

  8. H. Pi and C. Peterson. Finding the Embedding Dimension and Variable Dependencies in Time Series. Neural Comp. 6, 509–520 1994.

    Article  Google Scholar 

  9. M.B. Priestley. Spectral Analysis and Time Series. Academic Press. 1981.

    Google Scholar 

  10. A.S. Weigend, B.A. Huberman and D. Rumelhart. Predicting the future: A connectionist approach. Int. J. Neural Syst. 1, 193–209 1990.

    Article  Google Scholar 

  11. D. H. Wolpert. Stacked generalization. Neural Networks 5:241–259 1992

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Horn, D., Naftaly, U., Intrator, N. (1998). Large Ensemble Averaging. In: Orr, G.B., Müller, KR. (eds) Neural Networks: Tricks of the Trade. Lecture Notes in Computer Science, vol 1524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49430-8_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-49430-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65311-0

  • Online ISBN: 978-3-540-49430-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics