CausalSmith · seminar slides

Confidence Intervals for Transported Complier Effects

How precisely can an encouragement experiment measure treatment effects for compliers in a population that supplies only covariates?

Motivation

An encouragement experiment records covariates, encouragement, treatment receipt and outcomes.

A target population supplies only covariates. We want its average treatment effect among compliers: people whose receipt changes when encouraged.

The standard approach transports source encouragement-arm contrasts, divides the outcome contrast by the receipt contrast, and applies the delta method.

Chen and Huang (2025) identify this ratio and establish regular inference under their assignment, selection and moment conditions, at a fixed positive first stage.

Two difficulties interact:

  • Rough transport functions leave nonlinear estimation bias after first-order correction.
  • Weak compliance makes division by an estimated first stage unstable.

How short can intervals be if coverage must hold even under arbitrarily weak positive compliance?

Key Idea

Correct the two transported contrasts through cubic order. Then retain candidate effects whose implied outcome contrast agrees with the estimated outcome contrast.

This separates two tasks: controlling rough-function estimation error and handling weak compliance.

Our setting has independent source and target samples of size nn, scalar covariates, bounded outcomes and Hölder-1/81/8 nuisance functions.

informal · Theorem T-3 Under our equal-size Hölder-1/81/8 model, fixed overlap, valid monotone encouragement and both complier transport equalities, optimal honest expected length is of order min⁡{1,n−1/3/a}\min\{1,n^{-1/3}/a\} for n≥256n\ge256, 0<a≤1/40<a\le1/4.

Here aa is a compliance floor used to evaluate precision. One observable interval sequence attains this order without knowing aa.

Example

Consider a balanced encouragement experiment.

  • Both populations have uniform covariates; encouragement probability is one half.
  • Compliers have share bb; always-takers and never-takers each have share (1−b)/2(1-b)/2.
  • Binary outcomes have mean one half in both encouragement arms.

Its density and arm-mean functions are

fS=fT=1,e=12,mDz=rz(b),mYz=12, f_{\mathrm S}=f_{\mathrm T}=1,\qquad e=\frac12,\qquad m_{Dz}=r_z^{(b)},\qquad m_{Yz}=\frac12,

where fS,fTf_{\mathrm S},f_{\mathrm T} are covariate densities, ee is encouragement probability, and mAzm_{Az} is the mean response AA in arm zz. Receipt probability is rz(b)=(1+(2z−1)b)/2r_z^{(b)}=(1+(2z-1)b)/2.

For this center law P⋆P_{\star},

μ(P⋆)=b,θ(P⋆)=0. \mu(P_{\star})=b,\qquad \theta(P_{\star})=0.

The transported compliance share μ\mu is bb; the target complier effect θ\theta is zero.

Our lower bound will compare this center with rough alternatives that have different effects but are difficult to distinguish observationally.

Model

We observe nn independent source records (X,Z,D,Y)(X,Z,D,Y) and nn independent target covariates XX; the samples are independent.

  • X∈[0,1]X\in[0,1]; encouragement ZZ and receipt DD are binary.
  • D(z)D(z) is potential receipt under encouragement zz.
  • Y(d)∈[0,1]Y(d)\in[0,1] is the potential outcome under receipt dd.
  • C=1{D(1)>D(0)}C=\mathbf 1\{D(1)>D(0)\} indicates a complier; S=0S=0 denotes target membership and S=1S=1 source membership.

The estimand is

θ=EPnF[(Y(1)−Y(0))C∣S=0]EPnF[C∣S=0], \theta= \frac{\mathbb E_{P_n^F}[(Y(1)-Y(0))C\mid S=0]} {\mathbb E_{P_n^F}[C\mid S=0]},

where PnFP_n^F is the full-data law of populations and potential variables.

The numerator averages effects weighted by complier status; the denominator normalizes by target complier prevalence. Bounded outcomes give the effect domain Θ=[−1,1]\Theta=[-1,1].

Assumptions

Fixed overlap and roughness. Both covariate densities lie between fixed envelopes 0<cf<1<Cf0<c_f<1<C_f. Encouragement probabilities lie between 1/41/4 and 3/43/4. Densities, propensity and four arm means have supremum norm at most L>1L>1 and changes bounded by L∣x−x′∣1/8L|x-x'|^{1/8}.

