Laplace’s method is a technique in asymptotic analysis for approximating integrals whose integrands contain a large positive parameter in an exponential factor. For an integral of the form
the dominant contribution usually comes from neighborhoods where attains its largest value. When there is a unique interior maximum with nonzero negative second derivative, replacing the exponent locally by a quadratic function yields a Gaussian integral and an explicit leading approximation. The method is named after Pierre-Simon Laplace and is widely used in mathematical analysis, probability, statistics, and mathematical physics.
Basic approximation
Suppose is real-valued and has a unique global maximum at an interior point , with
If is continuous at , , and suitable smoothness and tail conditions hold, then
Here means that .
The three factors have distinct roles:
- gives the exponential scale.
- gives the amplitude at the dominant point.
- measures the effective width of the peak.
Thus the peak contributes over a width of order , with narrower concentration when the curvature is larger.
An equivalent minimum formulation is often convenient:
If has a unique nondegenerate interior minimum at , then
Why the method works
The local argument follows from a Taylor expansion:
Writing and introducing the scaled variable
gives, for bounded ,
Consequently,
The integral is , the normalization underlying the normal distribution.
The global part of the argument establishes that regions away from are negligible. On a compact interval, continuity and uniqueness of the maximum imply that, outside any fixed neighborhood of ,
for some . Contributions from that region are therefore exponentially smaller than the peak contribution.
On an unbounded domain, uniqueness of the maximum alone is insufficient: the tails also require control. One useful sufficient set of conditions is a strict gap below the maximum outside a bounded neighborhood, together with
for some fixed . Such conditions justify discarding the tails and applying a local convergence argument.
Higher-order terms and error estimates
Additional smoothness produces corrections in inverse powers of . Under suitable regularity and localization assumptions,
The remainder is expressed using big-O notation. With all derivatives evaluated at ,
These terms account for variation in the amplitude, asymmetry of the peak, and departures from quadratic curvature. In particular, the leading approximation generally has relative error when and the required assumptions hold.
The full expansion is generally asymptotic rather than convergent. Adding terms may improve accuracy initially without producing a convergent series at fixed . If , the displayed leading contribution vanishes, and the first nonzero term must be found from a more detailed local expansion.
Multidimensional form
For a domain , consider
Suppose has a unique interior maximizer , its gradient vanishes there, and
is a positive-definite matrix. Here is the Hessian matrix. Subject to suitable smoothness and global control,
where is the determinant of .
The local approximation is a multivariate normal distribution centered at , with covariance matrix
Each locally curved direction contributes a factor of order ; the determinant combines the curvature in all directions.
Example: Stirling’s approximation
An important application is Stirling’s approximation for factorials. The gamma function gives
Substituting yields
For
the unique maximum occurs at , where
Laplace’s method therefore gives
The first correction is
Bayesian and statistical applications
Posterior approximation
In Bayesian inference, a posterior density has the form
Define the log unnormalized posterior
If has a well-concentrated interior maximum at , with positive-definite negative Hessian
then
The center is a maximum a posteriori estimate.
In regular, fixed-dimensional statistical models, increasing sample size often supplies the large parameter: the log likelihood is a sum over observations and its curvature typically grows with sample size. The approximation is not automatically justified for arbitrary data sets or models.
Marginal likelihood and expectations
The marginal likelihood is the normalizing integral
Using the same notation,
Posterior expectations can likewise be approximated as ratios of integrals:
The simplest leading approximation is , when the numerator and denominator have compatible dominant behavior. Higher-order methods capture posterior spread and asymmetry.
These deterministic approximations can be computationally cheaper than Markov chain Monte Carlo, but their accuracy depends strongly on the shape of the posterior and on finding the relevant modes.
Multiple peaks, boundaries, and degeneracy
Several dominant maxima
If finitely many isolated, nondegenerate interior maxima share the same global height, their leading contributions add:
provided the summed leading term does not cancel.
Lower local maxima are exponentially suppressed when their height gap remains fixed as . Approximating a multimodal integral using only one peak can therefore miss a substantial contribution when several peaks have comparable heights.
Boundary maxima
If the maximum occurs at the left endpoint and , the local exponent is linear rather than quadratic. Under suitable conditions,
The leading power is , not .
If the endpoint is stationary, with and , a smooth one-sided neighborhood contributes half the corresponding full Gaussian leading term.
Degenerate maxima
If , the Gaussian formula generally fails. Suppose instead that
For an interior maximum with contributions from both sides,
The concentration width is then . A continuum of maxima, rather than isolated points, requires a different analysis that separates directions along the maximizing set from directions transverse to it.
Related methods and limitations
The method of stationary phase treats oscillatory integrals such as
There, cancellation replaces exponential suppression, and stationary points need not be maxima. The method of steepest descent extends related ideas to complex integrals by deforming contours through suitable saddle points.
Laplace’s method is distinct from the Laplace transform, although it can approximate such transforms in appropriate parameter limits.
Practical implementation combines optimization with curvature calculations. Logarithms help avoid numerical overflow, while a Cholesky decomposition can evaluate the log determinant of a positive-definite Hessian and solve the required linear systems without explicitly forming its inverse.
Important limitations include:
- Weak concentration: a local quadratic approximation may not represent much of the integral at moderate parameter values.
- Nearly singular curvature: flat directions make the Gaussian scale unreliable.
- Nonuniform behavior: moving or merging maxima can invalidate an approximation derived for fixed parameters.
- Increasing dimension: fixed-dimensional error estimates need not remain small when dimension grows with sample size.
- Reparameterization: a density’s mode and local Gaussian form depend on coordinates. Consistently transformed integral expansions preserve the integral’s asymptotic value, but finite-order Gaussian posterior approximations need not agree exactly across parameterizations.
When maxima merge or approach a boundary, specialized uniform approximations may be necessary to describe the transition accurately.