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.

Overview

  • We study the all-treated-versus-all-control effect τn\tau_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 dd.
  • The treatment design is independent Bernoulli with common probability pp.
  • The minimax mean squared error is governed by one local energy AdA_d and one graph-overlap charge dd.

informal · Theorem T-1 Under fixed β1\beta\ge1 and 0<p<10<p<1, clipped SNIPE attains the coefficient-mass minimax risk up to constants depending only on (β,p)(\beta,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 dd 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 dd relevant neighbors and can affect at most dd outcomes.
  • The estimand asks for the average change between turning treatment on for everyone and turning it off for everyone.

Setup

  • VnV_n is the finite population, and ZjZ_j is unit jj's Bernoulli treatment assignment.
  • NiN_i is the directed interference neighborhood of unit ii.
  • Yi(z)Y_i(z) is a polynomial in assignments inside NiN_i, with interaction order at most β\beta.
  • BB is the radius of the bounded coefficient-mass or bounded-outcome class.
  • τn\tau_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)p\in(0,1).
  • Bounded interference degree: every neighborhood has size at most dd, and every assignment coordinate enters at most dd neighborhoods.
  • Low-order outcomes: only monomials of degree at most β\beta enter each potential outcome.
  • Coefficient-mass envelope: each unit's polynomial coefficients have total absolute mass at most BB.
  • In the running example, dd is the maximum measured local spillover degree, and β\beta 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.
Observed outcomes Y_i obs Known neighborhoods exposed order Centered scores Bernoulli monomials centered score Score energy A_d design moment d-coordinate score Weighted average SNIPE estimate estimates τ_n Projection clip target range [-B,B] or [-2B,2B] MSE question improve MSE scale
illustrative Box-and-arrow schematic from known neighborhoods and observed outcomes through centered Bernoulli monomial scores and the score energy AdA_d to the weighted SNIPE average, clipping, and the worst-case MSE question.

