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
AI가 단일세포 데이터를 읽는 시대, 우리는 분자 3D 구조를 '읽고' 있는가? 10x Genomics가 Anthropic의 Claude를 Chromium...
0dev.to Data
Wenn ein Drittel der Diagnosen falsch war: Was molekulare Präzision für Allergologie und Arzneimittelforschung bedeutet
0dev.to Data
Planning a Tattoo Idea Before the First Appointment
0dev.to Design

Comment la vectorisation d'image transforme-t-elle un logo PNG en SVG ?
0dev.to Design
I Had the Studio Before I Had the Business Idea
0dev.to Design

Best AI Humanizer for Essays and Academic Writing in 2026: Improve Clarity and Natural Writing
0dev.to Discuss