Tutorials › Pattern-Mixture and Selection Models › Restriction Choices at the Final Unobserved Visit

Identifying Restrictions · Tutorial 266 of 499

Restriction Choices at the Final Unobserved Visit

Learn why the final-visit complete-case and available-case means coincide under monotone dropout, and how neighboring-case restrictions can change assignments when they condition on observed history.

Advanced 10 min read

What You'll Learn

  • Define the dropout patterns in a four-visit monotone-dropout setting.
  • Derive the final-visit assignments implied by marginal complete-case and available-case restrictions.
  • Explain how adjacent-pattern restrictions can propagate across dropout patterns.
  • Calculate a conditional neighboring-case assignment using observed history.
  • Identify when donor overlap is inadequate and when an assignment requires an additional assumption.
  • Distinguish observable-data checks from assumptions about unobserved outcomes.

Why the Final Visit Needs Careful Treatment

In a longitudinal study with monotone dropout, a participant who misses a visit does not return at a later visit. At the final visit, this structure creates a special boundary: the only participants with an observed final outcome are the completers. As a result, some restrictions that sound like different borrowing rules produce the same marginal assignment. Other versions differ because they condition on participants’ observed history.

This distinction matters when assigning a final outcome to people who dropped out earlier. An assigned mean is not recovered from their missing final outcomes; it follows from a restriction imposed on the pattern-specific distribution. Earlier material on neighboring-case restrictions establishes the general idea of borrowing across patterns. Here the focus is the final-visit boundary in a four-visit setting, where the available donor patterns are limited.

Definition: Let \(Y_1,Y_2,Y_3,Y_4\) denote outcomes at four visits. Under monotone dropout, let \(D=k\) mean that visits 1 through \(k\) are observed and visits after \(k\) are missing. Thus \(D=4\) denotes completers, while \(D=1,2,3\) denote dropout patterns. Write \(\mu_{k4}=E(Y_4\mid D=k)\). This mean is observed for \(k=4\) and unobserved for \(k<4\).

The restriction choices below are stated for means. A distributional equality would be stronger: it would constrain the entire distribution of \(Y_4\), not only its mean. Mean equality alone does not imply equal variances, quantiles, or shapes.

Three Ways to Assign a Final-Visit Mean

A marginal complete-case restriction assigns each dropout pattern the completers’ final-visit mean. An available-case assignment uses the mean among people whose final outcome is observed. Under monotone dropout, those are exactly the completers. Therefore, if both rules use the same analysis population and neither conditions on additional variables, they give the same marginal assignment.

A neighboring-case restriction instead relates adjacent dropout patterns. For example, the pattern \(D=3\) is adjacent to the complete-case pattern \(D=4\). A marginal equality between their final-outcome means assigns the completers’ mean to \(D=3\). To reach \(D=2\) or \(D=1\) by adjacent steps requires further restrictions linking those patterns in turn. Those intermediate final outcomes are missing too, so the chain is an assumption, not a sequence of observed donor means.

Key result: Under monotone dropout, the marginal available-case mean at visit 4 is the complete-case mean, since \(Y_4\) is observed only when \(D=4\). A chain of marginal neighboring-pattern equalities also yields the same assigned mean for every dropout pattern, but only if each equality in the chain is imposed. These equal marginal assignments do not establish that the underlying restrictions are true.

Worked Example: The Marginal Boundary at Visit 4

Consider hypothetical data from 100 participants measured at four visits. Forty complete all four visits; 20 are observed through visit 3, 25 through visit 2, and 15 through visit 1. Suppose the observed \(Y_4\) values for the 40 completers sum to 2,200 outcome units.

The complete-case mean is \[ \bar{Y}_{4,D=4}=\frac{2200}{40}=55.0 \] outcome units. Since no participant with \(D<4\) has an observed \(Y_4\), the available-case sample at visit 4 is the same set of 40 completers. Its mean is also \(2,200/40=55.0\) outcome units.

