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.

Motivation

Chart review makes outcomes expensive; treatment and covariates may already be recorded broadly.

  • nn records contain covariates XX, treatment AA, and outcome YY.
  • mm additional records contain only (X,A)(X,A).
  • Treatment and outcome are binary; covariates take dd 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: ∑xp^x(μ^1x−μ^0x)\sum_x\widehat p_x(\widehat\mu_{1x}-\widehat\mu_{0x}).

Here p^x\widehat p_x estimates the cell’s population frequency, and μ^ax\widehat\mu_{ax} estimates its outcome mean in arm aa.

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/nd^2/n^2+1/n, for all dd.
  • Minimax lower bound of order d2/(n2log⁡2n)+1/nd^2/(n^2\log^2 n)+1/n, for d≲nlog⁡nd\lesssim n\log n.

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+mN=n+m for pooled size and ℓn=log⁡(en)\ell_n=\log(en). The optimal risk scale is

rϵ(n,m,d):=min⁡ ⁣{1,1n+d2N2ℓn2}. r_\epsilon(n,m,d) := \min\!\left\{ 1,\frac1n+\frac{d^2}{N^2\ell_n^2} \right\}.

The first term measures outcome uncertainty; the second measures treatment–covariate uncertainty. The cap reflects the bounded target.

Here 0<ϵ<1/20<\epsilon<1/2 is fixed: both arms have conditional probability at least ϵ\epsilon in every occupied cell.

informal · Theorem T-4 For independent same-population samples, n≥1,m≥0,d≥2n\ge1,m\ge0,d\ge2, and fixed occupied-cell overlap 0<ϵ<1/20<\epsilon<1/2, minimax MSE lies between positive ϵ\epsilon-dependent constants times rϵ(n,m,d)r_\epsilon(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/2p_1=P(X=1)=1/2, e1=P(A=1∣X=1)=1/2e_1=P(A=1\mid X=1)=1/2, and q11=P(X=1,A=1,Y=1)=1/4q_{11}=P(X=1,A=1,Y=1)=1/4. This is a joint success mass, not a conditional mean.

With one labeled record L1\mathcal L_1 and one auxiliary record U1\mathcal U_1, 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, \mathbb E\!\left[ 2\mathbf 1\{\mathcal L_1=((1,1,1))\} \left(\mathbf 1\{\mathcal U_1=((1,0))\}+\mathbf 1\{\mathcal U_1=((1,1))\}\right) \right] =2q_{11}p_1,

This candidate weight has mean 2p12p_1. It adds an unwanted factor p1p_1, giving 1/41/4.

The correct weight is 1/e1=21/e_1=2: the treated contribution is q11/e1=2q11=1/2q_{11}/e_1=2q_{11}=1/2.

Independence lets us multiply estimates. It does not make the candidate weight correct.

Model and Assumptions

For population law PP, let px(P)p_x(P) be cell xx’s frequency and μax(P)\mu_{ax}(P) its conditional outcome mean in arm aa. Our target is

τ(P):=∑x=1dpx(P)(μ1x(P)−μ0x(P)). \tau(P):=\sum_{x=1}^{d}p_x(P)\bigl(\mu_{1x}(P)-\mu_{0x}(P)\bigr).

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 exe_x satisfies

ϵ≤ex≤1−ϵ. \epsilon \le e_x \le 1-\epsilon .

Overlap guarantees both arms occur; it allows arbitrarily rare cells. Our example satisfies it with ϵ=1/4\epsilon=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)\tau(P) its causal ATE interpretation.

Main Result

Let Md,ϵ\mathcal M_{d,\epsilon} denote the unrestricted overlap class.

