CausalSmith · seminar slides

Honest Length for Transported Complier Effects

Under bounded outcomes and transported IV contrasts, we identify the target complier effect and show that honest confidence-set length is governed by the effective strength tn=nμn2/κnt_n=n\mu_n^2/\kappa_n.

Overview

  • We study an encouragement design observed in a source population.
  • The target population supplies covariates, so effects are transported by reweighting source contrasts.
  • The target estimand is the complier effect in the target population.
  • Weak first stages make the transported Wald ratio hard to estimate.
  • The exact difficulty is summarized by tnt_n, the effective identification strength.
  • Score inversion attains the honest expected-length frontier.

Motivation

  • Think of a canvassing or program-offer experiment run in one population.
  • In the source, we observe encouragement ZZ, receipt DD, outcome YY, and covariates XX.
  • In the target, we observe the covariate distribution where we want the complier effect.
  • Transport weights can be uneven when the target overrepresents covariate cells that are rare in the source.
  • A weak transported first stage and uneven transport weights both reduce usable information.
  • The question is: what honest confidence-set length is achievable?
Source cells covariates X Z,D,Y observed Target cells covariates X target population Transport weights target-to-source uneven reweighting Weighted cells few carry much target population Transported moments outcome contrast μ_n first stage Kish dispersion weight dispersion κ_n IV strength t_n=nμ_n²/κ_n Target effect complier effect θ_T
illustrative Box-and-arrow schematic showing source cells and target cells forming transport weights, weighted cells, transported moments, Kish dispersion, effective IV strength, and the target complier effect.

Background

  • LATE uses an encouragement-induced outcome contrast divided by an encouragement-induced receipt contrast.
  • Imbens and Angrist (1994) and Angrist et al. (1996) give the source IV logic.
  • Chen and Huang (2025) study transported complier effects with regular first stages.
  • Anderson and Rubin (1949) and Fieller (1954) give the ratio-inference logic used for weak denominators.
  • Our contribution combines transport, weak first stages, and honest expected length for a bounded causal ratio.

Setup

  • Source population S=1S=1: X,Z,D,YX,Z,D,Y are observed.
  • Target population S=0S=0: target covariates XX determine the population being transported to.
  • Outcomes are bounded in [0,1][0,1], and receipt is binary.
  • The source encouragement satisfies overlap, randomization, exclusion, and monotonicity.
  • Transport uses the target-to-source density ratio w(X)w(X).
  • The target complier effect is θT\theta_T, the target complier-conditional outcome contrast.

Transport Assumptions

  • Outcome transport: the source conditional assignment-outcome contrast carries to the target at the same XX.
  • Receipt transport: the target-average receipt contrast equals the target average of the source conditional receipt contrast.
  • Target complier positivity gives a positive target complier share.
  • Transport domination PTPSXP_T\ll P_S^X gives the density ratio w=dPT/dPSXw=dP_T/dP_S^X.
  • Fixed instrument overlap controls the inverse-propensity source score.
  • Kish dispersion κn\kappa_n measures how uneven the target-to-source weights are.

Identification

informal · Theorem T-1 Under the transported IV model, the target complier effect equals the transported Wald ratio and lies in Θ=[1,1]\Theta=[-1,1].

Theorem T-1 (Compact causal range)

Fix nn, PP, NnN_n, knk_n, cc, and the instrument-overlap constant ε\varepsilon. Suppose that:

  • (Model class.) PP belongs to the transported complier-effect model class Pn\mathcal P_n of Definition P-1.
  • (Source contrasts.) The source conditional outcome contrast ΔY(x)\Delta_Y(x) and the source conditional receipt contrast ΔD(x)\Delta_D(x) are measurable and integrable with respect to the source covariate marginal PSXP_S^X.

