Tutorials › Multiple Imputation by Chained Equations (MICE) › Choosing the Number of PMM Donors

Predictive Mean Matching · Tutorial 190 of 497

Choosing the Number of PMM Donors

Learn how PMM donor-pool size affects match distance and imputation variability, and how to assess candidate sizes using sensitivity checks and masked-observation validation.

Intermediate 9 min read

What You'll Learn

  • Define the PMM donor pool and the role of its size, \(k\).
  • Calculate average matching distances and the spread of possible donor outcomes.
  • Explain why increasing \(k\) need not increase outcome variability in every case.
  • Compare pool sizes using masked-observation validation.
  • Recognize assumptions, diagnostics, and limitations relevant to choosing \(k\).

Why Donor-Pool Size Matters

In predictive mean matching (PMM), an imputed value is taken from an observed outcome whose prediction score is close to the score for the record with a missing value. The number of candidate donors controls how many observed outcomes are eligible for selection. A very small pool can concentrate selection on the closest score matches; a larger pool can offer more outcome variety, but may include cases whose scores are less similar. Choosing \(k\) is therefore a balance, not a search for a universally best number.

The choice should be evaluated in the setting where PMM is used: with the specified imputation model, predictors, donor eligibility rules, and missingness pattern. A suitable pool size cannot repair a poor prediction model, inadequate overlap, or implausible assumptions about the missing data.

Definition: For a record with a missing outcome, calculate matching distances from its prediction score to the scores of eligible records with observed outcomes, and order those distances from smallest to largest. The PMM donor pool of size \(k\) consists of the \(k\) eligible observed-outcome records with the smallest distances. In the usual random-donor version, one of these \(k\) records is selected at random, and its observed outcome is used as the imputation.

Write the ordered distances as \(d_{(1)} \le d_{(2)} \le \cdots\), and let \(y_{(j)}\) be the observed outcome belonging to the record at rank \(j\). The pool size is an integer from 1 to the number of eligible observed cases. With \(k=1\), the closest eligible donor is selected. With a larger \(k\), selection can reach farther down the ordered list. These statements concern distances on the prediction scale; they do not imply that outcomes themselves are ordered by their values.

Assumptions and What the Choice Can Control

The comparison of pool sizes is meaningful only if the matching procedure is being used appropriately. The prediction model should use relevant, adequately specified predictors, and its scores should rank cases in a way that makes nearby scores informative about plausible donor outcomes. Donors must be eligible under the analysis design, and there must be observed cases with scores sufficiently comparable to those of records needing imputation. In addition, the missing-data assumptions and imputation model must support the intended analysis; selecting \(k\) alone does not establish those assumptions.

As in other imputation procedures, the missingness mechanism and the variables included in the imputation model matter. The standard missing-data terminology is covered in the earlier material on Missing Data. Here, the focus is narrower: how the size of the PMM pool changes the set from which a donor can be drawn, conditional on the chosen model and eligible donors.

Two useful quantities make the trade-off concrete. The mean distance in a pool is \(\bar d_k = k^{-1}\sum_{j=1}^{k}d_{(j)}\). If selection is uniform among the \(k\) donors, the conditional expected imputed outcome is \(\bar y_k = k^{-1}\sum_{j=1}^{k}y_{(j)}\), and its conditional variance is \(k^{-1}\sum_{j=1}^{k}(y_{(j)}-\bar y_k)^2\). That variance describes variation from selecting a donor within this fixed pool; it is not a complete measure of uncertainty in the imputation or analysis.

What Changes as \(k\) Changes?

Because the distances are ordered, the average distance cannot decrease when the pool grows. To see why, the average for \(k+1\) donors is the average of the first \(k\) distances and the next, larger-or-equal distance:

$$ \bar d_{k+1} =\frac{k\bar d_k+d_{(k+1)}}{k+1} \geq \frac{k\bar d_k+\bar d_k}{k+1} =\bar d_k . $$

The inequality holds because \(d_{(k+1)}\) is at least as large as each of the first \(k\) distances, and therefore at least as large as their average. Thus, a larger pool weakly increases the average matching distance. The effect on the set of possible imputed outcomes is less predictable: a new donor may have an outcome similar to those already included, or it may have a very different one. Pool size does not guarantee a particular direction or amount of change in outcome variance.

Worked Example: Comparing Distance and Outcome Spread

Suppose a missing outcome has prediction score 52.2. Five eligible donors have the following scores and observed outcomes. The distance is the absolute difference between the donor score and 52.2.

DonorScoreObserved outcome (units)Distance
A52.1400.1
B52.4420.2
C51.8550.4
D52.9610.7
E51.3290.9

For \(k=1\), only donor A is eligible. The average distance is 0.1 score units, and the imputed outcome is 40 units if A is selected.

For \(k=3\), the mean distance is \((0.1+0.2+0.4)/3=0.233\) score units. If each donor is equally likely to be selected, the expected imputed outcome is \((40+42+55)/3=45.67\) units. Its conditional selection variance is \(((-5.67)^2+(-3.67)^2+9.33^2)/3 \approx 44.22\) outcome-units squared.

For \(k=5\), the mean distance is \((0.1+0.2+0.4+0.7+0.9)/5=0.460\) score units. The expected imputed outcome is \((40+42+55+61+29)/5=45.40\) units. The conditional selection variance is \(((-5.4)^2+(-3.4)^2+9.6^2+15.6^2+(-16.4)^2)/5=129.04\) outcome-units squared.

Here, expanding the pool increases both average distance and the spread of possible donor outcomes. The spread comparison is specific to these five outcomes; adding two donors would not always increase it. The example also shows why “closer matches” and “more varied draws” are different criteria to inspect.

