Pith. sign in

REVIEW 2 cited by

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.03727 v3 pith:IJEPJ5SX submitted 2024-12-04 cs.LG math.OCmath.STstat.TH

classification cs.LGmath.OCmath.STstat.TH
keywords networksettingscausaleffectsexperimentalinterferencetreatmentdesign
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Network interference has attracted significant attention in the field of causal inference, encapsulating various sociological behaviors where the treatment assigned to one individual within a network may affect the outcomes of others, such as their neighbors. A key challenge in this setting is that standard causal inference methods often assume independent treatment effects among individuals, which may not hold in networked environments. To estimate interference-aware causal effects, a traditional approach is to inherit the independent settings, where practitioners randomly assign experimental participants into different groups and compare their outcomes. While effective in offline settings, this strategy becomes problematic in sequential experiments, where suboptimal decision persists, leading to substantial regret. To address this issue, we introduce a unified interference-aware framework for online experimental design. Compared to existing studies, we extend the definition of arm space by utilizing the statistical concept of exposure mapping, which allows for a more flexible and context-aware representation of treatment effects in networked settings. Crucially, we establish a Pareto-optimal trade-off between estimation accuracy and regret under the network concerning both time period and arm space, which remains superior to baseline models even without network interference. Furthermore, we propose an algorithmic implementation and discuss its generalization across different learning settings and network topology.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Balancing Interference and Correlation in Spatial Experimental Designs: A Causal Graph Cut Approach

    cs.LG 2025-05 conditional novelty 7.0 of 10

    A surrogate for the ATE estimator's MSE is optimized with spectral graph cuts to produce cluster-randomized designs that adapt to the spatial covariance and accommodate moderate-to-large interference.

  2. Learning Peer Influence Probabilities with Linear Contextual Bandits

    cs.LG 2025-10 conditional novelty 6.0 of 10

    In a linear contextual bandit setting with k network interventions per round, cumulative regret and influence-probability estimation error obey a rate trade-off, and a new algorithm, InfluenceCB, can attain any point ...

Pith tools