Then ΔY\Delta_Y and ΔD\Delta_D represent the observed source contrasts: for every measurable covariate set AA, {OS:XA}H(OS)YdPS=AΔY(x)dPSX(x),{OS:XA}H(OS)DdPS=AΔD(x)dPSX(x). \int_{\{O^S:X\in A\}} H(O^S)Y\,dP_S = \int_A \Delta_Y(x)\,dP_S^X(x), \qquad \int_{\{O^S:X\in A\}} H(O^S)D\,dP_S = \int_A \Delta_D(x)\,dP_S^X(x). Moreover, with μY,n=(Y(1)Y(0))1{D(1)=1, D(0)=0}dPnF(S=0) \mu_{Y,n} = \int \bigl(Y(1)-Y(0)\bigr)\mathbf 1\{D(1)=1,\ D(0)=0\}\,dP_n^F(\,\cdot\mid S=0) and μn=PnF{D(1)=1, D(0)=0S=0}, \mu_n = P_n^F\{D(1)=1,\ D(0)=0\mid S=0\}, the transported reduced-form and first-stage means satisfy w(x)ΔY(x)dPSX(x)=μY,n,w(x)ΔD(x)dPSX(x)=μn. \int w(x)\Delta_Y(x)\,dP_S^X(x)=\mu_{Y,n}, \qquad \int w(x)\Delta_D(x)\,dP_S^X(x)=\mu_n. Consequently, μY,nμn=θT=EPnF ⁣[Y(1)Y(0)D(1)=1, D(0)=0, S=0]Θ=[1,1]. \frac{\mu_{Y,n}}{\mu_n} = \theta_T = \mathbb E_{P_n^F}\!\left[Y(1)-Y(0)\mid D(1)=1,\ D(0)=0,\ S=0\right] \in \Theta=[-1,1].

Effective Strength

- The transported first-stage mean is μn\mu_n, the target average compliance contrast. - The weight-dispersion scale is κn=ES[w(X)2]\kappa_n=\mathbb E_S[w(X)^2]. - The effective identification strength is tn=nμn2κn. t_n=\frac{n\mu_n^2}{\kappa_n}. - Larger μn\mu_n strengthens the denominator. - Larger κn\kappa_n reduces the effective source information. - The expected-length frontier is indexed by a fixed threshold t0t_0.

Score Inversion

  • For each candidate ϑΘ\vartheta\in\Theta, form a transported source score for YϑDY-\vartheta D.
  • Keep candidate values whose score is small relative to the weight-dispersion radius.
  • This is the transported Anderson-Rubin and Fieller logic.
  • The compact range Θ=[1,1]\Theta=[-1,1] keeps the ratio inference on the causal outcome scale.
Candidates θ ∈ Θ First stage empirical slope B̂_n Source score Â_n − θB̂_n transported, bounded Dispersion κ̂_n transport weights Radius L_α √(κ̂_n/n) Compare score against radius Retained confidence set
illustrative Box-and-arrow schematic showing candidate values, empirical first stage, transported source score, weight dispersion, critical radius, comparison, and retained confidence set.

Oracle Frontier

informal · Theorem T-2 Any oracle honest procedure has worst-case expected length at least a constant multiple of min{1,t01/2}\min\{1,t_0^{-1/2}\} above effective strength t0t_0.

Theorem T-2 (Oracle lower frontier)

Fix c>0c>0, an instrument-overlap constant ε(0,1/2)\varepsilon\in(0,1/2), and a noncoverage level α(0,1)\alpha\in(0,1). There exist constants c0>0c_0>0 and tc>0t_c>0, depending only on (α,ε,c)(\alpha,\varepsilon,c), such that the following holds for every measurable covariate space X\mathcal X. Let NnN_n and knk_n be integer sequences satisfying:

Then, for every effective-strength threshold t0>0t_0>0, c0min{1,t01/2}V(t0) c_0 \min\{1,t_0^{-1/2}\} \le V^\star(t_0) and c0min{1,t01/2}VN(t0), c_0 \min\{1,t_0^{-1/2}\} \le V_{\mathcal N}^\star(t_0), where V(t0)V^\star(t_0) and VN(t0)V_{\mathcal N}^\star(t_0) are the oracle values in Definition P-5, Definition P-6. Moreover, whenever 0<t0tc0<t_0\le t_c, c0V(t0). c_0 \le V^\star(t_0).

informal · Theorem T-4 Oracle score inversion is honest and has worst-case expected length at most a constant multiple of min{1,t01/2}\min\{1,t_0^{-1/2}\}.

Theorem T-4 (Oracle score inversion)

