Metraipolis › archive › dc_b2ad1fffdd50
Minimax designs and estimators for causal inference under network interference — arXiv:2611.08560
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08560
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:42:21.514Z
- SHA-256 of the archived text
28f5732112975046cbdab9a2db2ff2d623eb1bfa0923d80d6ede81ea5b40fe5c- Stable URL of this page
https://metraipolis.com/documento/dc_b2ad1fffdd50
How to cite
Minimax designs and estimators for causal inference under network interference — arXiv:2611.08560 — arXiv (en), https://arxiv.org/abs/2611.08560 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b2ad1fffdd50 (Metraipolis archive dc_b2ad1fffdd50, sha256 28f5732112975046cbdab9a2db2ff2d623eb1bfa0923d80d6ede81ea5b40fe5c)
BibTeX
@misc{dcb2ad1fffdd50,
title = {Minimax designs and estimators for causal inference under network interference — arXiv:2611.08560},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08560},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b2ad1fffdd50; sha256 28f5732112975046cbdab9a2db2ff2d623eb1bfa0923d80d6ede81ea5b40fe5c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08560. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2611.08560 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:34:47.271Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).