CausalSmith · seminar slides
How Much Are Outcome Labels Worth?
Records without outcomes improve treatment-effect estimates by supplying better weights; outcome labels set the remaining accuracy limit.
slides for Outcome Annotation and Minimax Risk for Discrete Average Treatment Effects
Motivation
Chart review makes outcomes expensive; treatment and covariates may already be recorded broadly.
- n records contain covariates X, treatment A, and outcome Y.
- m additional records contain only (X,A).
- Treatment and outcome are binary; covariates take d known values.
Cheng et al. (2021) study this annotation problem in electronic health records.
How accurately can we estimate the average treatment effect (ATE) using these two sources of information?
Standard Approach
Estimate treated and control outcome means within each covariate cell, then average: ∑xpx(μ1x−μ0x).
Here px estimates the cell’s population frequency, and μax estimates its outcome mean in arm a.
Nearly empty treatment arms make the estimated means unreliable.
Zeng et al. (2026), the closest supervised benchmark, obtain:
- Plug-in mean-squared error (MSE) upper bound of order d2/n2+1/n, for all d.
- Minimax lower bound of order d2/(n2log2n)+1/n, for d≲nlogn.
Can auxiliary records and better rare-cell estimation close this logarithmic gap?
Key Idea
Estimate outcome success masses from labels and treatment weights from pooled records.
Use stabilized inverse counts in common cells and polynomial weights in rare cells.
Write N=n+m for pooled size and ℓn=log(en). The optimal risk scale is
rϵ(n,m,d):=min{1,n1+N2ℓn2d2}.
The first term measures outcome uncertainty; the second measures treatment–covariate uncertainty. The cap reflects the bounded target.
Here 0<ϵ<1/2 is fixed: both arms have conditional probability at least ϵ in every occupied cell.
informal · Theorem T-4 For independent same-population samples, n≥1,m≥0,d≥2, and fixed occupied-cell overlap 0<ϵ<1/2, minimax MSE lies between positive ϵ-dependent constants times rϵ(n,m,d).
Example
Take two equally likely cells, treatment probability one-half in each, and zero control outcome means. Let cell one’s treated outcome mean be one.
Here p1=P(X=1)=1/2, e1=P(A=1∣X=1)=1/2, and q11=P(X=1,A=1,Y=1)=1/4. This is a joint success mass, not a conditional mean.
With one labeled record L1 and one auxiliary record U1, consider estimating success mass and multiplying by twice the auxiliary cell indicator:
E[21{L1=((1,1,1))}(1{U1=((1,0))}+1{U1=((1,1))})]=2q11p1,
This candidate weight has mean 2p1. It adds an unwanted factor p1, giving 1/4.
The correct weight is 1/e1=2: the treated contribution is q11/e1=2q11=1/2.
Independence lets us multiply estimates. It does not make the candidate weight correct.
Model and Assumptions
For population law P, let px(P) be cell x’s frequency and μax(P) its conditional outcome mean in arm a. Our target is
τ(P):=x=1∑dpx(P)(μ1x(P)−μ0x(P)).
This averages within-cell treated–control differences using population frequencies.
- Sampling: independent records from one population, with independence between the labeled and auxiliary samples.
- Unrestricted cells: outcome means and treatment probabilities may vary freely across cells.
- Overlap: in every occupied cell, treatment probability ex satisfies
ϵ≤ex≤1−ϵ.
Overlap guarantees both arms occur; it allows arbitrarily rare cells. Our example satisfies it with ϵ=1/4.
Consistency equates observed outcomes with received-treatment potential outcomes. Conditional exchangeability makes treatment independent of potential outcomes within cells. Together with overlap, these give τ(P) its causal ATE interpretation.
Main Result
Let Md,ϵ denote the unrestricted overlap class.
Minimax risk Rϵ(n,m,d) is the smallest worst-case MSE among all estimators using both samples.
Under our sampling and overlap conditions, for every n≥1,m≥0,d≥2,
cϵrϵ(n,m,d)≤Rϵ(n,m,d)≤Cϵrϵ(n,m,d),
The positive constants cϵ,Cϵ depend only on overlap. Our hybrid estimator attains the upper bound; the lower bound applies to every estimator.
At m=0, polynomial correction closes the supervised logarithmic gap. Increasing m reduces the treatment–covariate term.
For our two-cell setting, minimax MSE is of order 1/n for every auxiliary size: outcome uncertainty already governs the rate.
Independent Information Pools
Sample splitting assigns independent records to three jobs:
- Outcome pool: labels estimate success masses.
- Pilot pool: pooled treatment–covariate records select the weighting rule.
- Weight pool: separate pooled records estimate the selected weights.
For analysis, Poisson sample sizes make counts independent across cells:
Sax∼Poi(uqax),Kax∼Poi(tsax),a∈{0,1}, x∈[d],
Here qax=P(X=x,A=a,Y=1) is joint success mass, and sax=P(X=x,A=a) is arm mass.
The counts Sax,Kax come from the outcome and weight pools; their effective sizes u,t are proportional to n,N.
The required arm contribution is qaxpx/sax=pxμax. In our example, p1/s11=2, exactly the required weight.
Inverse-count Baseline
Estimate success mass by Sax/u and its weight by (K0x+K1x+1)/(Kax+1).
Adding one keeps the ratio finite when an arm count is zero. Let ZH sum the resulting treated minus control contributions.
Under overlap,
EPZH−τ(P)≤Cmin{1,d/t},VarP(ZH)≤C(u−1+t−1).
The constant C depends only on overlap. Variance already follows the label and pooled-record budgets.
The obstacle is bias: an arm with few observations leaves some target contribution missing, and these errors can accumulate across cells.
How can we recover more of each rare cell’s contribution?
Polynomial Correction
Replace the inverse weight in rare cells by a polynomial in the arm masses.
Let L≥2 control degree, B>0 be the rare-cell mass scale, and TL be the degree-L Chebyshev polynomial. Define
HL(z)=2L21−TL(1−2z),EL(z)=zHL(z),GL(z)=z1−EL(z),
The quotients continue as polynomials at zero. The resulting weight is
Wa,L(s0,s1)=Bs0+s1GL(sa/B),
Here s0,s1 are the cell’s arm masses; z=sa/B is its scaled arm mass. The weight approximates (s0+s1)/sa.
Jiao et al. (2015) develop polynomial approximation for rare regions of discrete functional estimation.
We need accuracy in the weighted contribution, even where the reciprocal itself is difficult to approximate.
Contribution Error
The polynomial leaves a residual fraction EL(z). For z∈[0,1],
0≤EL(z)≤1,zGL(z)+EL(z)=1,
Thus zGL(z) is the recovered fraction. For z>0,
EL(z)≤(L2z)−1.
For a cell with px≤B, success mass times the polynomial weight equals pxμax[1−EL(sax/B)].
The missing contribution is pxμaxEL(sax/B).
- Overlap gives sax≥ϵpx.
- Its missing contribution is therefore at most B/(ϵL2): cell frequency cancels the reciprocal arm mass.
Across d cells, bias is at most a constant times dB/L2. We control absolute contribution error without requiring uniformly accurate inverse weights near zero.
Estimating Polynomial Weights
The coefficients are known; the cell masses are unknown.
Expand the weight in mass powers and replace each power by a falling-factorial count statistic:
Wa,L(K0,K1)=r0,r1∑ca,r0,r1tr0+r1(K0)r0(K1)r1.
Here ca,r0,r1 are polynomial coefficients and r0,r1 index powers. The falling factorial is (k)r=k(k−1)⋯(k−r+1), with (k)0=1.
Poisson factorial moments estimate mass powers without bias, so this estimated weight has expectation Wa,L.
Independence from the outcome pool makes its product with Sax/u estimate exactly the polynomial contribution.
The approximation error survives estimation unchanged; sampling adds variance.
Hybrid Estimator
An independent pilot count Jx selects the branch using threshold k0:
Zx=⎩⎨⎧uS1xW1,L,x−uS0xW0,L,x,uS1xK1x+1K0x+K1x+1−uS0xK0x+1K0x+K1x+1,Jx≤k0,k0<Jx.
Each Zx estimates one cell’s treated–control contribution: polynomial correction for small pilot counts, stabilized ratios otherwise.
The independent pilot protects the weight calculation from selection using the same counts; calibrated pilot tails control routing errors.
Sum across cells and clip to [−1,1], the ATE’s possible range.
Averaging over Poisson prefix lengths gives the fixed-sample estimator τn,m,dmix. This transfer costs at most a constant times 1/n in the risk bound.
Variance Budgets
Polynomial weights amplify noise exponentially with degree. Write A⋆=7056 for the fixed moment-growth constant.
For the hybrid sum before clipping, the two amplified terms fit two budgets: label variance 1/n and squared bias (dB/L2)2. Constants are suppressed below.
| Amplified term | Budget that absorbs it | Required calibration | |---|---|---| | A⋆Lmin{1,dB}/u: outcome noise over rare-cell mass | Split between label variance and squared bias by a quadratic inequality | L4A⋆2L≤n | | A⋆LdB2: weight noise across rare cells | Label variance when d≤L4A⋆L; squared bias above that cutoff | L6A⋆2L≤n for the label-budget case |
The first term’s amplification is paid by its calibration inequality. For the second, many cells make the squared-bias budget large enough to absorb it.
Stable-count variance and pilot remainders fit these same budgets under the remaining calibration.
The Logarithmic Gain
Choose L proportional to a sufficiently small multiple of log(en). Exponential variance growth then fits the labeled-sample budget.
Choose B proportional to L/N. More pooled records shrink the mass range requiring polynomial correction.
- Bias is at most a constant times dB/L2.
- Substituting these choices gives bias at most a constant times d/(Nlog(en)).
- Squared bias supplies d2/(N2ℓn2); variance fits this term plus 1/n.
Outcome labels limit polynomial degree. Auxiliary records reduce the mass scale instead.
The prescribed estimator returns zero when its finite calibration fails; failure occurs only at bounded labeled sizes, which the uniform constant covers.
informal · Theorem T-2 Under independent same-population sampling and fixed overlap 0<ϵ<1/2, the hybrid estimator has worst-case MSE at most Cϵrϵ(n,m,d) for every n≥1,m≥0,d≥2.
The Label Floor
For a lower bound, keep the treatment–covariate table fixed and vary only outcomes.
Nearby outcome populations can have ATE separation hn=cϵ/n≤1/4, while their labeled samples remain too close for reliable discrimination.
Their auxiliary samples have identical distributions, regardless of m.
Our two-cell example makes this separation of information visible: changing cell one’s treated outcome mean leaves all four treatment–covariate probabilities equal to 1/4.
An estimator resolving nearby ATEs would also distinguish the outcome populations. Squared separation forces the label floor.
informal · Lemma L-9 For fixed 0<ϵ<1/2, every n≥1,m≥0,d≥2 has minimax MSE at least c/n, regardless of auxiliary size.
How can rare cells force the remaining error term?
Approximation and Cancellation
The lower bound uses the difficulty of approximating p/(p+a) by a degree-L polynomial.
Here p is a candidate rare-cell mass, B bounds its range, and a=γϵB/L2 is a positive smoothing scale. The interval is [a/κ,B], with κ=(1−2ϵ)/ϵ.
At this scale, the reciprocal expression retains a constant approximation gap.
Alternating approximation errors supply candidate masses pi and signed weights wi satisfying
i=0∑L+1∣wi∣=1,i=0∑L+1wipij=0for every 0≤j≤L,
but
cϵ≤i=0∑L+1wipi+api.
The first formula cancels every polynomial through degree L; the second preserves a positive target gap. This is the raw material for two hard-to-distinguish populations.
Shared-table Populations
Let σ place signed weight wi at each candidate mass; ∣σ∣ places absolute weight ∣wi∣.
Draw each rare-cell raw mass from
ν(dp)=p+aa∣σ∣(dp)(p∈I),ν({0})=1−∫Ip+aa∣σ∣(dp).
Here I=[a/κ,B]; the remaining probability makes the cell empty.
For positive mass pi, set treated mass si=ϵ(pi+a). The interval guarantees overlap. Keep control means zero.
If h(pi) is the sign of wi, branch b∈{0,1} assigns
μ1i(b)=21+(2b−1)h(pi).
This swaps treated means between zero and one according to the sign.
Generate k cells, add a reservoir cell, and normalize masses. Both branches share the entire treatment–covariate table; only outcomes differ.
Joint Likelihood Cancellation
Auxiliary counts can reveal the latent cell mass and help interpret labeled outcomes. Identical auxiliary distributions alone therefore do not establish joint indistinguishability.
Expand the joint Poisson likelihood in that latent mass:
| Part of the expansion | What happens | |---|---| | Terms with no outcome-bearing difference | Agree across branches | | Outcome-bearing terms through degree L | Cancel against the signed moments | | Higher-degree terms | Remain; their exponential-series tail must be bounded |
An outcome-bearing term contains treated mass ϵ(p+a). The drawing factor a/(p+a) cancels its first factor of p+a.
What remains at low degrees is a polynomial against the signed weights, so its integral vanishes.
Both labeled and auxiliary counts enter the expansion. The next bound controls their joint remainder.
Likelihood Remainder
For this lower-bound calculation, let u and v be labeled and auxiliary Poisson intensities, proportional to n and N.
The one-cell likelihood bound requires (u+v)B≤bϵL, with a sufficiently small positive overlap-dependent constant bϵ.
For the two one-cell predictive laws Q0,Q1,
TV(Q0,Q1)≤CϵuaρϵL,0<ρϵ<1.
Total variation measures how well the joint observations distinguish the branches.
Why does the remainder decay? The exponential-series terms have factorial denominators. Keeping the largest intensity–mass product a small fraction of L makes the terms beyond degree L geometrically small.
The factor ua reflects that a difference must pass through labeled outcomes. Summing across k cells gives distance at most CϵukaρϵL.
Calibration Against Auxiliary Size
Choose the lower-bound scales
L=⌈Cϵ∘log(en)⌉,B=n+mb0L,a=L2γϵB,
Here Cϵ∘,b0,γϵ are positive overlap-dependent constants; the lower bound uses a sufficiently large logarithmic degree.
Because u+v is proportional to N, the remainder depends on pooled size through NB. Shrinking B as L/N preserves the tail condition even when m is arbitrarily large.
The mass budget keeps ka bounded. Hence the joint distance bound CϵukaρϵL is at most a constant times nρϵL.
A sufficiently large multiple of log(en) makes this at most 1/8.
More auxiliary records force smaller hard cells; they do not enlarge the calibrated joint remainder.
Number of Rare Cells
Each generated cell supplies expected target separation at least a constant times a. Choose
k=min{d−1,⌊cϵ∘(n+m)L⌋}.
The first limit reserves a reservoir cell. The second keeps total separation bounded: a is proportional to 1/(NL).
The raw target centers satisfy
cϵka≤∣θ1−θ0∣,
Here θb is the expected unnormalized ATE in branch b.
Until the mass cap binds, separation grows with the number of cells. At the cap it stays of constant order.
Thus squared separation is at least a constant times min{1,d2/((n+m)2log(en)2)}.
Concentration and Testing
Write Δ=∣θ1−θ0∣. Normalizing the generated populations must preserve their target separation.
Raw target and total-mass variances are at most CϵkBa. Relative to squared separation, the controlling ratio is B/(ka): enough rare cells make it small.
Use the rare-cell construction when
min{1,(n+m)2log(en)2d2}>nCϵ.
The left side is the alphabet term; the right side is the label scale. In this regime, the calibrated cell count supplies concentration.
The joint distance is at most 1/8, so reliable testing is impossible. An estimator resolving the concentrated, separated ATEs would provide such a test.
In the remaining regime, the label floor already covers the alphabet term.
informal · Theorem T-3 Under independent same-population sampling and fixed overlap 0<ϵ<1/2, for every n≥1,m≥0,d≥2, priors with the same treatment–covariate table distribution yield minimax MSE at least cϵrϵ(n,m,d).
Open Questions
- Sharper implementable tuning at ordinary sample sizes: the explicit calibration is conservative.
- Continuous covariates and treatments or outcomes with more than two values.
- Adaptive annotation and restrictions connecting cellwise outcome means or treatment probabilities.
Takeaways
- Under independent same-population sampling and fixed overlap, optimal MSE follows min{1,1/n+d2/(N2ℓn2)}. Labels and pooled records supply different information.
- Polynomial weights reduce missing rare-cell contributions; overlap cancels the problematic reciprocal mass. Factorial moments preserve that calculation after estimation, while outcome variance limits degree.
- Moment cancellation removes low-degree likelihood differences. Shrinking rare-cell mass with pooled size controls the remaining tail; separated, concentrated targets then force the matching lower bound.
Appendix: Sharp Annotation Frontier
The exact statement gives the finite-sample minimax bracket and its endpoint and sequence consequences.
For every overlap parameter ϵ satisfying 0<ϵ<1/2, there exist constants cϵ and Cϵ, depending only on ϵ, with 0<cϵ≤Cϵ, such that the following assertions hold.
- (Finite-sample bracket.) For every n≥1, m≥0, and d≥2, cϵrϵ(n,m,d)≤Rϵ(n,m,d)≤Cϵrϵ(n,m,d), where, with N=n+m and ℓn=log(en), rϵ(n,m,d)=min{1,n1+N2ℓn2d2}.
- (Unannotated endpoint.) For every n≥1 and every d≥0, rϵ(n,0,d)=min{1,n1+n2log2(en)d2}.
- (Known-marginal limit.) For every fixed n≥1 and d≥2, m→∞limRϵ(n,m,d)=Rϵknown(n,d).
- (Sequence regimes.) For any sequences (mn)n≥1 and (dn)n≥1 of nonnegative integers satisfying dn≥2 for every n≥1, set Nn=n+mn and ℓn=log(en). Then Rϵ(n,mn,dn)→0⟺Nnℓndn→0, Rϵ(n,mn,dn)=O(n−1)⟺dn=O(nNnℓn), and Rϵ(n,mn,dn)=o(Rϵ(n,0,dn)) if and only if both nℓndn→∞ and min{1,dn/(nℓn)}dn/(Nnℓn)→0.
Appendix: Uniform Mixed Upper Bound
The specified hybrid estimator attains the frontier uniformly over the unrestricted overlap class.
Fix an overlap constant ϵ with 0<ϵ<1/2. There exists a constant Cϵ>0 such that, for every n≥1, m≥0, and d≥2, the total computable hybrid estimator τn,m,dmix of Definition P-6 satisfies P∈Md,ϵsupEP⊗n⊗PXA⊗m[{τn,m,dmix−τ(P)}2]≤Cϵrϵ(n,m,d), where τ(P) is the average treatment effect functional in Definition P-2, and rϵ(n,m,d) is the annotation-frontier rate in Definition P-5.
Appendix: Common Marginal Converse
Priors with identical treatment–covariate table distributions deliver the matching minimax lower bound.
Let ϵ, the overlap parameter, satisfy 0<ϵ<1/2. Then there exist a constant cϵ>0 and a collection of ϵ-dependent calibration constants as in Definition P-7 such that, for every n,m,d∈N with n≥1, m≥0, and d≥2, the regime-dependent handle in Definition P-7 supplies priors Π0 and Π1 satisfying LΠ0(PXA)=LΠ1(PXA) and cϵrϵ(n,m,d)≤Rϵ(n,m,d), where rϵ(n,m,d) is the frontier rate in Definition P-5 and Rϵ(n,m,d) is the minimax risk in Definition P-4.
Appendix: Known Marginal Limit
For fixed labeled size and alphabet, increasing auxiliary size converges to the exact known-table minimax risk.
Fix an overlap parameter ϵ, a labeled sample size n, and a finite covariate alphabet size d. Suppose
- (Overlap.) 0<ϵ<1/2.
- (Labeled size.) n≥1.
- (Alphabet size.) d≥2.
Then the minimax mean-squared risk Rϵ(n,m,d) from Definition P-4 converges, as the auxiliary sample size m→∞, to the known-marginal minimax risk Rϵknown(n,d) from Definition P-10: m→∞limRϵ(n,m,d)=Rϵknown(n,d).