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.

Overview

  • In bipartite experiments, interventions are assigned on InI_n, while outcomes are measured on OnO_n.
  • Each outcome sees only its intervention neighborhood Ni(Gn)N_i(G_n).
  • We choose independent Bernoulli probabilities pkp_k, one per intervention unit.
  • The target is τn\tau_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.
Iₙ intervention-unit set Oₙ outcome-unit set Gₙ known bipartite graph affects each outcome Nᵢ(Gₙ) intervention assignments enter outcome i Shared neighborhoods at least one intervention Outcome overlap induced graph statistically linked
illustrative Box-and-arrow schematic where intervention units InI_n and outcome units OnO_n feed the known bipartite graph GnG_n, whose intervention neighborhoods Ni(Gn)N_i(G_n) and shared neighborhoods induce the outcome-overlap graph.

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

  • InI_n is the set of intervention units, with size mnm_n.
  • OnO_n is the set of outcome units, with size nn.
  • GnG_n is the known bipartite graph.
  • Ni(Gn)N_i(G_n) is outcome ii's intervention neighborhood.
  • di=Ni(Gn)d_i=|N_i(G_n)| measures outcome-side exposure complexity.
  • sks_k measures intervention-side incidence, the number of outcomes adjacent to intervention kk.
Assumption A-1 (Bipartite interference restriction)

