Skip to main content

Speeding Up Back Propagation by Partial Evaluation

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

We automatically specialize a general Back Propagation learning algorithm to a particular network topology, obtaining a specialized learning algorithm which is faster than the general one.

The automatic specialization is done by a partial evaluator for a subset of the imperative programming language C.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. L.O. Andersen. C program specialization. Technical Report 92/14, DIKU, University of Copenhagen, Denmark, May 1992.

    Google Scholar 

  2. L.O. Andersen. Partial evaluation of C and automatic compiler generation (extended abstract). In U. Kastens and P. Pfahler, editors, Compiler Construction, Paderborn, Germany, October 1992. (Lecture Notes in Computer Science, vol. 641), pages 251–257. Springer-Verlag, 1992.

    Google Scholar 

  3. L. Beckman et al. A partial evaluator, and its use as a programming tool. Artificial Intelligence, 7(4): 319–357, 1976.

    Article  MATH  Google Scholar 

  4. M.A. Bulyonkov. Polyvariant mixed computation for analyzer programs. Acta Information, 21: 473–484, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  5. C.K. Gomard and N.D. Jones. Compiler generation by partial evaluation: a case study. Structured Programming, 12: 123–144, 1991.

    Google Scholar 

  6. H.F. Jacobsen. Speeding up the back-propagation algorithm by partial evaluation. DIKU Student Project 90-10-13, 32 pages. DIKU, University of Copenhagen. (In Danish), October 1990.

    Google Scholar 

  7. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993. To appear.

    Google Scholar 

  8. N.D. Jones, P. Sestoft, and H. Søndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1): 9–50, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag/Wien

About this paper

Cite this paper

Jacobsen, H.F., Gomard, C.K., Sestoft, P. (1993). Speeding Up Back Propagation by Partial Evaluation. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7533-0_10

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82459-7

  • Online ISBN: 978-3-7091-7533-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics