CausalSmith · seminar slides
Minimax Error for Network Interference
We characterize the design-based minimax mean squared error for total treatment effects under known bounded-degree, low-order network interference and Bernoulli assignment.
slides for Minimax Mean Squared Error for Low-order Network Interference under Bernoulli Assignment
Overview
- We study the all-treated-versus-all-control effect τn, the finite-population average contrast between assigning everyone treatment and assigning everyone control.
- Outcomes may depend on neighbors' assignments through a low-order polynomial.
- The graph is known, and both in-degree and out-degree are bounded by d.
- The treatment design is independent Bernoulli with common probability p.
- The minimax mean squared error is governed by one local energy Ad and one graph-overlap charge d.
informal · Theorem T-1 Under fixed β≥1 and 0<p<1, clipped SNIPE attains the coefficient-mass minimax risk up to constants depending only on (β,p).
Motivation
- Network experiments often target a total treatment effect, not only a direct effect.
- Under interference, one unit's outcome can depend on many assignments.
- Bernoulli assignment gives variation in many local exposure patterns, but those patterns are reused across overlapping neighborhoods.
- The practical question is: how much precision is possible when the graph is known and interference is low order?
- The answer matters for design planning: the degree d controls the finite-population price of interference.
Running Example
- Think of a platform experiment where each user is treated independently.
- A user's outcome can depend on their own assignment and on treated neighbors.
- Low-order interference means we allow individual and pairwise, or more generally fixed-order, neighborhood interactions.
- Bounded degree means each user has at most d relevant neighbors and can affect at most d outcomes.
- The estimand asks for the average change between turning treatment on for everyone and turning it off for everyone.
Setup
- Vn is the finite population, and Zj is unit j's Bernoulli treatment assignment.
- Ni is the directed interference neighborhood of unit i.
- Yi(z) is a polynomial in assignments inside Ni, with interaction order at most β.
- B is the radius of the bounded coefficient-mass or bounded-outcome class.
- τn is the all-treated-versus-all-control total treatment effect.
- Risk averages over the random assignment, with the graph and potential outcomes fixed.
Assumptions
- Common-probability Bernoulli assignment: units are independently treated with probability p∈(0,1).
- Bounded interference degree: every neighborhood has size at most d, and every assignment coordinate enters at most d neighborhoods.
- Low-order outcomes: only monomials of degree at most β enter each potential outcome.
- Coefficient-mass envelope: each unit's polynomial coefficients have total absolute mass at most B.
- In the running example, d is the maximum measured local spillover degree, and β is the modeled interaction complexity.
SNIPE Mechanism
- SNIPE is the low-order polynomial interference estimator of Cortez-Rodriguez et al. (2023).
- Mechanism: for each unit, weight the observed outcome by centered Bernoulli monomials over its neighborhood.
- The score is calibrated so its design expectation recovers the all-treated-versus-all-control contrast for every low-order monomial.
- The clipped version projects the estimate into the natural bounded range.
- Clipping is what lets the same estimator cover the saturated minimax branch.
Key Idea
- The local difficulty is summarized by the complete-block score energy Ad.
- Ad measures how much Bernoulli variation is needed to extract the all-treated-versus-all-control contrast inside one d-unit neighborhood.
- The global difficulty adds one graph charge: an assignment coordinate can appear in up to d unit-level scores.
- The exposed order k⋆(d,β,p) is the largest interaction order with nonzero Bernoulli contrast.
- For fixed (β,p), the frontier is the local exposed-interaction count times the overlap charge.
informal · Lemma L-1 The complete-block energy is comparable to the exposed binomial term, and the normalized block representer solves the local contrast problem.
Related Literature
- Horvitz and Thompson (1952), Rubin (1978), and Imbens and Rubin (2015) provide the finite-population design-based language.
- Manski (1993), Sobel (2006), Hudgens and Halloran (2008), and Aronow and Samii (2017) develop core interference frameworks.
- Leung (2022), Sävje et al. (2021), Hu et al. (2022), and Gao and Ding (2025) emphasize local interference, exposure, and graph-aware design.
- Cortez-Rodriguez et al. (2023) introduce and analyze SNIPE for low-order neighborhood interference under Bernoulli assignment.
- Our contribution gives the bounded-class minimax calibration for this known-graph, low-order Bernoulli setting.
Main Result I
informal · Theorem T-1 Over the coefficient-mass class, the minimax mean squared error is between constant multiples of the exposed-binomial scale, and clipped SNIPE attains the upper bound.
Fix an interaction order β∈N and an assignment probability p∈R. Assume:
- (Order.) 1≤β.
- (Design probability.) 0<p<1.
Then there exist constants cβ,p,Cβ,p∈R such that 0<cβ,p≤Cβ,p. For every n,d∈N and B∈R satisfying 1≤n, d≤n, and 0≤B, with k⋆(d,β,p) as in Definition P-1 and Rn⋆(d,β,p,B) as in Definition P-8, the following hold: cβ,pB2min{1,nd(k⋆(d,β,p)d)}≤Rn⋆(d,β,p,B). Moreover, Rn⋆(d,β,p,B)≤(G,c)∈Mn,d,β(B)supEZ[(τnup−τn)2]≤Cβ,pB2min{1,nd(k⋆(d,β,p)d)}, where Mn,d,β(B) is the model class in Definition P-5 and τnup is SNIPE projected to [−B,B]. The unprojected SNIPE estimator also satisfies (G,c)∈Mn,d,β(B)supEZ[(τnSNIPE−τn)2]≤Cβ,pB2nd(k⋆(d,β,p)d). For every (G,c)∈Mn,d,β(B) and unit i, writing Ni={j:(j,i)∈G}, r=1∑min{β,∣Ni∣}(r∣Ni∣){p(1−p)}rΔr(p)2≤Ad, where Ad=r=1∑min{β,d}(rd){p(1−p)}rΔr(p)2. For every (G,c)∈Mn,d,β(B), every r∈N, and every unit i, if 1≤r, then ℓ∈Vn∑(r∣Ni∩Nℓ∣)=S⊆Ni∣S∣=r∑#{ℓ∈Vn:S⊆Nℓ}≤d(r∣Ni∣)≤d(rd). Finally, if 0<B and 1≤d, let m=⌊dn⌋,ρ=nmd,δ=δ(n,d,β,B,p). For every U:{1,…,m}→R satisfying ∣Ub∣≤B/2 for all b, there are models M+ and M− in Mn,d,β(B) whose graph is the complete d-block graph, whose coefficient schedules are the corresponding block schedules with signs +1 and −1, and whose total treatment effects obey τn(M+)=ρδ,τn(M−)=−ρδ. The two block-prior densities with signs +1 and −1, relative to the block dominating measure, satisfy H2(Π+,Π−)≤B2Ad4π2mδ2. The active fraction and block energy satisfy 21≤ρ≤1,mAd=ρdAd/n.
Reading the Rate
- The coefficient-mass frontier has scale B2 times a design difficulty term.
- The term Ad is local: it comes from one complete d-block.
- The extra d is global: it counts possible overlap among neighborhoods.
- The exposed-binomial form replaces Ad by the number of visible interaction subsets at order k⋆(d,β,p).
- In the running example, more local spillover links raise error through both more local interactions and more shared assignment coordinates.
Main Result II
informal · Theorem T-3 The uniformly bounded-outcome class has the same minimax degree dependence as the coefficient-mass class, and its clipped SNIPE estimator attains the rate up to constants depending only on (β,p).
Fix an interaction order β≥1 and a treatment probability p∈(0,1). Then there are constants cβ,p and Cβ,p such that 0<cβ,p≤Cβ,p and the following statements hold for every n,d∈N, every B∈R, and every finite design D on {0,1}Vn satisfying the itemized conditions:
- (Population and degree.) The population has size n≥1, Vn={1,…,n}, and the degree index satisfies d≤n.
- (Radius.) The radius satisfies B≥0.
- (Design.) The design D is the product Bernoulli design with common treatment probability p, as in Assumption A-1.
Let Ad=r=1∑βˉd(rd){p(1−p)}rΔr(p)2, with βˉd and k⋆(d,β,p) as in Definition P-1. The coefficient-mass model Mn,d,β(B) of Definition P-5 is contained in the uniformly bounded-outcome model Mn,d,β∞(B) of Definition P-17. If B>0 and d≥1, this inclusion is strict: some graph and bounded-outcome coefficient schedule in Mn,d,β∞(B) has no realization with the same graph and coefficient schedule in Mn,d,β(B). The minimax risks of Definition P-8 satisfy cβ,pB2min{1,ndAd}≤Rn,ℓ1⋆(d,β,p,B)=Rn⋆(d,β,p,B)≤Rn,∞⋆(d,β,p,B). For the bounded-outcome clipped SNIPE estimator τn,∞up of Definition P-19, Rn,∞⋆(d,β,p,B)≤(G,c)∈Mn,d,β∞(B)supED[(τn,∞up−τn(G,c))2]≤Cβ,pB2min{1,ndAd}. The coefficient-class clipped SNIPE estimator τnup also satisfies (G,c)∈Mn,d,β(B)supED[(τnup−τn(G,c))2]≤Cβ,pB2min{1,ndAd}. For every (G,c)∈Mn,d,β(B), the unprojected SNIPE estimator τnSNIPE is D-unbiased for τn(G,c). The same D-unbiasedness holds for every (G,c)∈Mn,d,β∞(B). Its worst-case mean squared error obeys (G,c)∈Mn,d,β(B)supED[(τnSNIPE−τn(G,c))2]≤nB2dAd, and (G,c)∈Mn,d,β∞(B)supED[(τnSNIPE−τn(G,c))2]≤nB2dAd. For every unit i, on both Mn,d,β(B) and Mn,d,β∞(B), the local score energy is at most Ad. The complete-block energy is comparable to the exposed binomial term: cβ,pd(k⋆(d,β,p)d)≤dAd≤Cβ,pd(k⋆(d,β,p)d). If d≥1 and d∣n, let m=n/d and let the graph be the disjoint union of m complete directed d-blocks, including loops. Then canonical unprojected SNIPE has exact worst-case risk on the fixed block graph and globally on both classes: Mn,d,β(B) on the fixed block graphsupED[(τnSNIPE−τn)2]=mB2Ad, Mn,d,β∞(B) on the fixed block graphsupED[(τnSNIPE−τn)2]=mB2Ad, and (G,c)∈Mn,d,β(B)supED[(τnSNIPE−τn(G,c))2]=(G,c)∈Mn,d,β∞(B)supED[(τnSNIPE−τn(G,c))2]=mB2Ad=nB2dAd. If B>0 and d≥1, put m=⌊n/d⌋,ρ=nmd,δ=δ(n,d,β,B,p) as in def:block-family. For every vector U=(Ub)b=1m with ∣Ub∣≤B/2 for all b, there are two coefficient-mass models on the block graph, with signs +1 and −1, whose coefficient schedules are the corresponding block schedules and whose total treatment effects are τn+=ρδ,τn−=−ρδ. For the two associated block priors Π+ and Π−, H2(Π+,Π−)≤B2Ad4π2mδ2, and the active share satisfies 21≤ρ≤1,mAd=ρdAd/n.
Complete Blocks
- Complete directed d-blocks are the hardest local graph shape used in the lower bound.
- Inside a block, every active unit has the full d-coordinate neighborhood.
- The least-favourable construction perturbs coefficients along the normalized block representer.
- The two signed perturbations separate the total effect while keeping the induced laws close.
- When d∣n, the same blocks give an exact worst-case risk for unprojected SNIPE.
Local Linear Benchmark
informal · Theorem T-2 On fixed complete directed block graphs, the minimax risk over block-local design-unbiased linear estimators is exactly B2Adt/mt.
Fix an integer β, a common Bernoulli treatment probability p, and a radius B. Suppose that:
- (Smoothness order.) β≥1.
- (Assignment probability.) p∈(0,1).
- (Radius.) B>0.
- (Block sequence.) For each index t, nt and dt are positive integers with dt∣nt, and mt:=dtnt.
- (Complete-block graph.) For each t, Gt is the directed graph on Vnt in which j→i exactly when j and i are active units in the same quotient class after division by dt; equivalently, the active units form complete directed blocks with self-loops and inactive units are isolated.
- (Assignment design.) The assignment design Dt is the product Bernoulli design with common probability p, as in Assumption A-1.
Define the complete-block score energy by Ad:=r=1∑βˉd(rd){p(1−p)}rΔr(p)2. Then, for every t, Rtloc,lin=mtB2Adt=ntB2dtAdt. For local linear weights w∈Etloc,lin, put ZS:=∏j∈SZj. For each active block Vb, define Ψb,t(w):=(εi,Si)i∈Vbεi∈{−1,1}, Si⊆Vb, ∣Si∣≤βˉdtmaxEZ(i∈Vb∑εi{wi,t(Zb(i))ZSi−1{Si=∅}})2. For every t and every w∈Etloc,lin, c∈Mt(Gt)supEZ[(τw,t−τnt)2]=nt2B2b=1∑mtΨb,t(w), and, for every active block Vb, dt2Adt≤Ψb,t(w). For any sequence wt∈Etloc,lin, B2Adt/mtsupc∈Mt(Gt)EZ[(τwt,t−τnt)2]⟶1 if and only if mtdt2Adt1b=1∑mt{Ψb,t(wt)−dt2Adt}⟶0. Moreover, the representer condition ntAdt1i∈Vnt∑EZ[{wi,t(Zb(i))−gdt(Zb(i))}2]⟶0 implies B2Adt/mtsupc∈Mt(Gt)EZ[(τwt,t−τnt)2]⟶1. If dt→∞, then there exists a sequence wt∈Etloc,lin such that B2Adt/mtsupc∈Mt(Gt)EZ[(τwt,t−τnt)2]⟶1, and, for all sufficiently large t, ntAdt1i∈Vnt∑EZ[{wi,t(Zb(i))−gdt(Zb(i))}2]=2. For every permutation π:Vnt→Vnt that preserves block membership, meaning b(π(i))=b(i) for every i, the corresponding relabeled normalized average squared distance from the complete-block SNIPE score is also equal to 2 for all sufficiently large t.
Fair Coin
informal · Theorem T-4 For p=1/2, even-order Bernoulli contrasts vanish, and first-order interference has minimax risk at most and at least constant multiples of B2min{1,d2/n}.
For the fair-coin design p=1/2, the following two conclusions hold.
- (Exact fair-coin contrasts.) For every n,d,β∈N and B∈R with n≥1, d≥1, d≤n, β≥1, and B≥0, the Bernoulli contrast coefficients satisfy, for every r≥1, Δr(1/2)={21−r,0,r odd,r even. Consequently the complete-block score energy at interaction order β is Ad=41≤r≤βˉdr odd∑(rd),βˉd=min{β,d}, and the exposed order k⋆(d,β,1/2) from Definition P-1 is the largest odd integer at most βˉd, with value 0 when no such odd integer exists.
- (First-order frontier.) There exist constants clower,cupper∈R with 0<clower≤cupper such that, for every n,d∈N and B∈R with n≥1, d≥1, d≤n, and B≥0, the order-one energy is Ad=4d, and the minimax risks of Definition P-8 satisfy clowerB2min{1,nd2}≤Rn⋆(d,1,1/2,B), Rn⋆(d,1,1/2,B)=Rn,ℓ1⋆(d,1,1/2,B)≤Rn,∞⋆(d,1,1/2,B)≤cupperB2min{1,nd2}. If additionally d∣n, then the unprojected SNIPE estimator τnSNIPE has exact worst-case mean squared error M∈Mn,d,1(B)supE1/2,M[(τnSNIPE−τn)2]=n4B2d2, and, over the uniformly bounded-outcome class, M∈Mn,d,1∞(B)supE1/2,M[(τnSNIPE−τn)2]=n4B2d2.
Proof Sketch
- Upper bound: SNIPE is design-unbiased because centered Bernoulli monomials are orthogonal across orders.
- Variance bound: covariance terms appear only when neighborhoods share assignment coordinates.
- Overlap count: bounded out-degree turns each order-r overlap into at most d(rd) shared terms.
- Lower bound: complete blocks align neighborhoods so the block representer creates the hardest local contrast.
- Testing step: two signed block priors keep the observed-data laws close while moving τn apart.
- The same Ad appears in the estimator variance and in the lower-bound affinity.
Takeaways
- We characterize the finite-population minimax mean squared error for known bounded-degree, low-order polynomial network interference under Bernoulli assignment.
- The frontier is controlled by local block energy Ad, exposed order k⋆(d,β,p), and one out-degree overlap charge d.
- Clipped SNIPE attains the bounded-class minimax rate over both coefficient-mass and uniformly bounded-outcome envelopes.
- Complete directed blocks calibrate the lower bound, the exact unprojected SNIPE risk, and the local linear benchmark.
- For fair coins and first-order interference, the frontier specializes to B2min{1,d2/n} up to constants.