Minimax risk Rϵ(n,m,d)R_\epsilon(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≥2n\ge1,m\ge0,d\ge2,

cϵrϵ(n,m,d)≤Rϵ(n,m,d)≤Cϵrϵ(n,m,d), c_\epsilon r_\epsilon(n,m,d) \le R_\epsilon(n,m,d) \le C_\epsilon r_\epsilon(n,m,d),

The positive constants cϵ,Cϵc_\epsilon,C_\epsilon depend only on overlap. Our hybrid estimator attains the upper bound; the lower bound applies to every estimator.

At m=0m=0, polynomial correction closes the supervised logarithmic gap. Increasing mm reduces the treatment–covariate term.

For our two-cell setting, minimax MSE is of order 1/n1/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], S_{ax}\sim \operatorname{Poi}(u q_{ax}), \qquad K_{ax}\sim \operatorname{Poi}(t s_{ax}), \qquad a\in\{0,1\},\ x\in[d],

Here qax=P(X=x,A=a,Y=1)q_{ax}=P(X=x,A=a,Y=1) is joint success mass, and sax=P(X=x,A=a)s_{ax}=P(X=x,A=a) is arm mass.

The counts Sax,KaxS_{ax},K_{ax} come from the outcome and weight pools; their effective sizes u,tu,t are proportional to n,Nn,N.

The required arm contribution is qaxpx/sax=pxμaxq_{ax}p_x/s_{ax}=p_x\mu_{ax}. In our example, p1/s11=2p_1/s_{11}=2, exactly the required weight.

Inverse-count Baseline

Estimate success mass by Sax/uS_{ax}/u and its weight by (K0x+K1x+1)/(Kax+1)(K_{0x}+K_{1x}+1)/(K_{ax}+1).

Adding one keeps the ratio finite when an arm count is zero. Let ZHZ^H sum the resulting treated minus control contributions.

Under overlap,

∣EPZH−τ(P)∣≤Cmin⁡{1,d/t},Var⁡P(ZH)≤C(u−1+t−1). \left|E_P Z^H-\tau(P)\right| \le C\min\{1,d/t\}, \qquad \operatorname{Var}_P(Z^H) \le C\left(u^{-1}+t^{-1}\right).

The constant CC 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≥2L\ge2 control degree, B>0B>0 be the rare-cell mass scale, and TLT_L be the degree-LL Chebyshev polynomial. Define

HL(z)=1−TL(1−2z)2L2,EL(z)=HL(z)z,GL(z)=1−EL(z)z, H_L(z)=\frac{1-T_L(1-2z)}{2L^2},\qquad E_L(z)=\frac{H_L(z)}z,\qquad G_L(z)=\frac{1-E_L(z)}z,

The quotients continue as polynomials at zero. The resulting weight is

Wa,L(s0,s1)=s0+s1BGL(sa/B), W_{a,L}(s_0,s_1)=\frac{s_0+s_1}{B}G_L(s_a/B),

Here s0,s1s_0,s_1 are the cell’s arm masses; z=sa/Bz=s_a/B is its scaled arm mass. The weight approximates (s0+s1)/sa(s_0+s_1)/s_a.

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)E_L(z). For z∈[0,1]z\in[0,1],

0≤EL(z)≤1,zGL(z)+EL(z)=1, 0\le E_L(z)\le 1, \qquad zG_L(z)+E_L(z)=1,

Thus zGL(z)zG_L(z) is the recovered fraction. For z>0z>0,

EL(z)≤(L2z)−1. E_L(z)\le (L^2z)^{-1}.

For a cell with px≤Bp_x\le B, success mass times the polynomial weight equals pxμax[1−EL(sax/B)]p_x\mu_{ax}[1-E_L(s_{ax}/B)].

The missing contribution is pxμaxEL(sax/B)p_x\mu_{ax}E_L(s_{ax}/B).

  • Overlap gives sax≥ϵpxs_{ax}\ge\epsilon p_x.
  • Its missing contribution is therefore at most B/(ϵL2)B/(\epsilon L^2): cell frequency cancels the reciprocal arm mass.

Across dd cells, bias is at most a constant times dB/L2dB/L^2. 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:

W^a,L(K0,K1)=∑r0,r1ca,r0,r1(K0)r0(K1)r1tr0+r1. \widehat W_{a,L}(K_0,K_1) = \sum_{r_0,r_1}c_{a,r_0,r_1} \frac{(K_0)_{r_0}(K_1)_{r_1}}{t^{r_0+r_1}}.

