Tutorials › Exam SRM - Statistics for Risk Modeling › Average Leverage and Leverage Cutoffs

Exam SRM · Regression Diagnostics · Tutorial 99 of 926

Average Leverage and Leverage Cutoffs

Learn to calculate average leverage and apply common leverage cutoffs while keeping their limits clear.

Intermediate 9 min read

What You'll Learn

  • Derive average diagonal leverage from the hat matrix and its trace
  • Distinguish the number of predictors from the number of estimated coefficients
  • Calculate common two-times-average and three-times-average screening cutoffs
  • Interpret an observation’s leverage relative to its model’s design and sample size
  • Explain why a cutoff is an alert for review, not a verdict about an observation

Why Average Leverage Is a Useful Reference

Leverage describes how unusual an observation’s predictor values are relative to the predictor values used to fit a regression model. It is a property of the design matrix, not of the observed response. In a regression diagnostic, an individual leverage value is easier to interpret when compared with the average leverage for that model.

The average is determined by the model’s fitted dimension and the sample size. This gives a useful baseline, but it does not make any particular observation problematic. Common rules flag values that are two or three times the average for further examination. Those rules are screening conventions, not formal hypothesis tests or automatic deletion rules.

Definition: In an ordinary least squares regression with an intercept and \(p\) predictors, let \(n\) be the number of observations and let \(k=p+1\) be the number of estimated regression coefficients, including the intercept. The diagonal leverage values are \(h_{11},\ldots,h_{nn}\). Their average is \(k/n=(p+1)/n\). Common screening cutoffs are \(2k/n\) and \(3k/n\).

Deriving the Average Leverage

Suppose the model has a fixed design matrix \(X\) with \(n\) rows and \(k\) linearly independent columns, including a column of ones for the intercept. Ordinary least squares then uses the hat matrix \(H=X(X^\mathsf{T}X)^{-1}X^\mathsf{T}\) to map the observed response vector to its fitted values. The leverage \(h_{ii}\) is the \(i\)th diagonal entry of \(H\).

The key fact is that \(H\) is a projection matrix onto the column space of \(X\). Its trace, the sum of its diagonal entries, equals its rank. Since \(X\) has full column rank \(k\), the rank of \(H\) is \(k\). Therefore the total leverage is \(k\), and dividing by the \(n\) diagonal entries gives the average.

$$ \sum_{i=1}^{n} h_{ii}=\operatorname{tr}(H)=\operatorname{rank}(H)=k \qquad\Longrightarrow\qquad \overline{h}=\frac{1}{n}\sum_{i=1}^{n}h_{ii}=\frac{k}{n}=\frac{p+1}{n}. $$

This result assumes ordinary least squares, a full-column-rank design matrix, and the stated model specification. If there is no intercept, or if the fitted design has a different number of linearly independent columns, use the rank of the design matrix in place of \(p+1\). If predictors are exactly collinear, the ordinary inverse in the displayed formula does not exist; the effective fitted dimension must be determined using the appropriate rank or fitting procedure.

Because leverage is a diagonal element of a projection matrix, each \(h_{ii}\) lies between 0 and 1. A value near 1 means that the fitted value at that design point depends strongly on that observation’s response. That fact alone does not establish that the response is unusual or that the observation changes a conclusion.

Common Screening Cutoffs

A frequently used screening approach compares each \(h_{ii}\) with two reference levels: twice the average leverage and three times the average leverage. For a regression with an intercept, those are \(2(p+1)/n\) and \(3(p+1)/n\). Some sources write the rule using \(p\) for the number of estimated coefficients rather than the number of predictors. Checking the author’s convention prevents an off-by-one error.

ComparisonInterpretation as a screening convention
\(h_{ii}\leq 2k/n\)Does not exceed the two-times-average reference level.
\(2k/n<h_{ii}\leq 3k/n\)Exceeds the lower reference level; review the design point and model context.
\(h_{ii}>3k/n\)Exceeds the higher reference level; this is a stronger prompt for investigation, not a verdict.

