IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.02756.html

Off-policy causal estimation in networks

Author

Listed:
  • Sahil Loomba
  • Dean Eckles

Abstract

In the presence of interference, where the treatment assigned to one unit can affect the outcomes of others, many causal estimands depend on the treatment-assignment policy under which the experiment is conducted. This policy dependence creates a fundamental challenge for off-policy estimation, where the goal is to estimate causal quantities under a hypothetical intervention policy different from the one used to collect data. We study this problem of off-policy estimation of causal effects for heterogeneous Bernoulli policies. By representing exposure-weighted potential outcomes in the biased Fourier basis of the experimental design, we construct, for any prespecified Fourier subspace encoding the assumed interference structure, the unique minimum-$L^2$ weight that transports every function in that subspace. Global and local inverse-probability weights, linear-interference weights, and no-interference weights are special cases. The weight variance is a structured chi-square distance between the experiment and target policies. When the assumed interference structure is misspecified, the introduced bias couples the omitted outcome spectrum with the corresponding policy-shift coefficients, yielding a sharp robustness bound and a bias-variance trade-off. A Fourier-neighborhood-overlap condition gives consistency under structured interference, and we state a Doob-martingale central limit theorem for off-policy estimators. As the variance is not identified, we derive identifiable bounds and associated conservative estimators of the variance. Simulations illustrate these theoretical results for the design and analysis of experiments under network interference and design mismatch.

Suggested Citation

  • Sahil Loomba & Dean Eckles, 2026. "Off-policy causal estimation in networks," Papers 2609.02756, arXiv.org.
  • Handle: RePEc:arx:papers:2609.02756
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.02756
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2609.02756. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.