arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.01273stat.ME
收藏

网络数据的自适应随机化

Adaptive Randomization in Network Data

Zhixin Zhou, Ping Li, Feifang Hu

摘要:

网络数据在近年来的研究中频繁出现。例如,在比较不同类型治疗的效果时,已经提出了网络模型来改进估计和假设检验的质量。在本文中,我们专注于有效地估计平均处理效应使用自适应随机化过程中的网络。我们的工作模型的因果框架,其中一个主题的治疗结果是受其自身的协变量以及其邻居。此外,我们考虑的情况下,当我们分配治疗当前主题,只有现有的主题的子网络被揭示。提出了新的随机化程序,以最大限度地减少处理效应之间估计差异的均方误差。在网络数据中,由于节点数和连接数同时增加,通常很难获得理论性质。在温和的假设下,我们提出的方法是密切相关的时变非齐次马尔可夫链。然后,我们使用李雅普诺夫函数推导出所提出的程序的理论性质。所提出的程序的优点也证明了广泛的模拟和实验上的真实网络数据。

英文摘要:

Network data have appeared frequently in recent research. For example, in comparing the effects of different types of treatment, network models have been proposed to improve the quality of estimation and hypothesis testing. In this paper, we focus on efficiently estimating the average treatment effect using an adaptive randomization procedure in networks. We work on models of causal frameworks, for which the treatment outcome of a subject is affected by its own covariate as well as those of its neighbors. Moreover, we consider the case in which, when we assign treatments to the current subject, only the subnetwork of existing subjects is revealed. New randomized procedures are proposed to minimize the mean squared error of the estimated differences between treatment effects. In network data, it is usually difficult to obtain theoretical properties because the numbers of nodes and connections increase simultaneously. Under mild assumptions, our proposed procedure is closely related to a time-varying inhomogeneous Markov chain. We then use Lyapunov functions to derive the theoretical properties of the proposed procedures. The advantages of the proposed procedures are also demonstrated by extensive simulations and experiments on real network data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