CausalSmith · seminar slides
Graph-Adaptive Bernoulli Design
We choose heterogeneous Bernoulli treatment probabilities from the bipartite graph, then use the same graph-only criterion for design and conservative inference on the all-treated-versus-all-control effect.
slides for Graph-Adaptive Bernoulli Design for Bipartite Interference
Overview
- In bipartite experiments, interventions are assigned on In, while outcomes are measured on On.
- Each outcome sees only its intervention neighborhood Ni(Gn).
- We choose independent Bernoulli probabilities pk, one per intervention unit.
- The target is τn, the finite-population mean contrast between all-treated and all-control neighborhood outcomes.
- The design criterion is a computable graph envelope for the Hájek linearization variance.
- The payoffs are an optimal feasible design, asymptotic normality, and conservative Wald intervals.
Motivation
- Think of ads assigned to advertisers and outcomes measured on users.
- A user may be adjacent to several advertisers, so treatment exposure is a neighborhood event.
- Homogeneous Bernoulli assignment treats every advertiser with the same probability.
- The graph can make some intervention units much more important for exposure overlap than others.
- A fixed expected-treatment budget asks: where should probability mass go?
- The design should be chosen before outcomes are observed.
Related Literature
- We work in the design-based tradition of Neyman (1923), Horvitz and Thompson (1952), and Hájek (1964).
- Interference estimands and exposure mappings build on Hudgens and Halloran (2008), Liu and Hudgens (2014), and Aronow and Samii (2017).
- Network and bipartite designs include Zigler and Papadogeorgou (2018), Chattopadhyay et al. (2023), and Lu et al. (2025).
- Clustered approaches such as Ugander and Yin (2020) and Brennan et al. (2022) change assignment dependence.
- Our design keeps independent assignment and adapts the marginal probabilities to the graph.
Setup
- In is the set of intervention units, with size mn.
- On is the set of outcome units, with size n.
- Gn is the known bipartite graph.
- Ni(Gn) is outcome i's intervention neighborhood.
- di=∣Ni(Gn)∣ measures outcome-side exposure complexity.
- sk measures intervention-side incidence, the number of outcomes adjacent to intervention k.
For every i∈On and every z,z′∈{0,1}mn, zNi(Gn)=zNi(Gn)′⟹Yi(zNi(Gn))=Yi(zNi(Gn)′).
Assignment Design
- We use independent Bernoulli assignment with heterogeneous probabilities pk.
- The positivity floor ϵ keeps exposure probabilities stable.
- The budget Bn fixes the expected number of treated intervention units.
- Feasible designs reallocate treatment probability inside a probability box while preserving total intensity.
For every k∈In, Zk is Bernoulli with success probability pk, and the collection {Zk:k∈In} is mutually independent.
For every k∈In, ϵ≤pk≤1−ϵ.
k∈In∑pk=Bn.
Estimation Target
- Yi1 is outcome i's all-treated neighborhood potential outcome.
- Yi0 is outcome i's all-control neighborhood potential outcome.
- μ1 and μ0 average these quantities over On.
- τn=μ1−μ0 is the finite-population estimand.
- The Hájek estimator normalizes inverse-probability weighted all-treated and all-control exposure means.
Define τH(p)=1{D1(p,Z)>0}D1(p,Z)i∈On∑πi1(p)Ti(Z)Yiobs−1{D0(p,Z)>0}D0(p,Z)i∈On∑πi0(p)Ci(Z)Yiobs.
Graph Envelope
- The linearization summand ηi(p,Z) captures the first-order contribution of outcome i.
- Pairs of outcomes matter when their intervention neighborhoods overlap.
- The graph envelope replaces unknown outcome contrasts with the bounded-outcome worst case.
- It is known at design time from Gn and p.
Define Venv(Gn,p)=n4i,j∈On∑{rij1(Gn,p)+rij0(Gn,p)+2rij10(Gn)}.
informal · Theorem T-2 Under independent heterogeneous Bernoulli assignment and bounded potential outcomes, the linearization variance scale is at most the graph envelope.
Homogeneous Benchmark
- Homogeneous Bernoulli assignment is the special case pk=p for all intervention units.
- Then the same-exposure covariance loads depend on shared-neighborhood size.
- This benchmark connects the heterogeneous analysis to the existing homogeneous bipartite framework.
informal · Theorem T-1 With a constant Bernoulli probability, the variance representation reduces to overlap-count covariance loads and the corresponding homogeneous variance formula.
Optimal Design
- We choose p by minimizing Venv(Gn,p) over the positivity-constrained budget set.
- The objective is convex on the feasible design class.
- The optimizer pn∗(Gn) is computable through standard convex optimization.
- The KKT conditions say that interior intervention units equalize the envelope gradient score up to the budget multiplier.
Let Gn be a bipartite experiment with intervention-unit set In, and let ϵ,Bn∈R. Suppose that
- (Positivity margin.) 0<ϵ<1/2;
- (Feasible budget.) mnϵ≤Bn≤mn(1−ϵ).
Then Pn,Bn,ϵ is nonempty, compact, and convex, and p↦Venv(Gn,p) is convex on Pn,Bn,ϵ. Moreover, there exists a minimizer pn∗(Gn)∈Pn,Bn,ϵ such that Venv(Gn,pn∗(Gn))≤Venv(Gn,q)for every q∈Pn,Bn,ϵ. For every such minimizer pn∗(Gn), there exist λn∈R and functions ν⋅,n+,ν⋅,n−:In→R such that, for every k∈In, νk,n+≥0,νk,n−≥0,gk(Gn,pn∗(Gn))=λn−νk,n++νk,n−, and νk,n+((pn∗(Gn))k−(1−ϵ))=0,νk,n−(ϵ−(pn∗(Gn))k)=0.
Key Idea
- The naive homogeneous rule assigns probability by capacity alone.
- The envelope score asks how changing pk affects all overlapping outcome pairs involving intervention k.
- Moving probability from a high-score coordinate to a low-score coordinate lowers the envelope when the score spread is positive.
- The quantitative gain is controlled by the score spread Δg, the feasible movement allowed by ϵ, and the directional modulus Lab.
- In singleton-neighborhood graphs, the score is proportional to sk2((1−ρ)−2−ρ−2).
Main Result
informal · Theorem T-7 Under an admissible budget with ϵ<ρ<1−ϵ and ρ=1/2, unequal homogeneous-point gradient scores imply a strictly smaller envelope at every envelope-optimal heterogeneous design.
Let Gn be a bipartite experiment with mn=∣In∣>0, and let ϵ∈(0,1/2). Suppose that:
- (Admissible budget.) mnϵ≤Bn≤mn(1−ϵ).
- (Homogeneous rate.) ρ=Bn/mn, with ϵ<ρ<1−ϵ and ρ=1/2.
- (Homogeneous design.) pkhom=ρ for every k∈In.
Then all of the following hold:
- If there exist a,b∈In such that ga(Gn,phom)=gb(Gn,phom), then phom is not a minimizer of Venv(Gn,⋅) over Pn,Bn,ϵ. Moreover, there exist a,b∈In attaining, respectively, the maximum and minimum homogeneous-point gradient scores, such that Δg:=ga(Gn,phom)−gb(Gn,phom)>0. For every pn∗(Gn)∈argminp∈Pn,Bn,ϵVenv(Gn,p), pn∗(Gn)=phom,Venv(Gn,pn∗(Gn))<Venv(Gn,phom), and Venv(Gn,phom)−Venv(Gn,pn∗(Gn))≥2Δg{min{ρ−ϵ,1−ϵ−ρ},min{min{ρ−ϵ,1−ϵ−ρ},Δg/Lab},Lab=0,Lab=0, where Lab is the directional modulus along eb−ea.
- If ∣Ni(Gn)∣=1 for every i∈On, then, for every k∈In, gk(Gn,phom)=n−1sk2((1−ρ)−2−ρ−2).
- If ∣Ni(Gn)∣=1 for every i∈On and there exist a,b∈In such that sa2=sb2, then the preceding non-homogeneity, strict-improvement, and gap conclusions hold.
Inference Guarantees
- For inference, the relevant asymptotic regime has bounded outcomes, bounded outcome degree, bounded overlap dependency, uniform positivity, and nondegenerate variance.
- Bounded outcome degree controls exposure weights.
- Bounded overlap dependency gives a sparse dependency graph for the linearized summands.
- The Hájek estimator is asymptotically equivalent to its linearization and then normal after scaling.
- The same envelope used for design also supplies the conservative variance scale.
- The guarantee is design based: potential outcomes are fixed, and probability is over assignment.
Consider a sequence of bipartite experiments indexed by n. Suppose:
- (Outcome indexing.) For all sufficiently large n, ∣On∣=n.
- (Assignment and interference.) Assumption A-2 and Assumption A-1 hold at every n for the assignment design Dn and probabilities pn.
- (Outcome and graph regularity.) Assumption A-5, Assumption A-6, and Assumption A-7 hold at every n, with constants dˉ and Dˉ, respectively.
- (Feasibility and optimality.) For every n, pn∈Pn,Bn,ϵn as in Definition P-1, and pn=pn∗(Gn) as in Definition P-7.
- (Uniform positivity.) There exists ϵ0>0 such that ϵ0≤ϵn for all sufficiently large n.
- (Variance.) Assumption A-8 holds for σGn,pn2(Y) as in Definition P-5.
Then, for every δ>0, DnPr(n{τH(pn∗(Gn))−τn}−n−1/2i∈On∑ηi(pn∗(Gn),Z)≥δ)⟶0, and, for every s∈R, DnPrσGn,pn∗(Gn)2(Y)n{τH(pn∗(Gn))−τn}≤s⟶Pr{N(0,1)≤s}.
For a sequence of bipartite experiments Gn with outcome sets On, finite assignment designs, probability vectors pn, positivity margins ϵn, and budgets Bn, suppose:
- (Outcome indexing.) ∣On∣=n for all sufficiently large n.
- (Assignment law.) The assignment design satisfies Assumption A-2 with 0≤pn,k≤1 for every n and k∈In.
- (Interference and boundedness.) Assumption A-1, Assumption A-5, Assumption A-6, and Assumption A-7 hold with constants dˉ and Dˉ.
- (Feasibility and optimality.) For every n, pn is a feasible design in the sense of Definition P-1, ϵn∈(0,1/2), and pn=pn∗(Gn) in the sense of Definition P-7.
- (Uniform positivity.) There exists ϵ0>0 such that ϵ0≤ϵn for all sufficiently large n.
- (Nondegenerate variance.) Assumption A-8 holds for σGn,pn2(Y).
- (Wald critical value.) αcov∈(0,1), z1−αcov/2≥0, and Φ(z1−αcov/2)=1−2αcov.
Then, for every n, σGn,pn2(Y)≤Vcons(Gn,pn), where σGn,pn2(Y) and Vcons(Gn,pn) are as in Definition P-5 and Definition P-9, respectively; moreover, 1−αcov≤n→∞liminfpnPr∣τn−τH(pn)∣≤z1−αcov/2nVcons(Gn,pn).
Surrogate Design
- The exact envelope couples probabilities across shared neighborhoods.
- The surrogate replaces that coupled objective with additive weights hk(Gn).
- Mechanism: each intervention unit receives a graph-derived weight and minimizes hk(Gn){pk−1+(1−pk)−1} inside the shared budget.
- Under bounded outcome degree, this separable design has a uniform envelope approximation certificate.
informal · Theorem T-8 With admissible ϵ, bounded outcome degree dˉ, and an admissible budget, the surrogate approximation ratio is at most max{1,ϵ−(dˉ−1)}.
For a bipartite experiment on Gn, suppose:
- (Admissible floor.) 0<ϵ<1/2.
- (Bounded outcome degree.) Assumption A-6 holds with bound dˉ.
- (Admissible budget.) mnϵ≤Bn≤mn(1−ϵ).
Then, for every p∈Pn,Bn,ϵ of Definition P-1, k∈In∑hk(Gn){pk−1+(1−pk)−1}≤4Venv(Gn,p)≤max{1,ϵ−(dˉ−1)}k∈In∑hk(Gn){pk−1+(1−pk)−1}. Moreover, the approximation ratio of Definition P-11 satisfies αcert(Gn)≤max{1,ϵ−(dˉ−1)}.
Surrogate Scope
- The bounded-degree condition is the structural reason the surrogate tracks the full envelope.
- Intervention-side degree summaries alone miss higher-order shared-neighborhood patterns.
- The unbounded-degree construction gives sequences where the surrogate approximation ratio diverges despite degree-dispersion and h-weight-ratio controls.
informal · Theorem T-6 For every admissible ϵ, dispersion constant, and h-weight ratio constant, there are unbounded-degree sequences with approximation ratio tending to infinity.
For every ϵ∈(0,1/2), cdisp>0, and Cdisp≥1, there exist sequences of finite intervention-unit sets In, finite outcome-unit sets On, finite bipartite experiments Gn, and budgets Bn such that, for every n,
- (Admissible budget.) With mn=∣In∣, mnϵ≤Bn≤mn(1−ϵ).
- (Positive energy.) 0<k∈In∑sk2.
Moreover, for all sufficiently large n,
- (Degree dispersion.) For every k∈In, sk2≤cdispl∈In∑sl2.
- (h-weight ratio.) For every k,l∈In, hl(Gn)>0 ⟹ hk(Gn)≤Cdisphl(Gn).
Finally, the approximation ratio of Definition P-11 satisfies αcert(Gn)⟶∞.
Proof Sketch
- First, condition on the graph and treat potential outcomes as fixed.
- Exposure indicators for two outcomes are independent when their neighborhoods are disjoint.
- Shared neighborhoods produce the pairwise covariance loads in the envelope.
- Bounded outcomes turn those loads into a uniform variance upper bound.
- Convexity follows from reciprocal-product terms over the positivity box.
- The central limit theorem follows from bounded summands and bounded dependency degree.
informal · Lemma L-2 Centered, uniformly bounded summands with bounded dependency degree and linear variance growth are asymptotically normal after variance scaling.
Design Workflow
- Fix Bn from treatment capacity and choose an admissible positivity floor.
- Audit di, sk, and outcome-overlap degrees.
- Compare homogeneous assignment, the exact envelope minimizer, and the surrogate.
- Report the envelope value, exposure support diagnostics, KKT residuals, and surrogate ratio.
- Interpret at least one result through the graph diagnostics before randomization.
Takeaways
- We construct graph-adaptive independent Bernoulli designs for bipartite interference experiments.
- The variance envelope is observable before assignment and valid uniformly over bounded potential-outcome schedules.
- The feasible design problem is convex and has an optimality characterization.
- The envelope-optimal design supports asymptotic Hájek normality and conservative Wald coverage under bounded local dependence.
- The surrogate gives a separable approximation with a bounded-degree certificate.