Let NnN_n and knk_n be integer sequences, and let cc, ε\varepsilon, and α\alpha be constants. Suppose that:

  • (Sampling ratio.) c>0c>0 and Nn/ncN_n/n\to c.
  • (Overlap and coverage constants.) 0<ε<1/20<\varepsilon<1/2 and 0<α<10<\alpha<1.
  • (Envelope scale.) kn>0k_n>0 for every nn, knk_n\to\infty, and kn/n0k_n/\sqrt n\to0.
  • (Admissible geometry.) The measurable covariate space admits a deterministic geometry g\mathfrak g satisfying Definition P-11 with envelope scale knk_n and overlap constant ε\varepsilon.
  • (Model-class implications.) For every nn and every transported array PP, membership of PP in the transported complier-effect model class Pn\mathcal P_n of Definition P-1 implies Assumption A-3, Assumption A-4, Assumption A-13, Assumption A-14, Assumption A-15.

Define Lα=(8αε2)1/2,Hi=Zie(Xi)1Zi1e(Xi), L_\alpha=\left(\frac{8}{\alpha\varepsilon^2}\right)^{1/2}, \qquad H_i=\frac{Z_i}{e(X_i)}-\frac{1-Z_i}{1-e(X_i)}, and A^n=1ni=1nw(Xi)HiYi,B^n=1ni=1nw(Xi)HiDi,κ^n=1ni=1nw(Xi)2. \widehat A_n=\frac1n\sum_{i=1}^n w(X_i)H_iY_i, \qquad \widehat B_n=\frac1n\sum_{i=1}^n w(X_i)H_iD_i, \qquad \widehat\kappa_n=\frac1n\sum_{i=1}^n w(X_i)^2 . Let the score-inversion confidence set be Cn={ϑΘ:A^nϑB^nLακ^n/n}. C_n = \left\{\vartheta\in\Theta: \left|\widehat A_n-\vartheta\widehat B_n\right| \le L_\alpha\sqrt{\widehat\kappa_n/n} \right\}. Then the sequence (Cn)(C_n) is oracle honest, (Cn)Cor(C_n)\in\mathfrak C^{\mathrm{or}} in the sense of Definition P-3, and for every fixed effective-strength threshold t0>0t_0>0, R((Cn),t0)C0min{1,t01/2},C0=max{2,4Lα+8ε2}. R((C_n),t_0) \le C_0\min\{1,t_0^{-1/2}\}, \qquad C_0=\max\left\{2,4L_\alpha+\frac8{\varepsilon^2}\right\}. Consequently, for the oracle minimax value V(t0)V^\star(t_0) of Definition P-5, 3(1α)216min{1,t01/2}V(t0)C0min{1,t01/2}, \frac{3(1-\alpha)^2}{16}\min\{1,t_0^{-1/2}\} \le V^\star(t_0) \le C_0\min\{1,t_0^{-1/2}\}, and for every admissible geometry gG\mathfrak g'\in\mathcal G the fixed-geometry value of Definition P-14 obeys the same two-sided bounds, 3(1α)216min{1,t01/2}Vg(t0)C0min{1,t01/2}. \frac{3(1-\alpha)^2}{16}\min\{1,t_0^{-1/2}\} \le V_{\mathfrak g'}^\star(t_0) \le C_0\min\{1,t_0^{-1/2}\}.

Fixed Geometry

  • Fix the source covariate law, transport weights, and source propensity.
  • Let the causal response law vary within the transported IV model.
  • The same effective-strength frontier holds uniformly over admissible deterministic geometries.
  • This shows that tnt_n absorbs both first-stage weakness and transport dispersion.
  • With no covariate shift, w(X)=1w(X)=1, κn=1\kappa_n=1, and tn=nμn2t_n=n\mu_n^2.

informal · Theorem T-6 For every admissible fixed geometry, the minimax expected length is bounded above and below by constants times min{1,t01/2}\min\{1,t_0^{-1/2}\}.

Theorem T-6 (Fixed-geometry length frontier)

Let c>0c>0, let NnN_n be target sample sizes with Nn/ncN_n/n\to c, let knk_n be positive integers with knk_n\to\infty and kn/n0k_n/\sqrt n\to0, let ε(0,1/2)\varepsilon\in(0,1/2), and let α(0,1)\alpha\in(0,1). Let g\mathfrak g be a deterministic geometry array satisfying Definition P-11 at scale knk_n and overlap parameter ε\varepsilon. Assume that, for every nn, every law in the fixed-geometry slice Pn(g)\mathcal P_n(\mathfrak g) of Definition P-12 satisfies