Here ca,r0,r1c_{a,r_0,r_1} are polynomial coefficients and r0,r1r_0,r_1 index powers. The falling factorial is (k)r=k(k−1)⋯(k−r+1)(k)_r=k(k-1)\cdots(k-r+1), with (k)0=1(k)_0=1.

Poisson factorial moments estimate mass powers without bias, so this estimated weight has expectation Wa,LW_{a,L}.

Independence from the outcome pool makes its product with Sax/uS_{ax}/u estimate exactly the polynomial contribution.

The approximation error survives estimation unchanged; sampling adds variance.

Hybrid Estimator

An independent pilot count JxJ_x selects the branch using threshold k0k_0:

Zx={S1xu W^1,L,x−S0xu W^0,L,x,Jx≤k0,S1xu K0x+K1x+1K1x+1−S0xu K0x+K1x+1K0x+1,k0<Jx. Z_x = \begin{cases} \dfrac{S_{1x}}u\,\widehat W_{1,L,x} - \dfrac{S_{0x}}u\,\widehat W_{0,L,x}, & J_x\le k_0,\\[1.2em] \dfrac{S_{1x}}u\,\dfrac{K_{0x}+K_{1x}+1}{K_{1x}+1} - \dfrac{S_{0x}}u\,\dfrac{K_{0x}+K_{1x}+1}{K_{0x}+1}, & k_0<J_x. \end{cases}

Each ZxZ_x 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][-1,1], the ATE’s possible range.

Averaging over Poisson prefix lengths gives the fixed-sample estimator τ^n,m,dmix\widehat\tau^{\mathrm{mix}}_{n,m,d}. This transfer costs at most a constant times 1/n1/n in the risk bound.

Variance Budgets

Polynomial weights amplify noise exponentially with degree. Write A⋆=7056A_\star=7056 for the fixed moment-growth constant.

For the hybrid sum before clipping, the two amplified terms fit two budgets: label variance 1/n1/n and squared bias (dB/L2)2(dB/L^2)^2. Constants are suppressed below.

| Amplified term | Budget that absorbs it | Required calibration | |---|---|---| | A⋆Lmin⁡{1,dB}/uA_\star^L\min\{1,dB\}/u: outcome noise over rare-cell mass | Split between label variance and squared bias by a quadratic inequality | L4A⋆2L≤nL^4A_\star^{2L}\le n | | A⋆LdB2A_\star^L dB^2: weight noise across rare cells | Label variance when d≤L4A⋆Ld\le L^4A_\star^L; squared bias above that cutoff | L6A⋆2L≤nL^6A_\star^{2L}\le 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 LL proportional to a sufficiently small multiple of log⁡(en)\log(en). Exponential variance growth then fits the labeled-sample budget.

Choose BB proportional to L/NL/N. More pooled records shrink the mass range requiring polynomial correction.

  • Bias is at most a constant times dB/L2dB/L^2.
  • Substituting these choices gives bias at most a constant times d/(Nlog⁡(en))d/(N\log(en)).
  • Squared bias supplies d2/(N2ℓn2)d^2/(N^2\ell_n^2); variance fits this term plus 1/n1/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/20<\epsilon<1/2, the hybrid estimator has worst-case MSE at most Cϵrϵ(n,m,d)C_\epsilon r_\epsilon(n,m,d) for every n≥1,m≥0,d≥2n\ge1,m\ge0,d\ge2.

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/4h_n=c_\epsilon/\sqrt n\le1/4, while their labeled samples remain too close for reliable discrimination.

Their auxiliary samples have identical distributions, regardless of mm.

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/41/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/20<\epsilon<1/2, every n≥1,m≥0,d≥2n\ge1,m\ge0,d\ge2 has minimax MSE at least c/nc/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)p/(p+a) by a degree-LL polynomial.