The cutoffs depend on both the number of fitted coefficients and the sample size. Adding predictors increases the average leverage because the model fits in a higher-dimensional space. With a fixed number of coefficients, increasing the sample size reduces the average. A cutoff greater than 1 cannot be exceeded, since no diagonal leverage is greater than 1. In a small sample, this can make a nominal screening rule uninformative.

The two-times and three-times rules are conventions rather than universal laws. They do not account for every feature of the predictor distribution, and a value below a cutoff is not proof that the design point is ordinary. A value above a cutoff is a reason to inspect the observation and the model specification. It is not, by itself, grounds to remove a data point.

Worked Example: Applying Both Cutoffs in a Multiple Regression

A hypothetical pricing study fits an ordinary least squares model with an intercept and three predictors to \(n=40\) policies. One policy has diagonal leverage \(h_{ii}=0.24\). Calculate the average leverage and both screening cutoffs, then interpret the policy’s leverage.

Method. Count all fitted coefficients, including the intercept. Here \(p=3\), so \(k=p+1=4\).

The average leverage is

$$ \overline{h}=\frac{k}{n}=\frac{4}{40}=0.10. $$

The two screening levels are

$$ \frac{2k}{n}=\frac{2(4)}{40}=0.20, \qquad \frac{3k}{n}=\frac{3(4)}{40}=0.30. $$

The policy’s leverage, \(0.24\), is greater than \(0.20\) but less than \(0.30\). It exceeds the two-times-average reference level but not the three-times-average level. The appropriate conclusion is that its predictor combination merits review. The cutoff does not show that the response is an outlier or that the policy has materially affected the fitted model.

Check. The total leverage across all 40 observations must be \(k=4\). An average of \(0.10\) gives \(40(0.10)=4\), as required. Common mistake avoided: treating an exceedance of \(2k/n\) as proof that an observation must be removed.

Leverage in a Simple Regression

For a simple linear regression with an intercept and one quantitative predictor \(x\), the diagonal leverage for observation \(i\) can also be written in terms of the predictor’s distance from its sample mean:

$$ h_{ii}=\frac{1}{n}+\frac{(x_i-\bar{x})^2}{\sum_{j=1}^{n}(x_j-\bar{x})^2}. $$

The first term, \(1/n\), is shared by all observations. The second term is larger when \(x_i\) is farther from the predictor mean relative to the overall spread of the predictor values. Thus, an unusually extreme predictor value can have high leverage even though leverage says nothing by itself about whether the observed response is unusual.

Worked Example: Finding the Leverage of an Extreme Predictor Value

A hypothetical model relates claim-processing time to the number of documents in a file. The six predictor values are \(1,2,3,4,5,10\) documents. The fitted model has an intercept and one predictor. Calculate the leverage for the observation with \(x_i=10\), then compare it with the usual screening levels.

Method. First calculate the predictor mean:

$$ \bar{x}=\frac{1+2+3+4+5+10}{6}=\frac{25}{6}. $$

The sum of squared deviations is

$$ \sum_{j=1}^{6}(x_j-\bar{x})^2 =\frac{361+169+49+1+25+1225}{36} =\frac{1830}{36} =\frac{305}{6}. $$

For \(x_i=10\), the deviation from the mean is \(10-25/6=35/6\), so its squared deviation is \(1225/36\). Substituting into the simple-regression leverage formula gives

$$ h_{ii} =\frac{1}{6}+\frac{1225/36}{305/6} =\frac{1}{6}+\frac{245}{366} =\frac{306}{366} =\frac{51}{61} \approx 0.8361. $$

There are \(k=2\) fitted coefficients and \(n=6\) observations. The average is \(2/6=0.3333\); the two-times-average cutoff is \(4/6=0.6667\), and the three-times-average cutoff is \(6/6=1\). The leverage \(0.8361\) exceeds the lower cutoff but not the higher one. It is a strong screening alert because this observation’s predictor value is far from the others, but the cutoff alone does not establish that the observation should be excluded.

Check. In this full-rank simple regression, the six leverages must sum to 2. The leverage calculation uses the predictor values and design, not the processing time. Common mistake avoided: using the response value to calculate leverage, or interpreting high leverage as a large response residual.