Define Lα=(8αε2)1/2,cα=3(1α)216,Cα=max{2,4Lα+8ε2}. L_\alpha=\left(\frac{8}{\alpha\varepsilon^2}\right)^{1/2}, \qquad c_\alpha=\frac{3(1-\alpha)^2}{16}, \qquad C_\alpha=\max\{2,4L_\alpha+8\varepsilon^{-2}\}. Then, for every fixed effective-strength threshold t0>0t_0>0, the fixed-geometry minimax expected-length value Vg(t0)V_{\mathfrak g}^\star(t_0) of Definition P-14 satisfies cαmin{1,t01/2}Vg(t0)Cαmin{1,t01/2}. c_\alpha\min\{1,t_0^{-1/2}\} \le V_{\mathfrak g}^\star(t_0) \le C_\alpha\min\{1,t_0^{-1/2}\}. The constants cαc_\alpha and CαC_\alpha depend only on α\alpha and ε\varepsilon, uniformly over admissible deterministic geometry arrays g\mathfrak g.

informal · Theorem T-3 With unit transport weights, the fixed-geometry frontier has the same min{1,t01/2}\min\{1,t_0^{-1/2}\} order with tn=nμn2t_n=n\mu_n^2.

Cell Weight Learning

  • In the uniform finite-cell design, target covariates identify target cell frequencies.
  • Source data estimate outcome and receipt contrasts within each cell.
  • The transported reduced form and first stage average those cell contrasts using empirical target frequencies.
  • A target-sample collision statistic estimates the weight-dispersion scale.
  • The resulting score inversion uses observed samples only.
Target sample covariate cell labels Cell frequencies target empirical probabilities Collision statistic weight-dispersion scale Source sample outcome receipt encouragement IV contrasts outcome contrast receipt contrast Transported estimates reduced form first stage Score inversion confidence set
illustrative Box-and-arrow schematic showing target cell labels, empirical cell frequencies, collision statistic, source outcome-receipt-encouragement data, cellwise IV contrasts, transported estimates, and score inversion.

Finite-cell Result

informal · Theorem T-5 In the uniform finite-cell class with kn/n0k_n/\sqrt n\to0, a sample-only score inversion attains expected length at most a constant multiple of min{1,t01/2}\min\{1,t_0^{-1/2}\}, with a matching lower bound.

Theorem T-5 (Finite-cell sample-only attainment)

Let NnN_n and knk_n be positive integer sequences, let c,ε,αRc,\varepsilon,\alpha\in\mathbb R, and suppose the following conditions hold.

  • (Sampling ratio.) c>0c>0 and Nn/ncN_n/n\to c.
  • (Overlap and coverage levels.) 0<ε<1/20<\varepsilon<1/2 and 0<α<10<\alpha<1.
  • (Cell growth.) kn>0k_n>0 for every nn, knk_n\to\infty, and kn/n0k_n/\sqrt n\to0.
  • (Ambient carrier.) For every nn, the measurable covariate space contains an injected copy of {1,,kn}\{1,\ldots,k_n\} whose singleton images are measurable.
  • (Finite-cell rows.) For every row nn and every transported array PNnP\in\mathcal N_n, with Nn\mathcal N_n as in Definition P-2, the row satisfies the two-sample condition in Assumption A-3, the uniform finite-cell source condition in Assumption A-16, and the degrading-array condition in Assumption A-15.