For every iOni\in O_n and every z,z{0,1}mnz,z'\in\{0,1\}^{m_n}, zNi(Gn)=zNi(Gn)Yi ⁣(zNi(Gn))=Yi ⁣(zNi(Gn)). z_{N_i(G_n)}=z'_{N_i(G_n)} \quad\Longrightarrow\quad Y_i\!\left(z_{N_i(G_n)}\right)=Y_i\!\left(z'_{N_i(G_n)}\right).

Assignment Design

  • We use independent Bernoulli assignment with heterogeneous probabilities pkp_k.
  • The positivity floor ϵ\epsilon keeps exposure probabilities stable.
  • The budget BnB_n fixes the expected number of treated intervention units.
  • Feasible designs reallocate treatment probability inside a probability box while preserving total intensity.
Assumption A-2 (Independent heterogeneous Bernoulli assignment)

For every kInk\in I_n, ZkZ_k is Bernoulli with success probability pkp_k, and the collection {Zk:kIn}\{Z_k:k\in I_n\} is mutually independent.

Assumption A-3 (Assignment positivity)

For every kInk\in I_n, ϵpk1ϵ. \epsilon\leq p_k\leq 1-\epsilon.

Assumption A-4 (Assignment budget balance)

kInpk=Bn. \sum_{k\in I_n}p_k=B_n.

Estimation Target

  • Yi1Y_i^1 is outcome ii's all-treated neighborhood potential outcome.
  • Yi0Y_i^0 is outcome ii's all-control neighborhood potential outcome.
  • μ1\mu_1 and μ0\mu_0 average these quantities over OnO_n.
  • τn=μ1μ0\tau_n=\mu_1-\mu_0 is the finite-population estimand.
  • The Hájek estimator normalizes inverse-probability weighted all-treated and all-control exposure means.
Definition P-3 (Hájek estimator $\widehat\tau_H(p)$)

Define τ^H(p)=1{D1(p,Z)>0}iOnTi(Z)Yiobsπi1(p)D1(p,Z)1{D0(p,Z)>0}iOnCi(Z)Yiobsπi0(p)D0(p,Z). \widehat\tau_H(p) = \mathbf 1\{D_1(p,Z)>0\} \frac{\displaystyle\sum_{i\in O_n}\frac{T_i(Z)Y_i^{obs}}{\pi_i^1(p)}}{D_1(p,Z)} - \mathbf 1\{D_0(p,Z)>0\} \frac{\displaystyle\sum_{i\in O_n}\frac{C_i(Z)Y_i^{obs}}{\pi_i^0(p)}}{D_0(p,Z)}.

Graph Envelope

  • The linearization summand ηi(p,Z)\eta_i(p,Z) captures the first-order contribution of outcome ii.
  • 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 GnG_n and pp.
Definition P-6 (Graph envelope $V_{\mathrm{env}}(G_n,p)$)

Define Venv(Gn,p)=4ni,jOn{rij1(Gn,p)+rij0(Gn,p)+2rij10(Gn)}. V_{\mathrm{env}}(G_n,p) = \frac{4}{n}\sum_{i,j\in O_n} \left\{ r_{ij}^1(G_n,p) + r_{ij}^0(G_n,p) + 2r_{ij}^{10}(G_n) \right\}.

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=pp_k=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 pp by minimizing Venv(Gn,p)V_{\mathrm{env}}(G_n,p) over the positivity-constrained budget set.
  • The objective is convex on the feasible design class.
  • The optimizer pn(Gn)p_n^*(G_n) is computable through standard convex optimization.
  • The KKT conditions say that interior intervention units equalize the envelope gradient score up to the budget multiplier.
Theorem T-3 (Convex feasible design)

Let GnG_n be a bipartite experiment with intervention-unit set InI_n, and let ϵ,BnR\epsilon,B_n\in\mathbb R. Suppose that

  • (Positivity margin.) 0<ϵ<1/20<\epsilon<1/2;
  • (Feasible budget.) mnϵBnmn(1ϵ)m_n\epsilon\le B_n\le m_n(1-\epsilon).

Then Pn,Bn,ϵ\mathcal P_{n,B_n,\epsilon} is nonempty, compact, and convex, and pVenv(Gn,p)p\mapsto V_{\mathrm{env}}(G_n,p) is convex on Pn,Bn,ϵ\mathcal P_{n,B_n,\epsilon}. Moreover, there exists a minimizer pn(Gn)Pn,Bn,ϵp_n^*(G_n)\in\mathcal P_{n,B_n,\epsilon} such that Venv(Gn,pn(Gn))Venv(Gn,q)for every qPn,Bn,ϵ. V_{\mathrm{env}}(G_n,p_n^*(G_n)) \le V_{\mathrm{env}}(G_n,q) \qquad\text{for every }q\in\mathcal P_{n,B_n,\epsilon}. For every such minimizer pn(Gn)p_n^*(G_n), there exist λnR\lambda_n\in\mathbb R and functions ν,n+,ν,n:InR\nu^+_{\cdot,n},\nu^-_{\cdot,n}:I_n\to\mathbb R such that, for every kInk\in I_n, νk,n+0,νk,n0,gk(Gn,pn(Gn))=λnνk,n++νk,n, \nu^+_{k,n}\ge0,\qquad \nu^-_{k,n}\ge0,\qquad g_k(G_n,p_n^*(G_n))=\lambda_n-\nu^+_{k,n}+\nu^-_{k,n}, and νk,n+((pn(Gn))k(1ϵ))=0,νk,n(ϵ(pn(Gn))k)=0. \nu^+_{k,n}\bigl((p_n^*(G_n))_k-(1-\epsilon)\bigr)=0, \qquad \nu^-_{k,n}\bigl(\epsilon-(p_n^*(G_n))_k\bigr)=0.

Key Idea

  • The naive homogeneous rule assigns probability by capacity alone.
  • The envelope score asks how changing pkp_k affects all overlapping outcome pairs involving intervention kk.
  • 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\Delta_g, the feasible movement allowed by ϵ\epsilon, and the directional modulus LabL_{ab}.
  • In singleton-neighborhood graphs, the score is proportional to sk2((1ρ)2ρ2)s_k^2\left((1-\rho)^{-2}-\rho^{-2}\right).

Main Result

informal · Theorem T-7 Under an admissible budget with ϵ<ρ<1ϵ\epsilon<\rho<1-\epsilon and ρ1/2\rho\neq 1/2, unequal homogeneous-point gradient scores imply a strictly smaller envelope at every envelope-optimal heterogeneous design.

Theorem T-7 (Heterogeneity separation)

Let GnG_n be a bipartite experiment with mn=In>0m_n=|I_n|>0, and let ϵ(0,1/2)\epsilon\in(0,1/2). Suppose that:

  • (Admissible budget.) mnϵBnmn(1ϵ)m_n\epsilon\le B_n\le m_n(1-\epsilon).
  • (Homogeneous rate.) ρ=Bn/mn\rho=B_n/m_n, with ϵ<ρ<1ϵ\epsilon<\rho<1-\epsilon and ρ1/2\rho\neq 1/2.
  • (Homogeneous design.) pkhom=ρp^{\mathrm{hom}}_k=\rho for every kInk\in I_n.

Then all of the following hold:

  • If there exist a,bIna,b\in I_n such that ga(Gn,phom)gb(Gn,phom), g_a(G_n,p^{\mathrm{hom}})\neq g_b(G_n,p^{\mathrm{hom}}), then phomp^{\mathrm{hom}} is not a minimizer of Venv(Gn,)V_{\mathrm{env}}(G_n,\cdot) over Pn,Bn,ϵ\mathcal P_{n,B_n,\epsilon}. Moreover, there exist a,bIna,b\in I_n attaining, respectively, the maximum and minimum homogeneous-point gradient scores, such that Δg:=ga(Gn,phom)gb(Gn,phom)>0. \Delta_g:=g_a(G_n,p^{\mathrm{hom}})-g_b(G_n,p^{\mathrm{hom}})>0. For every pn(Gn)argminpPn,Bn,ϵVenv(Gn,p)p_n^*(G_n)\in\operatorname{argmin}_{p\in\mathcal P_{n,B_n,\epsilon}}V_{\mathrm{env}}(G_n,p), pn(Gn)phom,Venv(Gn,pn(Gn))<Venv(Gn,phom), p_n^*(G_n)\neq p^{\mathrm{hom}},\qquad V_{\mathrm{env}}(G_n,p_n^*(G_n))<V_{\mathrm{env}}(G_n,p^{\mathrm{hom}}), and Venv(Gn,phom)Venv(Gn,pn(Gn))2Δg{min{ρϵ,1ϵρ},Lab=0,min ⁣{min{ρϵ,1ϵρ},Δg/Lab},Lab0, V_{\mathrm{env}}(G_n,p^{\mathrm{hom}})-V_{\mathrm{env}}(G_n,p_n^*(G_n)) \ge 2\Delta_g \begin{cases} \min\{\rho-\epsilon,\,1-\epsilon-\rho\}, & L_{ab}=0,\\ \min\!\left\{\min\{\rho-\epsilon,\,1-\epsilon-\rho\},\,\Delta_g/L_{ab}\right\}, & L_{ab}\neq0, \end{cases} where LabL_{ab} is the directional modulus along ebeae_b-e_a.
  • If Ni(Gn)=1|N_i(G_n)|=1 for every iOni\in O_n, then, for every kInk\in I_n, gk(Gn,phom)=n1sk2((1ρ)2ρ2). g_k(G_n,p^{\mathrm{hom}}) = n^{-1}s_k^2\left((1-\rho)^{-2}-\rho^{-2}\right).
  • If Ni(Gn)=1|N_i(G_n)|=1 for every iOni\in O_n and there exist a,bIna,b\in I_n such that sa2sb2s_a^2\neq s_b^2, 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.
Theorem T-4 (Heterogeneous Hájek CLT)

Consider a sequence of bipartite experiments indexed by nn. Suppose:

  • (Outcome indexing.) For all sufficiently large nn, On=n|O_n|=n.
  • (Assignment and interference.) Assumption A-2 and Assumption A-1 hold at every nn for the assignment design DnD_n and probabilities pnp_n.
  • (Outcome and graph regularity.) Assumption A-5, Assumption A-6, and Assumption A-7 hold at every nn, with constants dˉ\bar d and Dˉ\bar D, respectively.
  • (Feasibility and optimality.) For every nn, pnPn,Bn,ϵnp_n\in\mathcal P_{n,B_n,\epsilon_n} as in Definition P-1, and pn=pn(Gn) p_n=p_n^*(G_n) as in Definition P-7.
  • (Uniform positivity.) There exists ϵ0>0\epsilon_0>0 such that ϵ0ϵn\epsilon_0\le\epsilon_n for all sufficiently large nn.
  • (Variance.) Assumption A-8 holds for σGn,pn2(Y)\sigma^2_{G_n,p_n}(Y) as in Definition P-5.

Then, for every δ>0\delta>0, PrDn ⁣(n{τ^H(pn(Gn))τn}n1/2iOnηi(pn(Gn),Z)δ)0, \Pr_{D_n}\!\left( \left| \sqrt n\bigl\{\widehat\tau_H(p_n^*(G_n))-\tau_n\bigr\} -n^{-1/2}\sum_{i\in O_n}\eta_i(p_n^*(G_n),Z) \right|\ge\delta \right)\longrightarrow 0, and, for every sRs\in\mathbb R, PrDn ⁣(n{τ^H(pn(Gn))τn}σGn,pn(Gn)2(Y)s)Pr ⁣{N(0,1)s}. \Pr_{D_n}\!\left( \frac{\sqrt n\bigl\{\widehat\tau_H(p_n^*(G_n))-\tau_n\bigr\}} {\sqrt{\sigma^2_{G_n,p_n^*(G_n)}(Y)}}\le s \right) \longrightarrow \Pr\!\left\{N(0,1)\le s\right\}.

Theorem T-5 (Post-design Wald coverage)

For a sequence of bipartite experiments GnG_n with outcome sets OnO_n, finite assignment designs, probability vectors pnp_n, positivity margins ϵn\epsilon_n, and budgets BnB_n, suppose:

  • (Outcome indexing.) On=n|O_n|=n for all sufficiently large nn.
  • (Assignment law.) The assignment design satisfies Assumption A-2 with 0pn,k10\le p_{n,k}\le 1 for every nn and kInk\in I_n.
  • (Interference and boundedness.) Assumption A-1, Assumption A-5, Assumption A-6, and Assumption A-7 hold with constants dˉ\bar d and Dˉ\bar D.
  • (Feasibility and optimality.) For every nn, pnp_n is a feasible design in the sense of Definition P-1, ϵn(0,1/2)\epsilon_n\in(0,1/2), and pn=pn(Gn) p_n=p_n^*(G_n) in the sense of Definition P-7.
  • (Uniform positivity.) There exists ϵ0>0\epsilon_0>0 such that ϵ0ϵn\epsilon_0\le\epsilon_n for all sufficiently large nn.
  • (Nondegenerate variance.) Assumption A-8 holds for σGn,pn2(Y)\sigma^2_{G_n,p_n}(Y).
  • (Wald critical value.) αcov(0,1)\alpha_{\mathrm{cov}}\in(0,1), z1αcov/20z_{1-\alpha_{\mathrm{cov}}/2}\ge0, and Φ ⁣(z1αcov/2)=1αcov2. \Phi\!\left(z_{1-\alpha_{\mathrm{cov}}/2}\right) =1-\frac{\alpha_{\mathrm{cov}}}{2}.

Then, for every nn, σGn,pn2(Y)V^cons(Gn,pn), \sigma^2_{G_n,p_n}(Y)\le \widehat V_{\mathrm{cons}}(G_n,p_n), where σGn,pn2(Y)\sigma^2_{G_n,p_n}(Y) and V^cons(Gn,pn)\widehat V_{\mathrm{cons}}(G_n,p_n) are as in Definition P-5 and Definition P-9, respectively; moreover, 1αcovlim infnPrpn ⁣(τnτ^H(pn)z1αcov/2V^cons(Gn,pn)n). 1-\alpha_{\mathrm{cov}} \le \liminf_{n\to\infty} \Pr_{p_n}\!\left( \left|\tau_n-\widehat\tau_H(p_n)\right| \le z_{1-\alpha_{\mathrm{cov}}/2} \sqrt{\frac{\widehat V_{\mathrm{cons}}(G_n,p_n)}{n}} \right).

Surrogate Design

  • The exact envelope couples probabilities across shared neighborhoods.
  • The surrogate replaces that coupled objective with additive weights hk(Gn)h_k(G_n).
  • Mechanism: each intervention unit receives a graph-derived weight and minimizes hk(Gn){pk1+(1pk)1}h_k(G_n)\{p_k^{-1}+(1-p_k)^{-1}\} inside the shared budget.
  • Under bounded outcome degree, this separable design has a uniform envelope approximation certificate.

informal · Theorem T-8 With admissible ϵ\epsilon, bounded outcome degree dˉ\bar d, and an admissible budget, the surrogate approximation ratio is at most max ⁣{1,ϵ(dˉ1)}\max\!\left\{1,\epsilon^{-(\bar d-1)}\right\}.

Theorem T-8 (Surrogate approximation certificate)

For a bipartite experiment on GnG_n, suppose:

  • (Admissible floor.) 0<ϵ<1/20<\epsilon<1/2.
  • (Bounded outcome degree.) Assumption A-6 holds with bound dˉ\bar d.
  • (Admissible budget.) mnϵBnmn(1ϵ)m_n\epsilon\le B_n\le m_n(1-\epsilon).

Then, for every pPn,Bn,ϵp\in\mathcal P_{n,B_n,\epsilon} of Definition P-1, kInhk(Gn) ⁣{pk1+(1pk)1}Venv(Gn,p)4max ⁣{1,ϵ(dˉ1)}kInhk(Gn) ⁣{pk1+(1pk)1}. \sum_{k\in I_n}h_k(G_n)\!\left\{p_k^{-1}+(1-p_k)^{-1}\right\} \le \frac{V_{\mathrm{env}}(G_n,p)}{4} \le \max\!\left\{1,\epsilon^{-(\bar d-1)}\right\} \sum_{k\in I_n}h_k(G_n)\!\left\{p_k^{-1}+(1-p_k)^{-1}\right\}. Moreover, the approximation ratio of Definition P-11 satisfies αcert(Gn)max ⁣{1,ϵ(dˉ1)}. \alpha_{\mathrm{cert}}(G_n)\le \max\!\left\{1,\epsilon^{-(\bar d-1)}\right\}.

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 hh-weight-ratio controls.

informal · Theorem T-6 For every admissible ϵ\epsilon, dispersion constant, and hh-weight ratio constant, there are unbounded-degree sequences with approximation ratio tending to infinity.

Theorem T-6 (Unbounded dispersion certificate)

For every ϵ(0,1/2)\epsilon\in(0,1/2), cdisp>0c_{\mathrm{disp}}>0, and Cdisp1C_{\mathrm{disp}}\geq 1, there exist sequences of finite intervention-unit sets InI_n, finite outcome-unit sets OnO_n, finite bipartite experiments GnG_n, and budgets BnB_n such that, for every nn,

  • (Admissible budget.) With mn=Inm_n=|I_n|, mnϵBnmn(1ϵ). m_n\epsilon\leq B_n\leq m_n(1-\epsilon).
  • (Positive energy.) 0<kInsk2. 0<\sum_{k\in I_n}s_k^2.

Moreover, for all sufficiently large nn,

  • (Degree dispersion.) For every kInk\in I_n, sk2cdisplInsl2. s_k^2\leq c_{\mathrm{disp}}\sum_{l\in I_n}s_l^2.
  • (hh-weight ratio.) For every k,lInk,l\in I_n, hl(Gn)>0  hk(Gn)Cdisphl(Gn). h_l(G_n)>0\ \Longrightarrow\ h_k(G_n)\leq C_{\mathrm{disp}}\,h_l(G_n).

Finally, the approximation ratio of Definition P-11 satisfies αcert(Gn). \alpha_{\mathrm{cert}}(G_n)\longrightarrow\infty .

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

Bipartite graph Gₙ Compute envelope V_env Choose design pₙ*(Gₙ) Bernoulli experiment run randomization Hájek estimate Wald interval
illustrative Box bipartite graph GnG_n points to box compute envelope VenvV_{\mathrm{env}}; box compute envelope VenvV_{\mathrm{env}} points to box choose pn(Gn)p_n^*(G_n); box choose pn(Gn)p_n^*(G_n) points to box run Bernoulli experiment; box run Bernoulli experiment points to box Hájek estimate and Wald interval.
  • Fix BnB_n from treatment capacity and choose an admissible positivity floor.
  • Audit did_i, sks_k, 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.