CausalSmith · seminar slides
Minimax ATE Estimation with Many Discrete Cells
With fixed overlap and a known heterogeneity radius, we give finite-sample minimax benchmarks for average treatment effect estimation and construct clipped estimators that match the lower benchmark in the main regimes.
Overview
- Target: scalar average treatment effect with a finite discrete adjustment variable.
- Challenge: many cells may be sparsely populated and unevenly weighted.
- Organizing parameter: σ, the heterogeneity radius for cell treatment effects.
- Main output: a finite-sample minimax bracket indexed by n,d,M,σ.
- Constructive side: a known-radius selector over polynomial, collision, and zero branches.
- Converse side: binary hard experiments transported into the same real-outcome class.
informal · Theorem T-14 Under fixed overlap, bounded outcome scale, and radius 0≤σ≤2, the minimax mean-squared risk lies between the stated lower benchmark and at most the stated selector benchmark.
Motivation
- Think of adjustment cells as age-by-income-by-region-by-baseline-history groups.
- Identification says we should compare treated and control outcomes within each cell.
- Finite samples create a second problem: some cells contain treated observations, controls, or neither.
- When d is large, the obstacle is combinatorial as much as statistical.
- The estimand is still one scalar ATE, but the data arrive through many sparse cells.
Research Question
- Suppose treatment is ignorable within a finite cell X∈{1,…,d}.
- Suppose every supported cell has fixed overlap ϵ≤πk≤1−ϵ.
- Suppose outcomes are real-valued, centered on scale M, with conditional second moments at most M2.
- Suppose cell effects differ from the ATE by at most σM.
- What is the best finite-sample mean-squared error as n,d,σ vary?
Setup
- pk is the cell mass P(X=k).
- πk is the cell propensity P(A=1∣X=k).
- μak is the conditional mean outcome in arm a and cell k.
- τk=μ1k−μ0k is the cell treatment effect.
- τ(P)=∑kpkτk is the average treatment effect.
- δk=τk−τ(P) is the cell-effect deviation.
For a real-outcome finite-cell law P indexed by k=1,…,d and an overlap parameter ϵ with 0<ϵ<1/2, assume consistency, conditional exchangeability of (Y(0),Y(1)) and A given X for measurable potential-outcome events, overlap ϵ≤πk≤1−ϵ whenever pk>0, and first-moment integrability of each arm-cell outcome law for every a∈{0,1} and positive-mass cell. With pk the cell mass and μak the arm-cell conditional outcome mean, define τ(P):=k=1∑dpk(μ1k−μ0k).
Assumptions
- Consistency and conditional exchangeability give the observed-data causal interpretation.
- Fixed overlap keeps both treatment arms available in every supported cell.
- Mean normalization fixes the outcome scale M.
- The second-central-moment bound allows real outcomes with variance control.
- Approximate homogeneity says the largest supported-cell deviation is at most σM.
For each cell k, let pk:=P(X=k), and, when pk>0, let πk:=P(A=1∣X=k). For every k with pk>0, ϵ≤πk≤1−ϵ.
For every cell k, let τk:=μ1k−μ0k and δk:=τk−j∑pjτj, both well defined on zero-mass cells as well. The cell-effect deviations satisfy k:pk>0max∣δk∣≤σM.
Model Class
- We work on one radius-indexed real-outcome model class.
- The class allows arbitrary cell masses.
- The radius σ∈[0,2] moves from exact homogeneity to unrestricted heterogeneity on the normalized scale.
- The minimax criterion asks for worst-case squared error over this class.
Pd,ϵ,M,σ:=⎩⎨⎧P:X∈{1,…,d}, A∈{0,1}, Y,Y(0),Y(1)∈R,0<ϵ<1/2,M≥1,0≤σ≤2,P satisfies ass:consistency, ass:conditional-exchangeability, ass:overlap, ass:mean-normalization, ass:second-central-moment, ass:approximate-homogeneity⎭⎬⎫.
Let Tn,M:={T:On→[−M,M]:T is measurable}. The minimax mean-squared risk over Pd,ϵ,M,σ is Rn,d,ϵ,M,σ:=T∈Tn,MinfP∈Pd,ϵ,M,σsupEQP(n)[(T−τ(P))2].
Related Literature
- Rubin (1974), Rubin (1979), and Rosenbaum and Rubin (1983) supply the potential-outcomes adjustment logic.
- Hahn (1998) and Hirano et al. (2003) give classical efficiency benchmarks for ATE estimation.
- Belloni et al. (2017), Chernozhukov et al. (2018), and Kennedy (2022) study high-dimensional nuisance estimation.
- Wager and Athey (2018), Nie and Wager (2021), and Semenova and Chernozhukov (2021) focus on heterogeneous-effect learning.
- Zeng et al. (2024) identify the closest sparse discrete-adjustment collision phenomena for binary outcomes.
- Jiao et al. (2015) and Wu and Yang (2016) supply the large-alphabet polynomial-estimation toolkit.
Key Idea
- Sparse cells create two useful regimes.
- Rare-cell regime: estimate a large-alphabet functional with a polynomial approximation.
- Crossed-cell regime: use cells where both treatment arms appear and borrow through the homogeneity radius.
- The known radius σ tells us which branch has the better benchmark.
- The zero branch handles fully saturated scales through clipping.
Estimators
- Heavy cells: use plug-in treated-control contrasts on the estimation split.
- Light cells: use a signed Chebyshev factorial device at degree Kn.
- Crossed cells: average treated-control contrasts over cells where both arms are observed.
- Selector: compare un,d=d2/[n2log2(en)], hn,d,σ=σ2+d/n2, and 1.
- All branches are clipped to [−M,M].
informal · Theorem T-10 The polynomial branch has risk at most the parametric term plus the rare-cell polynomial remainder, and the collision branch has risk at most the parametric term plus σ2+d/n2.
Given candidate estimators Tnpoly and Tncol, each a total measurable map On→[−M,M], define τn⋆ by the following steps.
- Define the rare-cell polynomial remainder un,d:=n2log2(en)d2.
- Define the collision remainder hn,d,σ:=σ2+n2d.
- Output the measurable selector τn⋆:=⎩⎨⎧Tncol,Tnpoly,0,hn,d,σ≤min{1,un,d},un,d<min{1,hn,d,σ},otherwise.
Upper Bound
- The selector inherits the better available branch.
- Polynomial estimation pays the rare-cell scale.
- Collision estimation pays the heterogeneity radius and the crossed-cell occupancy scale.
- The constant-zero branch protects the all-alphabet statement — validity at every alphabet size d, not just a restricted dimension range.
informal · Theorem T-11 The known-radius selector has worst-case mean-squared error at most CϵM2rn,d,σ for all n,d≥1, M≥1, and 0≤σ≤2.
For every overlap parameter ϵ with 0<ϵ<1/2, there exist a constant Cϵ>0 and a polynomial calibration handle (Nϵ,ρϵ) such that:
- (Handle calibration.) ρϵ>0, and for every pair of integers n,d≥1, Nϵ≤n,d≤ρϵnlog(en)⟹2≤Kn, where Kn is the polynomial degree used by the polynomial estimator.
- (Index range.) The guarantee applies to every pair of integers n,d≥1, every M≥1, and every 0≤σ≤2.
- (Model class.) The law P ranges over Pd,ϵ,M,σ from Definition P-1.
For these indices, let Tnpoly be the admissible polynomial estimator calibrated by (Nϵ,ρϵ), let Tncol be the collision estimator, and let τn⋆ be the known-radius selector in Definition P-7 applied with radius σ to these two estimators, and write rn,d,σ=n1+min{1,min[n2log2(en)d2,σ2+n2d]} for the selector benchmark. Then τn⋆ is measurable, satisfies τn⋆(s)∈[−M,M] for every sample s, and P∈Pd,ϵ,M,σsupEQP(n)[(τn⋆−τ(P))2]≤CϵM2rn,d,σ.
Lower Bound
- The converse uses binary sparse-cell experiments as source problems.
- An affine map preserves cell masses and propensities while putting outcomes on scale M.
- An exact-homogeneity source gives the collision baseline.
- A radius channel attenuates binary contrasts by σ/2 and fits the radius constraint.
- Data processing transfers the binary testing difficulty through the channel.
- The two components combine inside the same real-outcome model class.
informal · Theorem T-5 Binary source classes embed into the real-outcome classes, transferring exact-homogeneity and radius-channel lower bounds on the M scale.
informal · Theorem T-9 For every allowed n,d,M,σ, the minimax risk is at least the all-alphabet lower benchmark with exact-homogeneity and radius-channel components.
For every 0<ϵ<1/2, there exist constants cϵ and bϵrad such that 0<cϵ≤1,0<bϵrad. For all integers n,d≥1, all M≥1, and all 0≤σ≤2, the minimax mean-squared risk Rn,d,ϵ,M,σ of Definition P-9 satisfies cϵM2{n1+min(1,n2d)+σ2min(1,n2log2(en)d2)}≤Rn,d,ϵ,M,σ. Moreover, for the same constants and every such n,d,M,σ, there are a capped alphabet size drad, a source family, a padding map into {1,…,d}, an embedding into Pd,ϵ,M,σ, and a coupling realizing the radius-channel construction with source constant bϵrad. Along this realization, for all source laws P0,P1, τ(P1)−τ(P0)=M2σ{ψ(P1)−ψ(P0)}, and for every estimator τ taking values in [−M,M], some source law P satisfies cϵM2σ2min(1,n2log2(en)d2)≤EP{(τ−τ(P))2}.
Main Result
- The lower side adds two irreducible costs: crossed-cell scarcity under homogeneity and radius-sensitive rare-cell difficulty.
- The upper side takes the best of polynomial estimation, collision estimation, and the zero branch.
- The bracket is stated over one same-index model class.
For every overlap parameter ϵ with 0<ϵ<1/2, there are real constants cϵ and Cϵ such that 0<cϵ≤1,1≤Cϵ,cϵ≤Cϵ. For every n,d∈N, M∈R, and σ∈R, suppose that
- (Sample and alphabet sizes.) n≥1 and d≥1.
- (Outcome envelope.) M≥1.
- (Radius range.) 0≤σ≤2.
Let Rn,d,ϵ,M,σ be the minimax mean-squared risk in Definition P-9 over the real-outcome class Pd,ϵ,M,σ with fixed overlap ϵ, conditional exchangeability, consistency, conditional mean normalization, conditional second central moment envelope M, and approximate-homogeneity radius σM. Define un,d=n2log2(en)d2,hn,d,σ=σ2+n2d, and write ℓn,d,σ=n1+min{1,n2d}+σ2min{1,un,d},rn,d,σ=n1+min{1,un,d,hn,d,σ}. Then cϵM2ℓn,d,σ≤Rn,d,ϵ,M,σ≤CϵM2rn,d,σ.
Endpoints
- At σ=0, exact homogeneity gives the collision scale n−1+min(1,d/n2).
- At σ=2, the radius-indexed class equals the unrestricted-radius class.
- The unrestricted endpoint gives the large-alphabet polynomial scale n−1+min{1,d2/[n2log2(en)]}.
informal · Theorem T-12 The bracket reduces to the exact-homogeneity rate at radius zero and the unrestricted large-alphabet rate at radius two.
There exist constants c,C∈(0,∞), with c≤C, such that the following hold.
- (Exact homogeneity.) For every pair of integers n,d≥1, c{n−1+min(1,n2d)}≤n−1+min{1,n2log2(en)d2,n2d}≤C{n−1+min(1,n2d)}, and c{n−1+min(1,n2d)}≤n−1+min(1,n2d)≤C{n−1+min(1,n2d)}.
- (Unrestricted radius.) For every pair of integers n,d≥1, c{n−1+min(1,n2log2(en)d2)}≤n−1+min(1,n2log2(en)d2)≤C{n−1+min(1,n2log2(en)d2)}, and c{n−1+min(1,n2log2(en)d2)}≤n−1+min(1,n2d)+4min(1,n2log2(en)d2)≤C{n−1+min(1,n2log2(en)d2)}.
- (Class equality at radius two.) For every alphabet size d, every ϵ∈R, and every M∈R, the laws represented by Pd,ϵ,Munr in Definition P-2 are exactly the laws represented by Pd,ϵ,M,2 in Definition P-1.
- (Endpoint identity.) For every pair of integers n,d≥1, the radius-two upper frontier expression is exactly n−1+min(1,n2log2(en)d2).
Regimes
- For every fixed positive radius, the upper and lower benchmarks agree in order.
- They also agree in the saturated region.
- They agree when the polynomial term is dominated by the exact-homogeneity baseline.
- They agree when the squared radius is dominated by the exact-homogeneity baseline.
- The remaining region is a shrinking-radius wedge with intermediate alphabet size.
informal · Theorem T-13 Fixed positive radii, saturation, and parametric-dominance elbows have minimax risk within constants of the selector benchmark.
Proof Sketch
- Upper bound: split the sample, classify cells, and analyze heavy and light contributions conditionally on the pilot split.
- Light-cell control: Chebyshev coefficients approximate the rare-cell functional, and factorial statistics estimate the required moments.
- Collision control: crossed cells supply direct contrasts, while σ bounds the effect of cells that fail to cross.
- Lower bound: binary hard instances are embedded into real outcomes without changing the adjustment structure.
- Radius channel: attenuation by σ/2 keeps alternatives inside the radius class and scales target separation.
Also in the Paper
informal · Theorem T-6 On the restricted dimension range, the polynomial and collision branches satisfy the same two constructive upper bounds.
informal · Theorem T-2 On the restricted dimension range, the known-radius selector has risk at most the stated frontier benchmark.
informal · Theorem T-4 On the restricted dimension range, the minimax risk is at least the parametric, exact-collision, and radius-channel lower benchmark.
informal · Theorem T-3 On the restricted dimension range, the endpoint expressions reduce to the exact-homogeneity and unrestricted-radius rates.
informal · Theorem T-7 On the restricted dimension range, fixed interior radii and the parametric elbows match the selector benchmark.
informal · Theorem T-8 On the restricted dimension range, the same two-sided minimax bracket holds with the range condition.
informal · Theorem Under the published binary collision guarantee, the selector remainder is at most the collision remainder, and it is asymptotically smaller when the polynomial remainder is negligible relative to the collision remainder.
Conclusion
- We give a finite-sample minimax bracket for scalar ATE estimation with many discrete adjustment cells.
- The model allows arbitrary cell masses and real outcomes under fixed overlap, bounded conditional means, and bounded conditional second moments.
- The heterogeneity radius σ organizes the attainable risk.
- The known-radius selector is constructive and all-alphabet.
- The bracket is order matched at exact homogeneity, unrestricted radius, every fixed positive radius, saturation, and the parametric-dominance elbows.