Put Bc=32(1+c1),Lα,c=(2Bcα)1/2,C0=max{2,42Lα,c+8Bc}. B_c=32(1+c^{-1}),\qquad L_{\alpha,c}=\left(\frac{2B_c}{\alpha}\right)^{1/2},\qquad C_0=\max\{2,4\sqrt2\,L_{\alpha,c}+8B_c\}. Then C0>0C_0>0, and there exists a sample-only finite-cell confidence-set sequence C=(Cn)C=(C_n) in the feasible class Ccell\mathfrak C^{\mathrm{cell}} of Definition P-7 such that, for every nn and every PNnP\in\mathcal N_n, CnC_n agrees PP-almost surely under the two-sample law with the finite-cell score-inversion rule using critical constant Lα,cL_{\alpha,c}. Equivalently, on the finite-cell experiment, this rule is given by Hi=2(2Zi1),p^x,n=1Nnj=1Nn1{XjT=x}, H_i=2(2Z_i-1),\qquad \widehat p_{x,n}=\frac1{N_n}\sum_{j=1}^{N_n}\mathbf 1\{X_j^T=x\}, and, for G{Y,D}G\in\{Y,D\}, m^G,n(x)=knni=1n1{Xi=x}HiGi,M^G,n=x=1knp^x,nm^G,n(x). \widehat m_{G,n}(x)=\frac{k_n}{n}\sum_{i=1}^n \mathbf 1\{X_i=x\}H_iG_i,\qquad \widehat M_{G,n}=\sum_{x=1}^{k_n}\widehat p_{x,n}\widehat m_{G,n}(x). For Nn2N_n\ge2, define κ^U,n=knNn(Nn1)j1{XjT=XT},K^n=1+κ^U,n, \widehat\kappa_{U,n} =\frac{k_n}{N_n(N_n-1)} \sum_{j\ne\ell}\mathbf 1\{X_j^T=X_\ell^T\},\qquad \widehat K_n=1+\widehat\kappa_{U,n}, and set Cn={ϑΘ:M^Y,nϑM^D,nLα,cK^n/n}, C_n=\left\{\vartheta\in\Theta: |\widehat M_{Y,n}-\vartheta\widehat M_{D,n}| \le L_{\alpha,c}\sqrt{\widehat K_n/n}\right\}, with Cn=ΘC_n=\Theta at indices for which Nn<2N_n<2. For every t0>0t_0>0, lim supnsupPNn:tnt0EP[λ(Cn)]C0min{1,t01/2}. \limsup_{n\to\infty}\sup_{P\in\mathcal N_n:\,t_n\ge t_0} \mathbb E_P[\lambda(C_n)] \le C_0\min\{1,t_0^{-1/2}\}. Moreover, for every t0>0t_0>0, the feasible finite-cell honest minimax risk satisfies 3(1α)216min{1,t01/2}infC~Ccelllim supnsupPNn:tnt0EP[λ(C~n)]. \frac{3(1-\alpha)^2}{16}\min\{1,t_0^{-1/2}\} \le \inf_{\widetilde C\in\mathfrak C^{\mathrm{cell}}} \limsup_{n\to\infty}\sup_{P\in\mathcal N_n:\,t_n\ge t_0} \mathbb E_P[\lambda(\widetilde C_n)].

Regular Cells

  • The regular extension allows source cell probabilities to vary within fixed constants times 1/kn1/k_n.
  • The construction uses known source cell probabilities and a known cell-varying propensity.
  • Empirical target frequencies still supply the transported target weights.
  • The same strength-indexed expected-length order is attained.

informal · Theorem T-7 With known regular source-cell probabilities and known propensity, feasible regular-cell score inversion attains the oracle frontier order on Nnreg\mathcal N_n^{\mathrm{reg}}.

Theorem T-7 (Regular-cell score attainment)

Fix c,ε,α,c,c+Rc,\varepsilon,\alpha,c_-,c_+\in\mathbb R, target sample sizes NnN_n, and cell counts knk_n. Suppose that

  • (Sample-size ratio.) 0<c0<c and Nn/ncN_n/n\to c.
  • (Overlap and coverage levels.) 0<ε<1/20<\varepsilon<1/2 and 0<α<10<\alpha<1.
  • (Regular cell constants.) 0<c10<c_-\le 1 and 1c+1\le c_+.
  • (Cell growth.) kn>0k_n>0 for every nn, knk_n\to\infty, and kn/n0k_n/\sqrt n\to0.
  • (Measurable carrier.) For every nn, the covariate carrier contains knk_n injected measurable singleton cells.
  • (Model restrictions.) Every array PNnregP\in\mathcal N_n^{\mathrm{reg}} from Definition P-15 with constants c,ε,c,c+c,\varepsilon,c_-,c_+ satisfies Assumption A-3, Assumption A-4, and Assumption A-15.

