跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确研究网络干扰中的因果效应估计及在线处理分配。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Zhiheng Zhang
Zichen Wang

网络干扰下兼顾估计精度与遗憾的在线实验设计

研究问题
在个体处理会影响网络邻居的序贯实验中,如何同时估计考虑干扰的因果效应,并控制持续采取次优决策所产生的遗憾?
方法与思路
作者提出考虑干扰的在线实验框架,用暴露映射扩展行动空间,分析估计精度与遗憾的权衡,并给出算法及推广讨论。
材料陈述的贡献
摘要称建立了关于实验时长和行动空间的帕累托最优权衡,且在无网络干扰时仍优于基准,并讨论不同学习场景和网络拓扑。
阅读关注点
核对暴露映射对应的效应参数、网络信息要求、遗憾定义,以及最优性上下界和算法实现所需条件,检查基准比较是否同口径。
阅读边界
这是预印本,同行评审及接收状态未核实。摘要未说明干扰结构、最优性条件与具体界,所称优于基准不能外推至所有网络实验。

原文摘要

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.

笔记与分组
相关领域论文