login

A Fast, Compact Approximation of the Exponential Function

Neural ComputationPublished 1 May 1999
Nicol N. Schraudolph
Citations152
SJR quartileQ1
SJR score0.83
SNIP1.45

TL;DR

This article describes how exponentiation can be approximated by manipulating the components of a standard (IEEE-754) floating-point representation, which models the exponential function as a lookup table with linear interpolation, but is significantly faster and more compact.

Abstract

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.

Keywords

Computer SciencePhysics and Astronomy