Key Idea

  • The local difficulty is summarized by the complete-block score energy AdA_d.
  • AdA_d measures how much Bernoulli variation is needed to extract the all-treated-versus-all-control contrast inside one dd-unit neighborhood.
  • The global difficulty adds one graph charge: an assignment coordinate can appear in up to dd unit-level scores.
  • The exposed order k(d,β,p)k_\star(d,\beta,p) is the largest interaction order with nonzero Bernoulli contrast.
  • For fixed (β,p)(\beta,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.

Theorem T-1 (Degree frontier bounds)

Fix an interaction order βN\beta\in\mathbb N and an assignment probability pRp\in\mathbb R. Assume:

  • (Order.) 1β1\le \beta.
  • (Design probability.) 0<p<10<p<1.

Then there exist constants cβ,p,Cβ,pRc_{\beta,p},C_{\beta,p}\in\mathbb R such that 0<cβ,pCβ,p. 0<c_{\beta,p}\le C_{\beta,p}. For every n,dNn,d\in\mathbb N and BRB\in\mathbb R satisfying 1n1\le n, dnd\le n, and 0B0\le B, with k(d,β,p)k_\star(d,\beta,p) as in Definition P-1 and Rn(d,β,p,B)R_n^\star(d,\beta,p,B) as in Definition P-8, the following hold: cβ,pB2min ⁣{1,d(dk(d,β,p))n}Rn(d,β,p,B). c_{\beta,p}B^2 \min\!\left\{1,\frac{d\binom{d}{k_\star(d,\beta,p)}}{n}\right\} \le R_n^\star(d,\beta,p,B). Moreover, Rn(d,β,p,B)sup(G,c)Mn,d,β(B)EZ ⁣[(τ^nupτn)2]Cβ,pB2min ⁣{1,d(dk(d,β,p))n}, R_n^\star(d,\beta,p,B) \le \sup_{(G,c)\in\mathcal M_{n,d,\beta}(B)} \mathbb E_Z\!\left[ \left(\widehat\tau_n^{\mathrm{up}}-\tau_n\right)^2 \right] \le C_{\beta,p}B^2 \min\!\left\{1,\frac{d\binom{d}{k_\star(d,\beta,p)}}{n}\right\}, where Mn,d,β(B)\mathcal M_{n,d,\beta}(B) is the model class in Definition P-5 and τ^nup\widehat\tau_n^{\mathrm{up}} is SNIPE projected to [B,B][-B,B]. The unprojected SNIPE estimator also satisfies sup(G,c)Mn,d,β(B)EZ ⁣[(τ^nSNIPEτn)2]Cβ,pB2d(dk(d,β,p))n. \sup_{(G,c)\in\mathcal M_{n,d,\beta}(B)} \mathbb E_Z\!\left[ \left(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n\right)^2 \right] \le C_{\beta,p}B^2 \frac{d\binom{d}{k_\star(d,\beta,p)}}{n}. For every (G,c)Mn,d,β(B)(G,c)\in\mathcal M_{n,d,\beta}(B) and unit ii, writing Ni={j:(j,i)G}N_i=\{j:(j,i)\in G\}, r=1min{β,Ni}(Nir)Δr(p)2{p(1p)}rAd, \sum_{r=1}^{\min\{\beta,|N_i|\}} \binom{|N_i|}{r} \frac{\Delta_r(p)^2}{\{p(1-p)\}^r} \le A_d, where Ad=r=1min{β,d}(dr)Δr(p)2{p(1p)}r. A_d = \sum_{r=1}^{\min\{\beta,d\}} \binom{d}{r} \frac{\Delta_r(p)^2}{\{p(1-p)\}^r}. For every (G,c)Mn,d,β(B)(G,c)\in\mathcal M_{n,d,\beta}(B), every rNr\in\mathbb N, and every unit ii, if 1r1\le r, then Vn(NiNr)=SNiS=r#{Vn:SN}d(Nir)d(dr). \sum_{\ell\in V_n} \binom{|N_i\cap N_\ell|}{r} = \sum_{\substack{S\subseteq N_i\\ |S|=r}} \#\{\ell\in V_n:S\subseteq N_\ell\} \le d\binom{|N_i|}{r} \le d\binom{d}{r}. Finally, if 0<B0<B and 1d1\le d, let m=nd,ρ=mdn,δ=δ(n,d,β,B,p). m=\left\lfloor\frac{n}{d}\right\rfloor, \qquad \rho=\frac{md}{n}, \qquad \delta=\delta(n,d,\beta,B,p). For every U:{1,,m}RU:\{1,\ldots,m\}\to\mathbb R satisfying UbB/2|U_b|\le B/2 for all bb, there are models M+M_+ and MM_- in Mn,d,β(B)\mathcal M_{n,d,\beta}(B) whose graph is the complete dd-block graph, whose coefficient schedules are the corresponding block schedules with signs +1+1 and 1-1, and whose total treatment effects obey τn(M+)=ρδ,τn(M)=ρδ. \tau_n(M_+)=\rho\delta, \qquad \tau_n(M_-)=-\rho\delta. The two block-prior densities with signs +1+1 and 1-1, relative to the block dominating measure, satisfy H2(Π+,Π)4π2mδ2B2Ad. H^2(\Pi_+,\Pi_-) \le \frac{4\pi^2m\delta^2}{B^2A_d}. The active fraction and block energy satisfy 12ρ1,Adm=dAd/nρ. \frac12\le \rho\le 1, \qquad \frac{A_d}{m} = \frac{dA_d/n}{\rho}.

Reading the Rate

  • The coefficient-mass frontier has scale B2B^2 times a design difficulty term.
  • The term AdA_d is local: it comes from one complete dd-block.
  • The extra dd is global: it counts possible overlap among neighborhoods.
  • The exposed-binomial form replaces AdA_d by the number of visible interaction subsets at order k(d,β,p)k_\star(d,\beta,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)(\beta,p).

Theorem T-3 (Bounded-outcome degree frontier)

Fix an interaction order β1\beta\ge 1 and a treatment probability p(0,1)p\in(0,1). Then there are constants cβ,pc_{\beta,p} and Cβ,pC_{\beta,p} such that 0<cβ,pCβ,p0<c_{\beta,p}\le C_{\beta,p} and the following statements hold for every n,dNn,d\in\mathbb N, every BRB\in\mathbb R, and every finite design DD on {0,1}Vn\{0,1\}^{V_n} satisfying the itemized conditions:

  • (Population and degree.) The population has size n1n\ge1, Vn={1,,n}V_n=\{1,\ldots,n\}, and the degree index satisfies dnd\le n.
  • (Radius.) The radius satisfies B0B\ge0.
  • (Design.) The design DD is the product Bernoulli design with common treatment probability pp, as in Assumption A-1.

Let Ad=r=1βˉd(dr)Δr(p)2{p(1p)}r, A_d = \sum_{r=1}^{\bar\beta_d} \binom{d}{r} \frac{\Delta_r(p)^2}{\{p(1-p)\}^r}, with βˉd\bar\beta_d and k(d,β,p)k_\star(d,\beta,p) as in Definition P-1. The coefficient-mass model Mn,d,β(B)\mathcal M_{n,d,\beta}(B) of Definition P-5 is contained in the uniformly bounded-outcome model Mn,d,β(B)\mathcal M_{n,d,\beta}^{\infty}(B) of Definition P-17. If B>0B>0 and d1d\ge1, this inclusion is strict: some graph and bounded-outcome coefficient schedule in Mn,d,β(B)\mathcal M_{n,d,\beta}^{\infty}(B) has no realization with the same graph and coefficient schedule in Mn,d,β(B)\mathcal M_{n,d,\beta}(B). The minimax risks of Definition P-8 satisfy cβ,pB2min ⁣{1,dAdn}Rn,1(d,β,p,B)=Rn(d,β,p,B)Rn,(d,β,p,B). c_{\beta,p} B^2 \min\!\left\{1,\frac{dA_d}{n}\right\} \le R_{n,\ell_1}^{\star}(d,\beta,p,B) = R_n^{\star}(d,\beta,p,B) \le R_{n,\infty}^{\star}(d,\beta,p,B). For the bounded-outcome clipped SNIPE estimator τ^n,up\widehat\tau_{n,\infty}^{\mathrm{up}} of Definition P-19, Rn,(d,β,p,B)sup(G,c)Mn,d,β(B)ED ⁣[(τ^n,upτn(G,c))2]Cβ,pB2min ⁣{1,dAdn}. R_{n,\infty}^{\star}(d,\beta,p,B) \le \sup_{(G,c)\in\mathcal M_{n,d,\beta}^{\infty}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_{n,\infty}^{\mathrm{up}}-\tau_n(G,c)\bigr)^2 \right] \le C_{\beta,p} B^2 \min\!\left\{1,\frac{dA_d}{n}\right\}. The coefficient-class clipped SNIPE estimator τ^nup\widehat\tau_n^{\mathrm{up}} also satisfies sup(G,c)Mn,d,β(B)ED ⁣[(τ^nupτn(G,c))2]Cβ,pB2min ⁣{1,dAdn}. \sup_{(G,c)\in\mathcal M_{n,d,\beta}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{up}}-\tau_n(G,c)\bigr)^2 \right] \le C_{\beta,p} B^2 \min\!\left\{1,\frac{dA_d}{n}\right\}. For every (G,c)Mn,d,β(B)(G,c)\in\mathcal M_{n,d,\beta}(B), the unprojected SNIPE estimator τ^nSNIPE\widehat\tau_n^{\mathrm{SNIPE}} is DD-unbiased for τn(G,c)\tau_n(G,c). The same DD-unbiasedness holds for every (G,c)Mn,d,β(B)(G,c)\in\mathcal M_{n,d,\beta}^{\infty}(B). Its worst-case mean squared error obeys sup(G,c)Mn,d,β(B)ED ⁣[(τ^nSNIPEτn(G,c))2]B2dAdn, \sup_{(G,c)\in\mathcal M_{n,d,\beta}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n(G,c)\bigr)^2 \right] \le \frac{B^2 d A_d}{n}, and sup(G,c)Mn,d,β(B)ED ⁣[(τ^nSNIPEτn(G,c))2]B2dAdn. \sup_{(G,c)\in\mathcal M_{n,d,\beta}^{\infty}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n(G,c)\bigr)^2 \right] \le \frac{B^2 d A_d}{n}. For every unit ii, on both Mn,d,β(B)\mathcal M_{n,d,\beta}(B) and Mn,d,β(B)\mathcal M_{n,d,\beta}^{\infty}(B), the local score energy is at most AdA_d. The complete-block energy is comparable to the exposed binomial term: cβ,pd(dk(d,β,p))dAdCβ,pd(dk(d,β,p)). c_{\beta,p}\, d\binom{d}{k_\star(d,\beta,p)} \le dA_d \le C_{\beta,p}\, d\binom{d}{k_\star(d,\beta,p)}. If d1d\ge1 and dnd\mid n, let m=n/dm=n/d and let the graph be the disjoint union of mm complete directed dd-blocks, including loops. Then canonical unprojected SNIPE has exact worst-case risk on the fixed block graph and globally on both classes: supMn,d,β(B) on the fixed block graphED ⁣[(τ^nSNIPEτn)2]=B2Adm, \sup_{\mathcal M_{n,d,\beta}(B)\text{ on the fixed block graph}} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n\bigr)^2 \right] = \frac{B^2A_d}{m}, supMn,d,β(B) on the fixed block graphED ⁣[(τ^nSNIPEτn)2]=B2Adm, \sup_{\mathcal M_{n,d,\beta}^{\infty}(B)\text{ on the fixed block graph}} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n\bigr)^2 \right] = \frac{B^2A_d}{m}, and sup(G,c)Mn,d,β(B)ED ⁣[(τ^nSNIPEτn(G,c))2]=sup(G,c)Mn,d,β(B)ED ⁣[(τ^nSNIPEτn(G,c))2]=B2Adm=B2dAdn. \sup_{(G,c)\in\mathcal M_{n,d,\beta}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n(G,c)\bigr)^2 \right] = \sup_{(G,c)\in\mathcal M_{n,d,\beta}^{\infty}(B)} \mathbb E_D\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n(G,c)\bigr)^2 \right] = \frac{B^2A_d}{m} = \frac{B^2dA_d}{n}. If B>0B>0 and d1d\ge1, put m=n/d,ρ=mdn,δ=δ(n,d,β,B,p)  as in def:block-family. m=\bigl\lfloor n/d\bigr\rfloor, \qquad \rho=\frac{md}{n}, \qquad \delta=\delta(n,d,\beta,B,p)\ \text{ as in \text{def:block-family}}. For every vector U=(Ub)b=1mU=(U_b)_{b=1}^m with UbB/2|U_b|\le B/2 for all bb, there are two coefficient-mass models on the block graph, with signs +1+1 and 1-1, whose coefficient schedules are the corresponding block schedules and whose total treatment effects are τn+=ρδ,τn=ρδ. \tau_n^{+}=\rho\delta, \qquad \tau_n^{-}=-\rho\delta. For the two associated block priors Π+\Pi_+ and Π\Pi_-, H2(Π+,Π)4π2mδ2B2Ad, H^2(\Pi_+,\Pi_-) \le \frac{4\pi^2 m\delta^2}{B^2A_d}, and the active share satisfies 12ρ1,Adm=dAd/nρ. \frac12\le \rho\le 1, \qquad \frac{A_d}{m} = \frac{dA_d/n}{\rho}.