Under the marginal complete-case restriction, the three unobserved pattern means are assigned as \(\mu_{14}=\mu_{24}=\mu_{34}=55.0\). Under a marginal neighboring-case chain, the assumptions are \(\mu_{34}=\mu_{44}\), \(\mu_{24}=\mu_{34}\), and \(\mu_{14}=\mu_{24}\). Substitution gives \(\mu_{34}=\mu_{24}=\mu_{14}=55.0\) outcome units.

Thus the three rules give the same marginal mean assignments in this example when the neighboring restrictions are imposed along the full chain. They are not interchangeable descriptions of evidence: the observed mean comes from completers, while equalities for \(D<4\) concern unobserved outcomes.

Conditioning on History Can Change the Assignment

The marginal equality does not say that people who dropped out and completers have the same distribution of observed history. If the relation between \(Y_4\) and that history matters, one can specify a conditional restriction instead. For \(D=3\), a natural shared history includes \(Y_1,Y_2,Y_3\); a neighboring-case restriction may equate the conditional mean of \(Y_4\) in \(D=3\) and \(D=4\) at comparable histories.

To calculate such an assignment from observed data, the relevant history groups must occur among completers. This is an overlap or positivity requirement: each history value being used for \(D=3\) must have completers from whom a conditional \(Y_4\) mean can be estimated. Even with overlap, equality of the conditional means is an identifying assumption about a missing outcome, not something verified by observing \(Y_4\) in both patterns.

Worked Example: A Conditional Neighboring-Case Assignment

Use the hypothetical four-visit study above. Among completers, suppose the observed \(Y_3\) history can be summarized as low or high. Ten completers have low \(Y_3\), with mean \(Y_4=40\) outcome units; 30 have high \(Y_3\), with mean \(Y_4=60\) outcome units. Among the 20 participants with \(D=3\), 15 have low \(Y_3\) and 5 have high \(Y_3\).

Assume the neighboring-case restriction that, within each of these two \(Y_3\) groups, the mean \(Y_4\) for \(D=3\) equals the corresponding completer mean. The assigned mean for the \(D=3\) group is then standardized to its own observed history distribution: \[ \mu_{34}=\frac{15(40)+5(60)}{20} =\frac{600+300}{20} =45.0 \] outcome units.

The marginal complete-case and available-case means remain 55.0 outcome units. The conditional neighboring-case assignment is 45.0 because the \(D=3\) group has more participants in the low-\(Y_3\) group. The donor means are available in both history groups: the completer counts are 10 and 30, respectively. This calculation illustrates how conditioning can change a mean assignment even though the marginal donor pool at visit 4 consists only of completers.

The calculation does not supply a direct conditional neighboring-case assignment for \(D=2\): participants with \(D=3\) also lack \(Y_4\). Assigning \(Y_4\) for \(D=2\) by a conditional chain would require additional restrictions that carry information across patterns and histories. The \(D=3\) calculation alone does not establish those restrictions.

Deriving the Marginal Coincidence

The equality between the complete-case and available-case means follows from the definition of monotone dropout, not from a statistical approximation. Let \(R_4=1\) indicate that \(Y_4\) is observed. Under monotone dropout, \(R_4=1\) if and only if \(D=4\). Therefore the available-case mean targets the same observed pattern mean as the complete-case mean:

$$ E(Y_4\mid R_4=1)=E(Y_4\mid D=4)=\mu_{44}. $$

If a marginal complete-case restriction sets \(\mu_{k4}=\mu_{44}\) for each \(k<4\), it assigns that same value to each missing pattern. If instead adjacent restrictions set \(\mu_{k4}=\mu_{k+1,4}\) for \(k=1,2,3\), repeated substitution gives \[ \mu_{14}=\mu_{24}=\mu_{34}=\mu_{44}. \] The neighboring chain reaches the same endpoint only because every link is assumed. A single restriction between \(D=3\) and \(D=4\) says nothing by itself about \(\mu_{24}\) or \(\mu_{14}\).

Worked Example: What a Partial Neighboring Restriction Leaves Open