Here pp is a candidate rare-cell mass, BB bounds its range, and a=γϵB/L2a=\gamma_\epsilon B/L^2 is a positive smoothing scale. The interval is [a/κ,B][a/\kappa,B], with κ=(1−2ϵ)/ϵ\kappa=(1-2\epsilon)/\epsilon.

At this scale, the reciprocal expression retains a constant approximation gap.

Alternating approximation errors supply candidate masses pip_i and signed weights wiw_i satisfying

∑i=0L+1∣wi∣=1,∑i=0L+1wipij=0for every 0≤j≤L, \sum_{i=0}^{L+1}|w_i|=1,\qquad \sum_{i=0}^{L+1}w_i p_i^j=0\quad\text{for every }0\le j\le L,

but

cϵ≤∑i=0L+1wi pipi+a. c_\epsilon\le \sum_{i=0}^{L+1}w_i\,\frac{p_i}{p_i+a}.

The first formula cancels every polynomial through degree LL; the second preserves a positive target gap. This is the raw material for two hard-to-distinguish populations.

Shared-table Populations

Let σ\sigma place signed weight wiw_i at each candidate mass; ∣σ∣|\sigma| places absolute weight ∣wi∣|w_i|.

Draw each rare-cell raw mass from

ν(dp)=ap+a ∣σ∣(dp)(p∈I),ν({0})=1−∫Iap+a ∣σ∣(dp). \nu(dp)=\frac{a}{p+a}\,|\sigma|(dp)\quad(p\in I), \qquad \nu(\{0\})=1-\int_I\frac{a}{p+a}\,|\sigma|(dp).

Here I=[a/κ,B]I=[a/\kappa,B]; the remaining probability makes the cell empty.

For positive mass pip_i, set treated mass si=ϵ(pi+a)s_i=\epsilon(p_i+a). The interval guarantees overlap. Keep control means zero.

If h(pi)h(p_i) is the sign of wiw_i, branch b∈{0,1}b\in\{0,1\} assigns

μ1i(b)=1+(2b−1)h(pi)2. \mu_{1i}^{(b)}=\frac{1+(2b-1)h(p_i)}{2}.

This swaps treated means between zero and one according to the sign.

Generate kk 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 LL | 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)\epsilon(p+a). The drawing factor a/(p+a)a/(p+a) cancels its first factor of p+ap+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 uu and vv be labeled and auxiliary Poisson intensities, proportional to nn and NN.

The one-cell likelihood bound requires (u+v)B≤bϵL(u+v)B\le b_\epsilon L, with a sufficiently small positive overlap-dependent constant bϵb_\epsilon.

For the two one-cell predictive laws Q0,Q1\mathsf Q_0,\mathsf Q_1,

TV⁡(Q0,Q1)≤CϵuaρϵL,0<ρϵ<1. \operatorname{TV}(\mathsf Q_0,\mathsf Q_1) \le C_\epsilon u a\rho_\epsilon^L, \qquad 0<\rho_\epsilon<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 LL makes the terms beyond degree LL geometrically small.

The factor uaua reflects that a difference must pass through labeled outcomes. Summing across kk cells gives distance at most Cϵuka ρϵLC_\epsilon uka\,\rho_\epsilon^L.

Calibration Against Auxiliary Size

Choose the lower-bound scales

L=⌈Cϵ∘log⁡(en)⌉,B=b0Ln+m,a=γϵBL2, L=\left\lceil C_\epsilon^\circ \log(en)\right\rceil,\qquad B=\frac{b_0L}{n+m},\qquad a=\frac{\gamma_\epsilon B}{L^2},

Here Cϵ∘,b0,γϵC_\epsilon^\circ,b_0,\gamma_\epsilon are positive overlap-dependent constants; the lower bound uses a sufficiently large logarithmic degree.

Because u+vu+v is proportional to NN, the remainder depends on pooled size through NBNB. Shrinking BB as L/NL/N preserves the tail condition even when mm is arbitrarily large.

The mass budget keeps kaka bounded. Hence the joint distance bound Cϵuka ρϵLC_\epsilon uka\,\rho_\epsilon^L is at most a constant times nρϵLn\rho_\epsilon^L.