Complete Blocks

  • Complete directed dd-blocks are the hardest local graph shape used in the lower bound.
  • Inside a block, every active unit has the full dd-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 dnd\mid n, the same blocks give an exact worst-case risk for unprojected SNIPE.
Complete blocks directed d-blocks hardest local shape Full neighborhood active units d coordinates Representer normalized block coefficient perturb Signed priors two perturbations Total effects separated Assignment laws kept close Exact risk d∣n unprojected SNIPE
illustrative Box-and-arrow schematic from complete directed blocks to representer perturbations, then signed priors, then separated total effects with close assignment laws.

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/mtB^2A_{d_t}/m_t.

Theorem T-2 (Sharp local linear representers)

Fix an integer β\beta, a common Bernoulli treatment probability pp, and a radius BB. Suppose that:

  • (Smoothness order.) β1\beta\ge 1.
  • (Assignment probability.) p(0,1)p\in(0,1).
  • (Radius.) B>0B>0.
  • (Block sequence.) For each index tt, ntn_t and dtd_t are positive integers with dtntd_t\mid n_t, and mt:=ntdt. m_t:=\frac{n_t}{d_t}.
  • (Complete-block graph.) For each tt, GtG_t is the directed graph on VntV_{n_t} in which jij\to i exactly when jj and ii are active units in the same quotient class after division by dtd_t; equivalently, the active units form complete directed blocks with self-loops and inactive units are isolated.
  • (Assignment design.) The assignment design DtD_t is the product Bernoulli design with common probability pp, as in Assumption A-1.

