Several different bandwidth selection methods are available in PROC KDE in the univariate case. Following the recommendations of Jones, Marron, and Sheather (1996), the default method follows a plugin formula of Sheather and Jones.
This method solves the fixedpoint equation

where .
PROC KDE solves this equation by first evaluating it on a grid of values spaced equally on a log scale. The largest two values from this grid that bound a solution are then used as starting values for a bisection algorithm.
The simple normal reference rule works by assuming is Gaussian in the preceding fixedpoint equation. This results in






where is the sample standard deviation.
Alternatively, the bandwidth can be computed using the interquartile range, Q:









Silverman’s rule of thumb (Silverman, 1986, Section 3.4.2) is computed as

The oversmoothed bandwidth is computed as

When you specify a WEIGHT variable, PROC KDE uses weighted versions of , , and in the preceding expressions. The weighted quartiles are computed as weighted order statistics, and the weighted variance takes the form

where is the weighted sample mean.
For the bivariate case, Wand and Jones (1993) note that automatic bandwidth selection is both difficult and computationally expensive. Their study of various ways of specifying a bandwidth matrix also shows that using two bandwidths, one in each coordinate’s direction, is often adequate. PROC KDE enables you to adjust the two bandwidths by specifying a multiplier for the default bandwidths recommended by Bowman and Foster (1993):






Here and are the sample standard deviations of X and Y, respectively. These are the optimal bandwidths for two independent normal variables that have the same variances as X and Y. They are, therefore, conservative in the sense that they tend to oversmooth the surface.
You can specify the BWM= option to adjust the aforementioned bandwidths to provide the appropriate amount of smoothing for your application.