Valid encouragement. Conditional on XX, source encouragement is independent of potential variables. Observed variables satisfy consistency, and encouragement affects outcomes through receipt.

Monotonicity. D(1)≥D(0)D(1)\ge D(0): encouragement never prevents receipt.

Two transport equalities. At almost every target covariate value,

EPnF[(Y(1)−Y(0))C∣X=x,S=0]=EPnF[(Y(1)−Y(0))C∣X=x,S=1], \mathbb E_{P_n^F}[(Y(1)-Y(0))C\mid X=x,S=0] = \mathbb E_{P_n^F}[(Y(1)-Y(0))C\mid X=x,S=1],

EPnF[C∣X=x,S=0]=EPnF[C∣X=x,S=1], \mathbb E_{P_n^F}[C\mid X=x,S=0] = \mathbb E_{P_n^F}[C\mid X=x,S=1],

These carry the complier-weighted effect and complier prevalence across populations.

In the balanced example, the same conditional potential-variable law in both populations satisfies both equalities.

Identification

Let mAz(x)m_{Az}(x) be the source mean of response A∈{D,Y}A\in\{D,Y\} in encouragement arm zz, and let ΔA(x)=mA1(x)−mA0(x)\Delta_A(x)=m_{A1}(x)-m_{A0}(x).

Average each source contrast over the target covariate distribution:

TA=∫ΔA(x)fT(x) dx. T_A=\int \Delta_A(x)f_{\mathrm T}(x)\,dx.

This computes the transported receipt or outcome contrast.

Validity and monotonicity make the receipt contrast a complier share and the outcome contrast a complier-weighted effect. The two transport equalities then give

μ=TD,θ=TYTD. \mu=T_D, \qquad \theta=\frac{T_Y}{T_D}.

We assume μ>0\mu>0, allowing it to approach zero.

informal · Lemma L-1 Under our sampling, regularity, valid-encouragement, monotonicity and two complier transport restrictions, TDT_D equals target complier prevalence and TY/TDT_Y/T_D identifies the target complier effect.

Honest Inference

Let Mn\mathcal M_n collect the assumptions just given, including every positive compliance share.

Fix noncoverage probability 0<α<10<\alpha<1. An interval is honest if coverage is at least 1−α1-\alpha at every law in Mn\mathcal M_n.

Evaluate precision on the slice Mn(a)\mathcal M_n(a), where a≤μ(P)≤1/4a\le\mu(P)\le1/4:

Ln(a)=inf⁡Cn∈Hnsup⁡P∈Mn(a)EP ⁣[λΘ(Cn)],n≥n0,0<a≤14, L_n(a) = \inf_{C_n\in\mathfrak H_n} \sup_{P\in\mathcal M_n(a)} \mathbb E_P\!\left[\lambda_{\Theta}(C_n)\right], \qquad n\ge n_0,\quad 0<a\le\frac14,

Here Hn\mathfrak H_n is the class of honest connected intervals, CnC_n is a candidate procedure, and λΘ\lambda_{\Theta} measures length within the effect domain. The threshold is n0=256n_0=256.

This is the smallest worst-case expected length on a strength slice. Coverage remains global; aa evaluates performance and is not an input to our procedure.

Main Result

Under our model, with fixed α,cf,Cf,L\alpha,c_f,C_f,L, positive constants c0,C0c_0,C_0 independent of n,an,a satisfy, for n≥256n\ge256 and 0<a≤1/40<a\le1/4,

c0min⁡{1,n−1/3/a}≤Ln(a)≤C0min⁡{1,n−1/3/a}. c_0\min\{1,n^{-1/3}/a\} \le L_n(a) \le C_0\min\{1,n^{-1/3}/a\}.

This bounds optimal worst-case expected length from both sides.

  • At a≤n−1/3a\le n^{-1/3}, optimal expected length has constant order.
  • Above that scale, it has order n−1/3/an^{-1/3}/a.

The same interval sequence InI_n responds to actual compliance:

EP ⁣[λΘ(In)]≤C0min⁡{1,n−1/3/μ(P)}, \mathbb E_P\!\left[\lambda_{\Theta}(I_n)\right] \le C_0\min\{1,n^{-1/3}/\mu(P)\},