Define the complete-block score energy by Ad:=r=1βˉd(dr)Δr(p)2{p(1p)}r. A_d := \sum_{r=1}^{\bar\beta_d} \binom{d}{r}\frac{\Delta_r(p)^2}{\{p(1-p)\}^r}. Then, for every tt, Rtloc,lin=B2Adtmt=B2dtAdtnt. R_t^{\mathrm{loc,lin}} = \frac{B^2A_{d_t}}{m_t} = \frac{B^2d_tA_{d_t}}{n_t}. For local linear weights wEtloc,linw\in\mathcal E_t^{\mathrm{loc,lin}}, put ZS:=jSZjZ_S:=\prod_{j\in S}Z_j. For each active block VbV_b, define Ψb,t(w):=max(εi,Si)iVbεi{1,1}, SiVb, SiβˉdtEZ ⁣[(iVbεi{wi,t(Zb(i))ZSi1{Si}})2]. \Psi_{b,t}(w) := \max_{\substack{(\varepsilon_i,S_i)_{i\in V_b}\\ \varepsilon_i\in\{-1,1\},\ S_i\subseteq V_b,\ |S_i|\le \bar\beta_{d_t}}} \mathbb E_Z\!\left[ \left( \sum_{i\in V_b} \varepsilon_i \left\{ w_{i,t}(Z_{b(i)})Z_{S_i} - \mathbf 1\{S_i\ne\varnothing\} \right\} \right)^2 \right]. For every tt and every wEtloc,linw\in\mathcal E_t^{\mathrm{loc,lin}}, supcMt(Gt)EZ ⁣[(τ^w,tτnt)2]=B2nt2b=1mtΨb,t(w), \sup_{c\in\mathcal M_t(G_t)} \mathbb E_Z\!\left[(\widehat\tau_{w,t}-\tau_{n_t})^2\right] = \frac{B^2}{n_t^2}\sum_{b=1}^{m_t}\Psi_{b,t}(w), and, for every active block VbV_b, dt2AdtΨb,t(w). d_t^2A_{d_t}\le \Psi_{b,t}(w). For any sequence wtEtloc,linw_t\in\mathcal E_t^{\mathrm{loc,lin}}, supcMt(Gt)EZ ⁣[(τ^wt,tτnt)2]B2Adt/mt1 \frac{ \sup_{c\in\mathcal M_t(G_t)} \mathbb E_Z\!\left[(\widehat\tau_{w_t,t}-\tau_{n_t})^2\right] }{ B^2A_{d_t}/m_t } \longrightarrow 1 if and only if 1mtdt2Adtb=1mt{Ψb,t(wt)dt2Adt}0. \frac{1}{m_td_t^2A_{d_t}} \sum_{b=1}^{m_t} \left\{\Psi_{b,t}(w_t)-d_t^2A_{d_t}\right\} \longrightarrow 0. Moreover, the representer condition 1ntAdtiVntEZ ⁣[{wi,t(Zb(i))gdt(Zb(i))}2]0 \frac{1}{n_tA_{d_t}} \sum_{i\in V_{n_t}} \mathbb E_Z\!\left[ \left\{ w_{i,t}(Z_{b(i)})-g_{d_t}(Z_{b(i)}) \right\}^2 \right] \longrightarrow 0 implies supcMt(Gt)EZ ⁣[(τ^wt,tτnt)2]B2Adt/mt1. \frac{ \sup_{c\in\mathcal M_t(G_t)} \mathbb E_Z\!\left[(\widehat\tau_{w_t,t}-\tau_{n_t})^2\right] }{ B^2A_{d_t}/m_t } \longrightarrow 1. If dtd_t\to\infty, then there exists a sequence wtEtloc,linw_t\in\mathcal E_t^{\mathrm{loc,lin}} such that supcMt(Gt)EZ ⁣[(τ^wt,tτnt)2]B2Adt/mt1, \frac{ \sup_{c\in\mathcal M_t(G_t)} \mathbb E_Z\!\left[(\widehat\tau_{w_t,t}-\tau_{n_t})^2\right] }{ B^2A_{d_t}/m_t } \longrightarrow 1, and, for all sufficiently large tt, 1ntAdtiVntEZ ⁣[{wi,t(Zb(i))gdt(Zb(i))}2]=2. \frac{1}{n_tA_{d_t}} \sum_{i\in V_{n_t}} \mathbb E_Z\!\left[ \left\{ w_{i,t}(Z_{b(i)})-g_{d_t}(Z_{b(i)}) \right\}^2 \right] =2. For every permutation π:VntVnt\pi:V_{n_t}\to V_{n_t} that preserves block membership, meaning b(π(i))=b(i)b(\pi(i))=b(i) for every ii, the corresponding relabeled normalized average squared distance from the complete-block SNIPE score is also equal to 22 for all sufficiently large tt.