Why a Cutoff Is an Alert, Not a Verdict

A cutoff compresses a complicated predictor-space comparison into a convenient number. That makes it useful for screening many observations, but it cannot replace context. A design point can be unusual because it represents a legitimate but rare combination of predictor values. Conversely, a point can fall below a screening threshold while still being worth checking if the data-entry process, model form, or study design raises concerns.

Keep three questions separate:

  • How unusual are the predictors? Leverage addresses the observation’s position in the fitted predictor space.
  • How unusual is the response relative to the fitted value? That requires examining residual-based diagnostics, not leverage alone.
  • Does the observation materially affect the fit? A leverage cutoff by itself does not answer this question.

This distinction matters in actuarial work. A hypothetical policy with rare but valid characteristics could have high leverage simply because few similar policies were observed. That may identify a region where the fitted relationship is supported by limited data. It does not establish a data error, an abnormal claim outcome, or a reason to remove the policy. The analyst should first verify the observation and the model specification, then assess the relevant diagnostics and business context.

Worked Example: Avoiding the Predictor-Count Trap

A hypothetical reserve study uses \(n=30\) observations and a regression with an intercept and four predictors. An observation has leverage \(0.30\). A reviewer calculates a two-times-average cutoff and reports that this observation exceeds it. Check the calculation and give the correct interpretation.

Method. The model has four predictors but five estimated coefficients: the intercept plus the four predictor coefficients. Thus \(p=4\) and \(k=p+1=5\).

The average leverage is \(5/30=0.1667\). The correct two-times-average cutoff is

$$ \frac{2k}{n}=\frac{2(5)}{30}=\frac{10}{30}=0.3333. $$

Since \(0.30<0.3333\), the observation does not exceed the correct two-times-average cutoff. The three-times-average cutoff is \(3(5)/30=0.50\), which it also does not exceed.

The reviewer used the number of predictors alone: \(2(4)/30=0.2667\). That calculation omits the intercept and incorrectly labels \(0.30\) as above the cutoff. Common mistake avoided: confusing the number of predictors with the number of fitted coefficients. The correct conclusion is only that this observation does not cross these particular screening thresholds; that is not proof that it needs no review.

Key takeaway: With an intercept and \(p\) predictors, average leverage is \((p+1)/n\). Compare individual values with clearly defined screening rules, count the intercept, and treat a threshold exceedance as a prompt to investigate rather than as a decision about the observation.

Check Your Understanding

For each problem, count the fitted coefficients carefully and distinguish a screening alert from a conclusion about the observation.

  1. A regression with an intercept and four predictors is fitted to \(n=50\) observations. Find the average leverage and the two-times- and three-times-average cutoffs. (Answer: average \(=0.10\); cutoffs \(=0.20\) and \(0.30\).)
  2. A regression with an intercept and two predictors uses \(n=20\) observations. One observation has leverage \(0.47\). Calculate both cutoffs and state which it exceeds. (Answer: average \(=0.15\); cutoffs \(=0.30\) and \(0.45\); it exceeds both.)
  3. A full-rank model without an intercept has a design matrix of rank 4 and \(n=25\). Using the design rank, calculate the average and both screening cutoffs. If an observation has leverage \(0.34\), which reference level does it exceed? (Answer: average \(=0.16\); cutoffs \(=0.32\) and \(0.48\); it exceeds the two-times but not the three-times level.)
  4. A model with an intercept and three predictors is fitted to \(n=16\) observations. An observation has leverage \(0.55\). Calculate the average and cutoffs, and explain whether this is an automatic reason for exclusion. (Answer: average \(=0.25\); cutoffs \(=0.50\) and \(0.75\); it exceeds the two-times level only and is not automatically excluded.)
  5. A model with an intercept and three predictors is fitted to \(n=8\) observations. Calculate the average and both cutoffs. Can any leverage value strictly exceed the three-times-average cutoff? (Answer: average \(=0.50\); cutoffs \(=1.00\) and \(1.50\); no, because leverage cannot exceed 1.)
Clinical Biostats