HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Schraudolph, N. N. Search for Related Content PubMed PubMed Citation Articles by Schraudolph, N. N.

A Fast, Compact Approximation of the Exponential Function

IDSIA, Lugano, Switzerland

Neural network simulations often spend a large proportion of their time computing exponential functions. Since the exponentiation routines of typical math libraries are rather slow, their replacement with a fast approximation can greatly reduce the overall computation time. This article describes how exponentiation can be approximated by manipulating the components of a standard (IEEE-754) floating-point representation. This models the exponential function as well as a lookup table with linear interpolation, but is significantly faster and more compact.

This article has been cited by other articles:

				N. N. Schraudolph Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent Neural Comput., July 1, 2002; 14(7): 1723 - 1738. [Abstract] [Full Text] [PDF]

				G. C. Cawley On a Fast, Compact Approximation of the Exponential Function Neural Comput., September 1, 2000; 12(9): 2009 - 2012. [Abstract] [Full Text]