Using Validation to Compare Candidate Sizes

A practical comparison can temporarily hide some observed outcomes, treat those records as if their outcomes were missing, and use the remaining observed cases as donors. Because the hidden outcomes are known for this check, one can compare how well candidate pool sizes recover them. The masking and donor selection should reflect the intended analysis as closely as possible, including the prediction model, score calculation, and eligibility rules.

This check evaluates predictive performance for the masked cases; it does not prove that imputations are unbiased or that the missing-data assumptions hold. It is also useful to inspect matching distances and the range or distribution of imputed values across candidate sizes. These diagnostics complement, rather than replace, substantive justification.

Worked Example: A Small Masked-Outcome Check

Consider three hypothetical observed cases whose outcomes are temporarily hidden. For each case, the table gives its known outcome and the outcomes of the nearest four eligible donors, in order of matching distance. Compare \(k=2\) with \(k=4\) using the expected absolute prediction error under uniform donor selection.

Masked caseKnown outcomeNearest donor outcomes, in order
A5048, 52, 70, 30
B2018, 25, 19, 60
C8078, 82, 75, 40

For case A with \(k=2\), the expected absolute error is \((|48-50|+|52-50|)/2=(2+2)/2=2\) outcome units. With \(k=4\), it is \((2+2+20+20)/4=11\) outcome units.

For case B, the corresponding errors are \((|18-20|+|25-20|)/2=(2+5)/2=3.5\) units for \(k=2\), and \((2+5+1+40)/4=12\) units for \(k=4\). For case C, they are \((2+2)/2=2\) units for \(k=2\), and \((2+2+5+40)/4=12.25\) units for \(k=4\).

The average expected absolute error across the three cases is \((2+3.5+2)/3=2.50\) units for \(k=2\), compared with \((11+12+12.25)/3=11.75\) units for \(k=4\). In this deliberately small example, \(k=2\) performs better on this predictive criterion. A real choice should not be based on three cases: repeat the check over an adequate set of masked observations and consider whether the masking pattern resembles the actual missingness pattern.

Choosing and Reporting a Pool Size

There is no pool size that is best for every data set. A small pool emphasizes the closest prediction-score matches, but it may allow very few distinct outcomes to be selected. A larger pool can broaden the possible draws, while also admitting more distant matches. The consequences depend on the local distribution of scores and outcomes, the number of eligible observed cases, and the purpose of the imputation.

A defensible choice compares a modest set of plausible values of \(k\) while holding the other modeling decisions fixed. Examine the resulting matching distances, imputed outcome distributions, and, when feasible, masked-observation performance. Then assess whether the substantive conclusions are sensitive to reasonable alternatives. If candidate sizes yield very different imputed values or conclusions, investigate the model and the sparse regions of the score distribution rather than treating one setting as automatically correct.

PMM can be contrasted with a parametric regression imputation that generates outcomes from a fitted outcome model rather than selecting observed donor outcomes. PMM’s donor selection retains observed outcome values, while the pool size governs which of those values can be drawn. Neither approach is universally preferable: the choice depends on the model, data structure, and inferential goal. Choosing \(k\) is a tuning decision within PMM, not a substitute for comparing appropriate imputation approaches.

Diagnostics, Limitations, and a Common Mistake

Warning signs include a large increase in average match distance as \(k\) grows, imputed values that change sharply across plausible pool sizes, or masked-observation errors that worsen consistently for larger pools. Also check whether donors are genuinely eligible and whether the score model distinguishes cases relevant to the outcome. These checks can flag poor performance, but none can establish that the missingness assumptions are true.

A masked-observation check has limitations. The observed cases used for validation may not represent cases with missing outcomes, especially when missingness depends on unobserved values. The check is also sensitive to how cases are masked and to random donor selection. Consequently, validation results should inform the choice, not be treated as a proof of inferential validity. Pool-size comparisons should be interpreted alongside the intended analysis and the model’s assumptions.

Common mistake: “A larger \(k\) always produces more variable imputations, so choose the largest pool to preserve uncertainty.” This reasoning is not generally correct. New donors may have outcomes close to the existing pool, and the conditional outcome variance can rise, fall, or stay similar. Conversely, \(k=1\) removes random donor selection within a fixed pool but does not remove all imputation uncertainty, such as uncertainty associated with model estimation or other random draws in the imputation procedure. Compare the actual distances and outcomes; do not infer their behavior from \(k\) alone.

Key takeaway: Increasing the PMM donor-pool size cannot reduce the average matching distance, but it does not guarantee a particular change in outcome diversity or inferential quality. Choose \(k\) by examining both match closeness and the consequences of donor selection, under a justified imputation model.

Check Your Understanding

Answer the questions, then compare your reasoning with the solutions.

  1. For ordered distances 0.2, 0.5, 0.6, and 1.1, calculate the mean distance for \(k=2\) and \(k=4\).
  2. Why does increasing \(k\) not guarantee an increase in the conditional variance of imputed outcomes?
  3. What does a masked-observation validation check assess, and what can it not establish?
  4. In one sentence, state the main trade-off between a very small and a larger donor pool.

Solutions. (1) For \(k=2\), the mean is \((0.2+0.5)/2=0.35\) score units. For \(k=4\), it is \((0.2+0.5+0.6+1.1)/4=0.60\) score units. (2) The added donor’s outcome may be close to or far from the existing outcomes, so its effect on their variance depends on the actual values. (3) It assesses prediction performance for observed cases temporarily treated as missing under the chosen masking procedure; it cannot prove missing-data assumptions or guarantee validity for cases whose outcomes are genuinely missing. (4) A small pool restricts selection to closer score matches, while a larger pool can admit more outcome variety at the cost of including more distant matches.

Clinical Biostats