for every P∈MnP\in\mathcal M_n and n≥256n\ge256. In the balanced example, μ(P⋆)=b\mu(P_{\star})=b: even a zero effect becomes difficult to measure when compliance is weak.

informal · Theorem T-1 Under our model with fixed admissible coverage, density and smoothness constants, InI_n is honest for every positive sample size; for n≥256n\ge256, its expected length is at most C0min⁡{1,n−1/3/μ(P)}C_0\min\{1,n^{-1/3}/\mu(P)\}.

Observable Density Components

Estimate density components from counts and response-weighted counts:

qz(x)=fS(x)PS(Z=z∣X=x),rAz(x)=qz(x)mAz(x),A∈{Y,D},z∈{0,1}. q_z(x)=f_{\mathrm S}(x)P_{\mathrm S}(Z=z\mid X=x), \qquad r_{Az}(x)=q_z(x)m_{Az}(x), \qquad A\in\{Y,D\},\quad z\in\{0,1\}.

Here PSP_{\mathrm S} is the source-record law. The arm density qzq_z counts records in arm zz; rAzr_{Az} weights those records by receipt or outcome.

Let FF collect the target density, two arm densities and four response-weighted arm densities. Then

TA=∫01ΦA(F(x)) dx,ΦA(F)=fT(rA1q1−rA0q0). T_A=\int_0^1\Phi_A(F(x))\,dx, \qquad \Phi_A(F)=f_{\mathrm T} \left(\frac{r_{A1}}{q_1}-\frac{r_{A0}}{q_0}\right).

The ratios recover arm means; target density weighting transports their difference.

Fixed overlap keeps the arm densities away from zero. Thus the function ΦA\Phi_A has bounded derivatives through order four, even though its unknown inputs vary roughly with covariates.

Bias Correction

A histogram pilot F^\widehat F estimates the seven density components. Clipping keeps its values within the fixed model bounds.

Plugging the pilot into ΦA\Phi_A leaves nonlinear bias. A linear correction removes first-order error; products of two and three pilot errors still need correction.

Our estimator is