Suppose the completer mean remains 55.0 outcome units, and impose only the adjacent equality \(\mu_{34}=\mu_{44}\). Then \(\mu_{34}=55.0\), but this one restriction does not determine \(\mu_{24}\) or \(\mu_{14}\).

For illustration, make the additional hypothetical assignments \(\mu_{24}=50.0\) and \(\mu_{14}=45.0\) outcome units. The implied overall mean across all 100 participants, after assigning their missing final outcomes, is \[ \frac{40(55)+20(55)+25(50)+15(45)}{100} =\frac{2200+1100+1250+675}{100} =52.25 \] outcome units.

If instead the full marginal neighboring chain is imposed, all four pattern means equal 55.0, and the overall mean is \[ \frac{40(55)+20(55)+25(55)+15(55)}{100} =\frac{5500}{100} =55.0 \] outcome units. The difference, 2.75 outcome units, is due to the extra assumptions about \(D=2\) and \(D=1\), not to a change in the observed data.

Diagnostics, Comparisons, and Limitations

Observable data can reveal whether a proposed calculation is feasible, but cannot generally verify the restriction on missing \(Y_4\). For a conditional assignment, examine the observed history distributions by pattern and check that the donor pattern has observations in the history groups used. A history group absent among completers has no corresponding observed \(Y_4\) mean to borrow. Sparse groups also make estimated conditional means unstable. Neither a good overlap table nor similar observed histories proves equality of the unobserved final outcomes.

The main alternatives answer different questions. A marginal complete-case restriction assigns the completer mean without adjusting for history. The marginal available-case calculation uses all observed \(Y_4\) values; under monotone dropout this is the completer sample, so it does not add another donor group. A neighboring-case restriction relates patterns locally and may be stated marginally or conditional on shared history. Conditional restrictions can account for observed-history composition, but require overlap and stronger modeling or stratification choices. A chain of neighboring restrictions can also accumulate assumptions as it moves from \(D=4\) to earlier dropout patterns.

These are identifying restrictions, not tests that establish equality for missing outcomes. Observed-data compatibility checks can flag contradictions with the observed-data structure, but agreement with observed data does not distinguish among restrictions that assign different values to unobserved \(Y_4\). It is prudent to state whether a restriction is marginal or conditional, which patterns it links, and which history variables it conditions on. When the final estimate depends on unsupported links or sparse histories, report that dependence and consider alternative assignments as a sensitivity analysis.

Common pitfall: “Complete-case and available-case are two independent sources of information at the final visit, so their different estimates can be compared.” Under monotone dropout they use the same \(Y_4\)-observed participants, so their unadjusted means are identical. A difference can arise only after changing the conditioning, standardization, population, or analysis—not because available cases at visit 4 include earlier dropouts.

Check Your Understanding

Answer each question, then compare with the brief solutions below.

  1. Under monotone dropout, which pattern contains the observed \(Y_4\) values?
  2. If the completer mean is 48 outcome units, what is the marginal available-case mean at visit 4, assuming the same observations and no weighting?
  3. For a conditional neighboring assignment to \(D=3\), why must relevant \(Y_3\) history groups be represented among completers?
  4. If only \(\mu_{34}=\mu_{44}\) is imposed, are \(\mu_{24}\) and \(\mu_{14}\) determined? Explain.
  5. Does a conditional neighboring assignment equal to an observed-data calculation prove that the restriction is true?

Solutions. (1) \(D=4\), the completer pattern, is the only pattern with observed \(Y_4\). (2) It is 48 outcome units, because the available-case and complete-case samples at visit 4 coincide. (3) Without completers in a history group, there is no observed conditional \(Y_4\) mean for that group to borrow; the assignment lacks donor support. (4) No. The single equality fixes \(\mu_{34}\) but leaves the earlier-pattern means unspecified. (5) No. The restriction concerns outcomes missing in \(D=3\); observed-data agreement cannot establish that unobserved conditional equality.

Clinical Biostats