A sufficiently large multiple of log⁡(en)\log(en) makes this at most 1/81/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 aa. Choose

k=min⁡{d−1,⌊cϵ∘(n+m)L⌋}. k=\min\left\{d-1,\left\lfloor c_\epsilon^\circ(n+m)L\right\rfloor\right\}.

The first limit reserves a reservoir cell. The second keeps total separation bounded: aa is proportional to 1/(NL)1/(NL).

The raw target centers satisfy

cϵka≤∣θ1−θ0∣, c_\epsilon ka \le \left| \theta_1-\theta_0 \right|,

Here θb\theta_b is the expected unnormalized ATE in branch bb.

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)}\min\{1,d^2/((n+m)^2\log(en)^2)\}.

Concentration and Testing

Write Δ=∣θ1−θ0∣\Delta=|\theta_1-\theta_0|. Normalizing the generated populations must preserve their target separation.

Raw target and total-mass variances are at most CϵkBaC_\epsilon kBa. Relative to squared separation, the controlling ratio is B/(ka)B/(ka): enough rare cells make it small.

Use the rare-cell construction when

min⁡{1,d2(n+m)2log⁡(en)2}>Cϵn. \min\left\{1,\frac{d^2}{(n+m)^2\log(en)^2}\right\} > \frac{C_\epsilon}{n}.

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/81/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/20<\epsilon<1/2, for every n≥1,m≥0,d≥2n\ge1,m\ge0,d\ge2, priors with the same treatment–covariate table distribution yield minimax MSE at least cϵrϵ(n,m,d)c_\epsilon r_\epsilon(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)}\min\{1,1/n+d^2/(N^2\ell_n^2)\}. 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.

Theorem T-4 (Sharp annotation frontier)

For every overlap parameter ϵ\epsilon satisfying 0<ϵ<1/20<\epsilon<1/2, there exist constants cϵc_\epsilon and CϵC_\epsilon, depending only on ϵ\epsilon, with 0<cϵ≤Cϵ, 0<c_\epsilon\le C_\epsilon, such that the following assertions hold.

  • (Finite-sample bracket.) For every n≥1n\ge1, m≥0m\ge0, and d≥2d\ge2, cϵrϵ(n,m,d)≤Rϵ(n,m,d)≤Cϵrϵ(n,m,d), c_\epsilon r_\epsilon(n,m,d) \le R_\epsilon(n,m,d) \le C_\epsilon r_\epsilon(n,m,d), where, with N=n+mN=n+m and ℓn=log⁡(en)\ell_n=\log(en), rϵ(n,m,d)=min⁡ ⁣{1,1n+d2N2ℓn2}. r_\epsilon(n,m,d) = \min\!\left\{1,\frac1n+\frac{d^2}{N^2\ell_n^2}\right\}.
  • (Unannotated endpoint.) For every n≥1n\ge1 and every d≥0d\ge0, rϵ(n,0,d)=min⁡ ⁣{1,1n+d2n2log⁡2(en)}. r_\epsilon(n,0,d) = \min\!\left\{1,\frac1n+\frac{d^2}{n^2\log^2(en)}\right\}.
  • (Known-marginal limit.) For every fixed n≥1n\ge1 and d≥2d\ge2, lim⁡m→∞Rϵ(n,m,d)=Rϵknown(n,d). \lim_{m\to\infty} R_\epsilon(n,m,d) = R_\epsilon^{\mathrm{known}}(n,d).
  • (Sequence regimes.) For any sequences (mn)n≥1(m_n)_{n\ge1} and (dn)n≥1(d_n)_{n\ge1} of nonnegative integers satisfying dn≥2d_n\ge2 for every n≥1n\ge1, set Nn=n+mnN_n=n+m_n and ℓn=log⁡(en)\ell_n=\log(en). Then Rϵ(n,mn,dn)→0⟺dnNnℓn→0, R_\epsilon(n,m_n,d_n)\to0 \quad\Longleftrightarrow\quad \frac{d_n}{N_n\ell_n}\to0, Rϵ(n,mn,dn)=O(n−1)⟺dn=O ⁣(Nnℓnn), R_\epsilon(n,m_n,d_n)=O(n^{-1}) \quad\Longleftrightarrow\quad d_n=O\!\left(\frac{N_n\ell_n}{\sqrt n}\right), and Rϵ(n,mn,dn)=o ⁣(Rϵ(n,0,dn)) R_\epsilon(n,m_n,d_n) = o\!\left(R_\epsilon(n,0,d_n)\right) if and only if both dnn ℓn→∞ \frac{d_n}{\sqrt n\,\ell_n}\to\infty and dn/(Nnℓn)min⁡{1,dn/(nℓn)}→0. \frac{d_n/(N_n\ell_n)} {\min\{1,d_n/(n\ell_n)\}} \to0.