On Nnreg\mathcal N_n^{\mathrm{reg}}, let qx,n=PSX(X=x)q_{x,n}=P_S^X(X=x) and define Hi=Zie(Xi)1Zi1e(Xi). H_i=\frac{Z_i}{e(X_i)}-\frac{1-Z_i}{1-e(X_i)}. For G{Y,D}G\in\{Y,D\}, set p^x,n=1Nnj=1Nn1{XjT=x},m^G,n(x)=1nqx,ni=1n1{Xi=x}HiGi, \widehat p_{x,n}=\frac1{N_n}\sum_{j=1}^{N_n}\mathbf 1\{X_j^T=x\}, \qquad \widehat m_{G,n}(x)=\frac1{nq_{x,n}}\sum_{i=1}^n \mathbf 1\{X_i=x\}H_iG_i, and M^G,n=x=1knp^x,nm^G,n(x). \widehat M_{G,n}=\sum_{x=1}^{k_n}\widehat p_{x,n}\widehat m_{G,n}(x). For Nn2N_n\ge2, set κ^U,n=1Nn(Nn1)j1{XjT=XT}qXjT,n,K^n=1+κ^U,n, \widehat\kappa_{U,n} = \frac1{N_n(N_n-1)}\sum_{j\ne\ell} \frac{\mathbf 1\{X_j^T=X_\ell^T\}}{q_{X_j^T,n}}, \qquad \widehat K_n=1+\widehat\kappa_{U,n}, and put Cnreg=ΘC_n^{\mathrm{reg}}=\Theta when Nn<2N_n<2. Let Bε,c=8(ε2+c1). B_{\varepsilon,c}=8(\varepsilon^{-2}+c^{-1}). For every L{2Bε,c/α}1/2L\ge\{2B_{\varepsilon,c}/\alpha\}^{1/2}, define C0=max{2,42L+8Bε,c}. C_{0}=\max\{2,4\sqrt2L+8B_{\varepsilon,c}\}. Then 0<C00<C_0, and there exists a regular-cell procedure C=(Cn)n1C=(C_n)_{n\ge1} such that, for every nn and every PNnregP\in\mathcal N_n^{\mathrm{reg}}, CnC_n agrees almost surely under the two-sample law with Cnreg={ϑΘ:M^Y,nϑM^D,nLK^n/n} C_n^{\mathrm{reg}} = \left\{\vartheta\in\Theta: |\widehat M_{Y,n}-\vartheta\widehat M_{D,n}| \le L\sqrt{\widehat K_n/n}\right\} for Nn2N_n\ge2, together with the preceding convention for Nn<2N_n<2. This procedure belongs to Creg\mathfrak C^{\mathrm{reg}} from Definition P-16. Moreover, for every fixed t0>0t_0>0, lim supnsupPNnreg:tnt0EP[λ(Cn)]C0min{1,t01/2}. \limsup_{n\to\infty}\sup_{P\in\mathcal N_n^{\mathrm{reg}}:\,t_n\ge t_0} \mathbb E_P[\lambda(C_n)] \le C_0\min\{1,t_0^{-1/2}\}. For every fixed t0>0t_0>0, the minimax risk over Creg\mathfrak C^{\mathrm{reg}} satisfies 3(1α)216min{1,t01/2}infCCreglim supnsupPNnreg:tnt0EP[λ(Cn)]. \frac{3(1-\alpha)^2}{16}\min\{1,t_0^{-1/2}\} \le \inf_{C\in\mathfrak C^{\mathrm{reg}}} \limsup_{n\to\infty}\sup_{P\in\mathcal N_n^{\mathrm{reg}}:\,t_n\ge t_0} \mathbb E_P[\lambda(C_n)]. Thus, with known regular source-cell probabilities and a known cell-varying propensity satisfying the stated overlap, the feasible regular-cell construction attains the oracle frontier order on Nnreg\mathcal N_n^{\mathrm{reg}}.

Proof Sketch

  • The upper bound starts from score inversion over the compact causal range.
  • At the true θT\theta_T, the transported score is centered.
  • Bounded outcomes, binary receipt, overlap, and weight dispersion control the score radius.
  • When the empirical first stage is stable, score inversion has length on the order of radius divided by the first stage.
  • The bad-slope probability is controlled by the same effective strength tnt_n.
  • The compact range supplies the order-one length scale at weak effective strength.

Lower-bound Idea

  • Fix an admissible transport geometry.
  • Calibrate complier probabilities proportional to the transport weights.
  • This makes the transported first stage match the threshold t0t_0.
  • Tilt only the complier outcome mean.
  • The tilt moves θT\theta_T while the observed-data laws remain close.
  • Honesty therefore forces confidence sets to cover separated target complier effects with nontrivial probability.

Conclusion

  • We identify θT\theta_T as a transported complier ratio in the compact range [1,1][-1,1].
  • We characterize honest expected length through tn=nμn2/κnt_n=n\mu_n^2/\kappa_n.
  • Oracle score inversion attains the minimax order min{1,t01/2}\min\{1,t_0^{-1/2}\}.
  • The same order holds at fixed transport geometry.
  • Finite-cell target-weight learning preserves the oracle frontier under the stated growth and regularity conditions.