T^A={∫01ΦA(F^(x)) dx+LA+QA+CA,n≥n0,0,n<n0. \widehat T_A= \begin{cases} \displaystyle \int_0^1\Phi_A(\widehat F(x))\,dx+ \mathsf L_A+\mathsf Q_A+\mathsf C_A, & n\ge n_0,\\ 0,& n<n_0. \end{cases}

The pilot integral estimates TAT_A; LA,QA,CA\mathsf L_A,\mathsf Q_A,\mathsf C_A estimate its linear, quadratic and cubic Taylor corrections.

Robins et al. (2008) supply the higher-order functional-estimation approach. Our construction applies it to the seven observable source–target density components.

How can noisy data estimate products of unknown pilot errors?

Independent Residual Products

Split each sample into one training block and three evaluation blocks. Conditional on the pilot, evaluation blocks are independent.

Let Hi,K(b)H_{i,K}^{(b)} be the response-weighted histogram for coordinate ii, block bb and KK cells. Its residual is Ri,K(b)=Hi,K(b)−F^iR_{i,K}^{(b)}=H_{i,K}^{(b)}-\widehat F_i.

The quadratic correction is

QA=12K2∑i,j∈I∑ℓ=1K2∂ijΦA(F^(xℓ,K2))Ri,K2(1)(xℓ,K2)Rj,K2(2)(xℓ,K2). \mathsf Q_A= \frac{1}{2K_2} \sum_{i,j\in\mathcal I}\sum_{\ell=1}^{K_2} \partial_{ij}\Phi_A(\widehat F(x_{\ell,K_2})) R_{i,K_2}^{(1)}(x_{\ell,K_2}) R_{j,K_2}^{(2)}(x_{\ell,K_2}).

Here I\mathcal I indexes the seven coordinates, xℓ,K2x_{\ell,K_2} is a cell midpoint, and ∂ijΦA\partial_{ij}\Phi_A measures curvature.

Each residual's conditional mean is its cell-averaged pilot error. Independence makes the product's conditional mean the product of those errors.

The cubic term uses three residual factors from distinct blocks. Repeated coordinates also use distinct blocks, preventing evaluation-noise products from introducing bias.

Why Cubic Order

Write the coordinate pilot error as δi(x)=Fi(x)−F^i(x)\delta_i(x)=F_i(x)-\widehat F_i(x). Its moment bounds are

EP[δi(x)2]≤Cpilot,2n−1/5,EP[∣δi(x)∣8]≤Cpilot,8n−4/5. \mathbb E_P[\delta_i(x)^2] \le C_{\mathrm{pilot},2}n^{-1/5}, \qquad \mathbb E_P[|\delta_i(x)|^8] \le C_{\mathrm{pilot},8}n^{-4/5}.

The constants depend on fixed model bounds. These inequalities control squared and eighth-power errors at every covariate value.

  • Linear correction leaves products of two errors.
  • Quadratic correction leaves products of three errors.
  • Cubic correction leaves products of four errors.

Squaring the fourth-order remainder produces eighth powers. The second bound controls its squared contribution at scale n−4/5n^{-4/5}, below the required n−2/3n^{-2/3}.

Independent residual products estimate cell averages. The remaining task is to control what cell averaging loses.

Resolution Balance

Within each cell, a function minus its cell average integrates to zero. Terms containing exactly one such difference therefore cancel.

Quadratic approximation error begins with two differences; cubic approximation error also benefits from a remaining pilot-error factor.

| Component | Number of cells | Purpose | |---|---|---| | Pilot | K0≍n4/5K_0\asymp n^{4/5} | Controls pilot moments | | Quadratic correction | K2≍n4/3K_2\asymp n^{4/3} | Balances approximation error and variance n−1+K2n−2n^{-1}+K_2n^{-2} | | Cubic correction | K3≍nK_3\asymp n | Controls approximation while limiting product variance |

Combining the Taylor remainder, cell approximation and sampling fluctuations gives

sup⁡P∈MnEP ⁣[(T^A−TA)2]≤Cmsen−2/3,A∈{Y,D}. \sup_{P\in\mathcal M_n} \mathbb E_P\!\left[(\widehat T_A-T_A)^2\right] \le C_{\mathrm{mse}}n^{-2/3}, \qquad A\in\{Y,D\}.

Both transported contrasts therefore have root-mean-square error at most a constant times n−1/3n^{-1/3}. The computable constant CmseC_{\mathrm{mse}} depends on cf,Cf,Lc_f,C_f,L.

Confidence Interval

Anderson and Rubin (1949) supply the inversion principle: test the outcome contrast implied by a candidate effect while retaining the first stage inside the moment.

Our acceptance set is

An={θ∈[−1,1]:∣T^Y−θT^D∣≤22Cmseα n−1/3}. \mathcal A_n = \left\{ \theta\in[-1,1]: \left|\widehat T_Y-\theta\widehat T_D\right| \le 2\sqrt{\frac{2C_{\mathrm{mse}}}{\alpha}}\, n^{-1/3} \right\}.

Each candidate θ\theta predicts outcome contrast θT^D\theta\widehat T_D. We retain it when its discrepancy from T^Y\widehat T_Y is within the uniform tolerance.

For n≥256n\ge256, report this interval if nonempty and {0}\{0\} otherwise. For smaller samples, report Θ=[−1,1]\Theta=[-1,1].

The procedure uses the coverage level and fixed model bounds, without a compliance floor. Its explicit worst-case calibration constant is highly conservative.

Coverage Mechanism

For n≥256n\ge256, let rn=2Cmse/α n−1/3r_n=\sqrt{2C_{\mathrm{mse}}/\alpha}\,n^{-1/3} be the single-contrast radius.

The mean-square bound and Chebyshev's inequality place both contrast errors within rnr_n with probability at least 1−α1-\alpha.

At the true effect,

∣T^Y−θ(P)T^D∣=∣(T^Y−TY(P))+θ(P)(μ(P)−T^D)∣≤∣T^Y−TY(P)∣+∣θ(P)∣ ∣T^D−μ(P)∣≤2rn. \begin{aligned} |\widehat T_Y-\theta(P)\widehat T_D| &= |(\widehat T_Y-T_Y(P)) +\theta(P)(\mu(P)-\widehat T_D)|\\ &\le|\widehat T_Y-T_Y(P)| +|\theta(P)|\,|\widehat T_D-\mu(P)|\\ &\le2r_n. \end{aligned}

This bounds the true effect's score error using identification, TY(P)=θ(P)μ(P)T_Y(P)=\theta(P)\mu(P), and the effect-domain bound ∣θ(P)∣≤1|\theta(P)|\le1.

The true effect is accepted whenever both contrast bounds hold. The calculation remains valid however small positive compliance becomes.

Length Mechanism

The estimated first stage is the score's slope as the candidate effect varies.

When ∣T^D−μ(P)∣≤μ(P)/2|\widehat T_D-\mu(P)|\le\mu(P)/2, the slope has magnitude at least μ(P)/2\mu(P)/2. Hence

λΘ(In)≤min⁡{2,4rn∣T^D∣}≤min⁡{2,8rnμ(P)}. \lambda_\Theta(I_n) \le \min\left\{2,\frac{4r_n}{|\widehat T_D|}\right\} \le \min\left\{2,\frac{8r_n}{\mu(P)}\right\}.

Length is bounded by the effect-domain diameter and by score tolerance divided by slope.

The mean-square bound controls the probability of an unreliable slope; length is at most two on those realizations.

Above the rough estimation scale, compliance converts contrast uncertainty into inverse-strength effect uncertainty. At or below that scale, the bounded effect domain supplies the constant-length branch.

What forces every honest procedure to face these same two regimes?

Rough Alternatives

Return to the balanced center, now with compliance b=aˉ=max⁡{a,n−1/3}b=\bar a=\max\{a,n^{-1/3}\}.

Tile [0,1][0,1] with sine waves, independently choosing each cell's sign λℓ\lambda_\ell. Write the resulting perturbation as u=uλu=u_\lambda. Its cell count and height are

KL=⌈n4/3⌉,aˉ=max⁡{a,n−1/3},hn=c⋆KL−1/8. K_{\mathrm L}=\lceil n^{4/3}\rceil, \qquad \bar a=\max\{a,n^{-1/3}\}, \qquad h_n=c_{\star}K_{\mathrm L}^{-1/8}.

The small fixed amplitude c⋆>0c_{\star}>0 keeps the alternatives within the model; write h=hnh=h_n. Each cell contains hλℓsin⁡(2π(KLx−ℓ))h\lambda_\ell\sin(2\pi(K_{\mathrm L}x-\ell)).

Change target density and encouragement together:

fS=1,fT=1+uλ,e1(λ)=12+uλ,e0(λ)=12−uλ. f_{\mathrm S}=1, \qquad f_{\mathrm T}=1+u_{\lambda}, \qquad e_1^{(\lambda)}=\frac12+u_{\lambda}, \qquad e_0^{(\lambda)}=\frac12-u_{\lambda}.

Here ez(λ)e_z^{(\lambda)} is encouragement-arm probability. Each wave integrates to zero, preserving the target density's total mass.

Coupled Outcome Means

A continuum index τ∈[−1,1]\tau\in[-1,1] controls outcome changes. Set v=τuv=\tau u.

The alternative's receipt and outcome means are

mDz(x)=rz(b)=1+(2z−1)b2,mYz(x)=12+τu(x)1+2(2z−1)u(x),z∈{0,1}. m_{Dz}(x)=r_z^{(b)}=\frac{1+(2z-1)b}{2}, \qquad m_{Yz}(x)= \frac12+\frac{\tau u(x)}{1+2(2z-1)u(x)}, \quad z\in\{0,1\}.

Receipt means retain their balanced-center values. Both outcome arms move with the same signed perturbation, but their denominators reflect opposite encouragement changes.

Subtracting the arms gives

ΔD(x)=b,ΔY(x)=−u(x)v(x)1/4−u(x)2. \Delta_D(x)=b,\qquad \Delta_Y(x)=-\frac{u(x)v(x)}{1/4-u(x)^2}.

The receipt contrast stays fixed. Because v=τuv=\tau u, the outcome contrast depends on u2u^2: reversing a cell's sign preserves it.

Small amplitude permits a realization using only compliers, always-takers and never-takers. The same conditional potential-variable law in both populations supplies both transport equalities.

Sign-independent Separation

Let B(t)=sin⁡(2πt)B(t)=\sin(2\pi t) denote one cell's wave, with t∈[0,1]t\in[0,1] its local coordinate. Define

Jn=h2∫01B(t)21/4−h2B(t)2 dt. J_n = h^2\int_0^1 \frac{B(t)^2}{1/4-h^2B(t)^2}\,dt.

This measures the integrated squared perturbation, adjusted for encouragement probabilities.

Transport weights the outcome contrast by 1+u1+u. The resulting quadratic term is independent of cell signs; the cubic term integrates to zero because B(1−t)=−B(t)B(1-t)=-B(t).

Thus every sign configuration at a given τ\tau has the same effect:

θ(Qλ,τ)=−τJnb. \theta(Q_{\lambda,\tau})=-\frac{\tau J_n}{b}.

Here Qλ,τQ_{\lambda,\tau} is the alternative law, whose transported compliance remains bb.

Since the denominator in the integral stays bounded away from zero, 2h2≤Jn≤4h22h^2\le J_n\le4h^2.

With h=c⋆KL−1/8h=c_{\star}K_{\mathrm L}^{-1/8} and KL=⌈n4/3⌉K_{\mathrm L}=\lceil n^{4/3}\rceil, separation has order n−1/3n^{-1/3}. Varying τ\tau sweeps out a continuum of effects around zero.

Hidden Observable Changes

The nonlinear arm means arise from source probabilities that change only linearly in the signed perturbation:

Qλ,τ(Z=z,D=d,Y=y∣X=x)=ez(λ)(x)Rz(b)(d,y)+vλ,τ(x)(2y−1)4, Q_{\lambda,\tau}(Z=z,D=d,Y=y\mid X=x) = e_z^{(\lambda)}(x)R_z^{(b)}(d,y) +\frac{v_{\lambda,\tau}(x)(2y-1)}4,

where d,y∈{0,1}d,y\in\{0,1\}, vλ,τ=τuλv_{\lambda,\tau}=\tau u_\lambda, and Rz(b)R_z^{(b)} is the center's receipt–outcome cell probability. It equals rz(b)/2r_z^{(b)}/2 for d=1d=1 and (1−rz(b))/2(1-r_z^{(b)})/2 for d=0d=0.

Encouragement changes and outcome-cell changes are both linear in uλu_\lambda. Target density changes are linear too.

Averaging cell signs therefore restores each one-record observed law to the center.

Across records, the common cell signs still induce dependence. Terms using a cell's sign an odd number of times cancel; products using it an even number of times can survive.

The causal contrast survives because it depends on the squared perturbation.

Mixture Balance

Let MτM_\tau average the alternatives' full two-sample experiments over cell signs. Let P⋆(n,n)P_{\star}^{(n,n)} be the center's experiment with nn source and nn target records.

The surviving sign products accumulate according to n2h4/KLn^2h^4/K_{\mathrm L}. This accounts for evidence from both samples, including their shared cell signs.

The chosen scaling satisfies

n2≤KL3/2,h4=c⋆4KL−1/2, n^2\le K_{\mathrm L}^{3/2}, \qquad h^4=c_{\star}^4K_{\mathrm L}^{-1/2},

so accumulated evidence is bounded by a constant times c⋆4c_{\star}^4, while effect separation remains proportional to h2h^2.

The likelihood calculation establishes

1+χ2(Mτ,P⋆(n,n))≤exp⁡{Cmixc⋆4}. 1+\chi^2(M_{\tau},P_{\star}^{(n,n)}) \le\exp\{C_{\mathrm{mix}}c_{\star}^4\}.

Here χ2\chi^2 measures squared likelihood discrepancy and CmixC_{\mathrm{mix}} is a fixed numerical constant. Choosing c⋆c_{\star} sufficiently small gives, uniformly in τ\tau,

TV⁡(Mτ,P⋆(n,n))≤1−α2. \operatorname{TV}(M_{\tau},P_{\star}^{(n,n)}) \le\frac{1-\alpha}{2}.

Total variation bounds the difference in probability of any data event. The mixture hides the alternatives while preserving their common effect separation.

Why Shorter Intervals Fail

Set rsep=Jn/br_{\mathrm{sep}}=J_n/b, the radius of the alternatives' effect continuum.

Honesty requires coverage for every alternative. Averaging signs preserves that coverage; mixture closeness transfers it to the center:

P⋆(n,n)(t∈Cn)≥1−α2,t∈[−rsep,rsep]. P_{\star}^{(n,n)}(t\in C_n) \ge\frac{1-\alpha}{2}, \qquad t\in[-r_{\mathrm{sep}},r_{\mathrm{sep}}].

Thus any globally honest confidence set CnC_n must include every candidate effect in this continuum with substantial probability under the zero-effect center.

Expected length integrates inclusion probabilities:

EP ⁣[λΘ(Cn)]=∫ΘP(t∈Cn) dt. \mathbb E_P\!\left[\lambda_{\Theta}(C_n)\right] = \int_{\Theta}P(t\in C_n)\,dt.

At the center, this gives expected length at least (1−α)rsep(1-\alpha)r_{\mathrm{sep}}.

Because JnJ_n has order n−1/3n^{-1/3} and b=max⁡{a,n−1/3}b=\max\{a,n^{-1/3}\}, it produces both branches of the frontier.

informal · Theorem T-2 Under our model with fixed admissible coverage, density and smoothness constants, every globally honest measurable confidence set has worst-case expected length at least c0min⁡{1,n−1/3/a}c_0\min\{1,n^{-1/3}/a\} for n≥256n\ge256, 0<a≤1/40<a\le1/4.

Open Questions

  • What is the exact length frontier when source and target sample sizes grow at unrelated rates, and can one honest interval attain every allocation regime?
  • How does the benchmark change with higher-dimensional covariates or unknown smoothness?
  • How should inference change under dependent records or alternative transport restrictions?

The unequal-sample question retains the same causal assumptions and requires a matching lower family satisfying monotonicity.

Takeaways

  • Valid monotone encouragement and two conditional transport equalities identify the target complier effect as a ratio of transported contrasts.
  • Cubic correction controls rough estimation error; score inversion preserves coverage under arbitrarily weak positive compliance.
  • Squared perturbations change the effect while sign averaging hides observable changes, forcing optimal expected length of order min⁡{1,n−1/3/a}\min\{1,n^{-1/3}/a\}.

Appendix: Sharp Length Frontier

The exact result combines global finite-sample coverage, matching optimal-length bounds and a law-specific guarantee for one interval sequence.

Theorem T-3 (Sharp length frontier with elbow)

Fix real constants α,cf,Cf,L\alpha,c_f,C_f,L satisfying:

  • (Noncoverage probability.) 0<α<10<\alpha<1.
  • (Lower density envelope.) 0<cf<10<c_f<1.
  • (Upper density envelope.) 1<Cf1<C_f.
  • (Hölder radius.) 1<L1<L.

Let InI_n be the score interval of Definition P-10, and let Ln(a)L_n(a) be the minimax expected restricted length defined in Definition P-13. Set n0=256. n_0=256. There exist finite constants 0<c0<C00<c_0<C_0, depending only on (α,cf,Cf,L)(\alpha,c_f,C_f,L), such that In∈HnI_n\in\mathfrak H_n, the class of honest intervals in Definition P-11, for every integer n>0n>0, and, for every integer n≥n0n\ge n_0 and every real aa with 0<a≤1/40<a\le 1/4, c0min⁡{1,n−1/3/a}≤Ln(a)≤C0min⁡{1,n−1/3/a}. c_0\min\{1,n^{-1/3}/a\} \le L_n(a) \le C_0\min\{1,n^{-1/3}/a\}. Moreover, for every integer n≥n0n\ge n_0 and every law P∈MnP\in\mathcal M_n as defined in Definition P-1, writing μ(P)=TD(P) \mu(P)=T_D(P) for the transported first stage, the same interval sequence satisfies EP ⁣[λΘ(In)]≤C0min⁡{1,n−1/3/μ(P)}, \mathbb E_P\!\left[\lambda_{\Theta}(I_n)\right] \le C_0\min\{1,n^{-1/3}/\mu(P)\}, where λΘ\lambda_{\Theta} denotes Lebesgue length restricted to the effect domain Θ\Theta.

Appendix: Honest Upper Length Envelope

The attaining interval covers throughout the model and has expected length bounded according to actual transported compliance.

Theorem T-1 (Honest upper length envelope)

Fix the noncoverage probability α\alpha, the density envelopes cf,Cfc_f,C_f, and the Hölder radius LL, satisfying:

  • (Noncoverage.) 0<α<10<\alpha<1.
  • (Lower density envelope.) 0<cf<10<c_f<1.
  • (Upper density envelope.) 1<Cf1<C_f.
  • (Hölder radius.) 1<L1<L.

The score interval InI_n of Definition P-10 belongs to the class Hn\mathfrak H_n of honest intervals in Definition P-11 for every positive integer nn. Set the sample-size threshold to n0=256. n_0=256. Write μ(P)\mu(P) for the transported first stage, namely the target-averaged source receipt contrast: μ(P)=TD(P). \mu(P)=T_D(P). There exists a finite constant C0=C0(α,cf,Cf,L)>0C_0=C_0(\alpha,c_f,C_f,L)>0 such that, for every integer n≥n0n\ge n_0 and every P∈MnP\in\mathcal M_n, the model class of Definition P-1, EP ⁣[λΘ(In)]≤C0min⁡{1,n−1/3μ(P)}, \mathbb E_P\!\left[\lambda_{\Theta}(I_n)\right] \le C_0\min\left\{1,\frac{n^{-1/3}}{\mu(P)}\right\}, where λΘ\lambda_{\Theta} denotes Lebesgue length restricted to the effect domain Θ\Theta, and the expectation is under the joint law of the source and target samples, each of size nn. With the same constant C0C_0, for every integer n≥n0n\ge n_0 and every real aa satisfying 0<a≤1/40<a\le 1/4, the minimax expected-length frontier Ln(a)L_n(a) of Definition P-13 satisfies Ln(a)≤C0min⁡{1,n−1/3a}. L_n(a)\le C_0\min\left\{1,\frac{n^{-1/3}}{a}\right\}.

Appendix: Honest Length Lower Bound

Every globally honest measurable confidence set faces the matching worst-case expected-length bound, including disconnected sets.

Theorem T-2 (Honest length lower bound)

Fix constants satisfying:

  • (Coverage.) The noncoverage probability satisfies 0<α<10<\alpha<1.
  • (Density envelopes.) The lower and upper density envelopes satisfy 0<cf<1<Cf0<c_f<1<C_f.
  • (Smoothness.) The common Hölder radius satisfies L>1L>1.

Let Mn\mathcal M_n be the model class in Definition P-1, and let Mn(a)\mathcal M_n(a) be its strength slice in Definition P-12. Write θ(P)\theta(P) for the target-population average treatment effect among compliers under PP, and let the effect domain and sample-size threshold be Θ=[−1,1],n0=256. \Theta=[-1,1], \qquad n_0=256. There exists a constant c0=c0(α,cf,Cf,L)>0c_0=c_0(\alpha,c_f,C_f,L)>0 such that, for every integer n≥n0n\ge n_0 and every 0<a≤1/40<a\le 1/4, the following holds. Every measurable confidence-set procedure CnC_n, based on nn source records and nn target covariate records, with Cn(ω)⊆ΘC_n(\omega)\subseteq\Theta for every sample realization ω\omega, and satisfying P(θ(P)∈Cn)≥1−αfor every P∈Mn, P\bigl(\theta(P)\in C_n\bigr)\ge 1-\alpha \qquad\text{for every }P\in\mathcal M_n, obeys sup⁡P∈Mn(a)EP ⁣[λΘ(Cn)]≥c0min⁡{1,n−1/3a},λΘ(Cn)=Leb⁡(Cn∩Θ). \sup_{P\in\mathcal M_n(a)} \mathbb E_P\!\left[\lambda_{\Theta}(C_n)\right] \ge c_0\min\left\{1,\frac{n^{-1/3}}{a}\right\}, \qquad \lambda_{\Theta}(C_n) =\operatorname{Leb}(C_n\cap\Theta). Here probabilities and expectations are taken under the observed two-sample law. Moreover, the minimax expected-length frontier Ln(a)L_n(a) of Definition P-13 satisfies Ln(a)≥c0min⁡{1,n−1/3a}. L_n(a)\ge c_0\min\left\{1,\frac{n^{-1/3}}{a}\right\}.