Appendix: Uniform Mixed Upper Bound

The specified hybrid estimator attains the frontier uniformly over the unrestricted overlap class.

Theorem T-2 (Uniform mixed upper bound)

Fix an overlap constant ϵ\epsilon with 0<ϵ<1/20<\epsilon<1/2. There exists a constant Cϵ>0C_\epsilon>0 such that, for every n≥1n\ge 1, m≥0m\ge 0, and d≥2d\ge 2, the total computable hybrid estimator τ^n,m,dmix\widehat\tau^{\mathrm{mix}}_{n,m,d} of Definition P-6 satisfies sup⁡P∈Md,ϵEP⊗n⊗PXA⊗m ⁣[{τ^n,m,dmix−τ(P)}2]≤Cϵ rϵ(n,m,d), \sup_{P\in\mathcal M_{d,\epsilon}} E_{P^{\otimes n}\otimes P_{XA}^{\otimes m}} \!\left[ \left\{\widehat\tau^{\mathrm{mix}}_{n,m,d}-\tau(P)\right\}^2 \right] \le C_\epsilon\, r_\epsilon(n,m,d), where τ(P)\tau(P) is the average treatment effect functional in Definition P-2, and rϵ(n,m,d)r_\epsilon(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.

Theorem T-3 (Common marginal converse)

Let ϵ\epsilon, the overlap parameter, satisfy 0<ϵ<1/20<\epsilon<1/2. Then there exist a constant cϵ>0c_\epsilon>0 and a collection of ϵ\epsilon-dependent calibration constants as in Definition P-7 such that, for every n,m,d∈Nn,m,d\in\mathbb N with n≥1n\ge1, m≥0m\ge0, and d≥2d\ge2, the regime-dependent handle in Definition P-7 supplies priors Π0\Pi_0 and Π1\Pi_1 satisfying LΠ0(PXA)=LΠ1(PXA) \mathcal L_{\Pi_0}(P_{XA})=\mathcal L_{\Pi_1}(P_{XA}) and cϵ rϵ(n,m,d)≤Rϵ(n,m,d), c_\epsilon\, r_\epsilon(n,m,d)\le R_\epsilon(n,m,d), where rϵ(n,m,d)r_\epsilon(n,m,d) is the frontier rate in Definition P-5 and Rϵ(n,m,d)R_\epsilon(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.

Theorem T-7 (Known marginal limit)

Fix an overlap parameter ϵ\epsilon, a labeled sample size nn, and a finite covariate alphabet size dd. Suppose

  • (Overlap.) 0<ϵ<1/20<\epsilon<1/2.
  • (Labeled size.) n≥1n\ge 1.
  • (Alphabet size.) d≥2d\ge 2.

Then the minimax mean-squared risk Rϵ(n,m,d)R_\epsilon(n,m,d) from Definition P-4 converges, as the auxiliary sample size m→∞m\to\infty, to the known-marginal minimax risk Rϵknown(n,d)R_\epsilon^{\mathrm{known}}(n,d) from Definition P-10: lim⁡m→∞Rϵ(n,m,d)=Rϵknown(n,d). \lim_{m\to\infty} R_\epsilon(n,m,d) = R_\epsilon^{\mathrm{known}}(n,d).