Fair Coin

informal · Theorem T-4 For p=1/2p=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}B^2\min\{1,d^2/n\}.

Theorem T-4 (Fair-coin energy frontier)

For the fair-coin design p=1/2p=1/2, the following two conclusions hold.

  • (Exact fair-coin contrasts.) For every n,d,βNn,d,\beta\in\mathbb N and BRB\in\mathbb R with n1n\ge 1, d1d\ge 1, dnd\le n, β1\beta\ge 1, and B0B\ge 0, the Bernoulli contrast coefficients satisfy, for every r1r\ge 1, Δr(1/2)={21r,r odd,0,r even. \Delta_r(1/2) = \begin{cases} 2^{1-r}, & r \text{ odd},\\ 0, & r \text{ even}. \end{cases} Consequently the complete-block score energy at interaction order β\beta is Ad=41rβˉdr odd(dr),βˉd=min{β,d}, A_d = 4\sum_{\substack{1\le r\le \bar\beta_d\\ r\ \mathrm{odd}}}\binom dr, \qquad \bar\beta_d=\min\{\beta,d\}, and the exposed order k(d,β,1/2)k_\star(d,\beta,1/2) from Definition P-1 is the largest odd integer at most βˉd\bar\beta_d, with value 00 when no such odd integer exists.
  • (First-order frontier.) There exist constants clower,cupperRc_{\mathrm{lower}},c_{\mathrm{upper}}\in\mathbb R with 0<clowercupper 0<c_{\mathrm{lower}}\le c_{\mathrm{upper}} such that, for every n,dNn,d\in\mathbb N and BRB\in\mathbb R with n1n\ge 1, d1d\ge 1, dnd\le n, and B0B\ge 0, the order-one energy is Ad=4d, A_d=4d, and the minimax risks of Definition P-8 satisfy clowerB2min ⁣{1,d2n}Rn(d,1,1/2,B), c_{\mathrm{lower}}B^2\min\!\left\{1,\frac{d^2}{n}\right\} \le R_n^\star(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,d2n}. R_n^\star(d,1,1/2,B) = R_{n,\ell_1}^\star(d,1,1/2,B) \le R_{n,\infty}^\star(d,1,1/2,B) \le c_{\mathrm{upper}}B^2\min\!\left\{1,\frac{d^2}{n}\right\}. If additionally dnd\mid n, then the unprojected SNIPE estimator τ^nSNIPE\widehat\tau_n^{\mathrm{SNIPE}} has exact worst-case mean squared error supMMn,d,1(B)E1/2,M ⁣[(τ^nSNIPEτn)2]=4B2d2n, \sup_{M\in\mathcal M_{n,d,1}(B)} \mathbb E_{1/2,M}\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n\bigr)^2 \right] = \frac{4B^2d^2}{n}, and, over the uniformly bounded-outcome class, supMMn,d,1(B)E1/2,M ⁣[(τ^nSNIPEτn)2]=4B2d2n. \sup_{M\in\mathcal M_{n,d,1}^{\infty}(B)} \mathbb E_{1/2,M}\!\left[ \bigl(\widehat\tau_n^{\mathrm{SNIPE}}-\tau_n\bigr)^2 \right] = \frac{4B^2d^2}{n}.

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-rr overlap into at most d(dr)d\binom d r 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\tau_n apart.
  • The same AdA_d 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 AdA_d, exposed order k(d,β,p)k_\star(d,\beta,p), and one out-degree overlap charge dd.
  • 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}B^2\min\{1,d^2/n\} up to constants.