Backend
Minimax designs and estimators for causal inference under network interference
arXiv stat.TH0 views
arXiv:2611.08560v1 Announce Type: new Abstract: We develop a design-based minimax theory for linear causal estimands under interference. We study the minimax risks of three problems: optimizing an estimator under a fixed design, optimizing an estimator and a design from a restricted class, or optimizing both over all designs. In each problem, we study the minimax risk over all estimators and over design-unbiased estimators separately. We allow any correctly specified exposure mapping, including the identity. Our theory represents causal inference under interference as a constrained sampling design on an expanded finite population of $\sum_i d_i$ potential outcomes, where $d_i$ is the number of exposure levels attainable by unit $i$. We describe the constrained sampling design by a weighted sampling hypergraph: its vertices are the potential outcomes, its hyperedges are the maximal sets of potential outcomes that can be jointly sampled under feasible treatment assignments, and its weights are induced by the randomization design. We show that the minimax risks of the fixed-design, restricted-design, and all-design problems depend, respectively, on the weighted hypergraph induced by the design, the collection of weighted hypergraphs attainable within the restricted class, and the unweighted hypergraph. Our Bayes lower bounds compare potential-outcome tables that differ on jointly missing sets of potential outcomes: joint-missingness probabilities govern the lower bounds over all estimators, whereas the corresponding odds govern the lower bounds over unbiased estimators. We illustrate the theory for average treatment effects without interference, saturation designs under partial interference, total, direct, and contagion effects under neighborhood interference, and bipartite dose-response contrasts. The upper and lower bounds match in several settings.
Source:https://arxiv.org/abs/2611.08560PreviousRACORN: Robust Predicate-Agnostic Filtered Vector Search under Extreme SelectivityNextAn Asymptotic Framework for Closed-Form Estimators from Surrogate Estimating Equations
Related posts
Building a Private AI Control Plane for PS5 Porting: What We Learned After SQLite Locked Us Out at 2 AM
0dev.to
Monolith vs Microservices: A Founder's Guide
0dev.to
Sentinel Dev Diary: Read First, Run Second
0dev.to
A website for the café down the street, prepared before they ask
0dev.to

Where Temporary Files Come From and Why They Can Leak Office Data
0dev.to

How to Accept USDC Payments on EVM: A Reorg-Safe Stablecoin Payments Detector in Node.js
0dev.to