Optimal Sampling for Generalized Linear Models Under Measurement Constraints

数学 协变量 抽样分布 计算机科学 数学优化 样本量测定 重要性抽样 估计员 三角洲法 采样(信号处理) 切片取样 渐近分布 统计 算法 蒙特卡罗方法 滤波器(信号处理) 计算机视觉
作者
Tao Zhang,Yang Ning,David Ruppert
出处
期刊:Journal of Computational and Graphical Statistics [Informa]
卷期号:30 (1): 106-114 被引量:13
标识
DOI:10.1080/10618600.2020.1778483
摘要

Under “measurement constraints,” responses are expensive to measure and initially unavailable on most of records in the dataset, but the covariates are available for the entire dataset. Our goal is to sample a relatively small portion of the dataset where the expensive responses will be measured and the resultant sampling estimator is statistically efficient. Measurement constraints require the sampling probabilities can only depend on a very small set of the responses. A sampling procedure that uses responses at most only on a small pilot sample will be called “response-free.” We propose a response-free sampling procedure optimal sampling under measurement constraints (OSUMC) for generalized linear models. Using the A-optimality criterion, that is, the trace of the asymptotic variance, the resultant estimator is statistically efficient within a class of sampling estimators. We establish the unconditional asymptotic distribution of a general class of response-free sampling estimators. This result is novel compared with the existing conditional results obtained by conditioning on both covariates and responses. Under our unconditional framework, the subsamples are no longer independent and new martingale techniques are developed for our asymptotic theory. We further derive the A-optimal response-free sampling distribution. Since this distribution depends on population level quantities, we propose the OSUMC algorithm to approximate the theoretical optimal sampling. Finally, we conduct an intensive empirical study to demonstrate the advantages of OSUMC algorithm over existing methods in both statistical and computational perspectives. We find that OSUMC’s performance is comparable to that of sampling algorithms that use complete responses. This shows that, provided an efficient algorithm such as OSUMC is used, there is little or no loss in accuracy due to the unavailability of responses because of measurement constraints. Supplementary materials for this article are available online.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
结实星星应助JJJXG采纳,获得20
刚刚
SJT完成签到,获得积分10
刚刚
SciGPT应助xin采纳,获得10
1秒前
天才小能喵应助MDRen采纳,获得10
2秒前
莫止完成签到,获得积分10
3秒前
李健应助噗噗采纳,获得10
3秒前
4秒前
小二郎应助Jeffery采纳,获得10
4秒前
赵萤映雪完成签到,获得积分10
5秒前
Eliana发布了新的文献求助30
5秒前
秋雪瑶应助yy采纳,获得10
6秒前
frin发布了新的文献求助10
6秒前
ada完成签到,获得积分10
7秒前
FashionBoy应助LL采纳,获得10
7秒前
斯文败类应助科研混子采纳,获得10
8秒前
9秒前
10秒前
11秒前
11秒前
11秒前
12秒前
传统的三娘完成签到,获得积分10
13秒前
13秒前
空白完成签到,获得积分20
13秒前
lironghao完成签到,获得积分20
15秒前
15秒前
陶醉觅夏发布了新的文献求助10
15秒前
个性的紫菜应助十三采纳,获得10
15秒前
beigu应助聪明无敌小腚宝采纳,获得20
15秒前
乘云发布了新的文献求助10
16秒前
朴实雪碧完成签到 ,获得积分10
17秒前
空白发布了新的文献求助10
17秒前
17秒前
毛豆爸爸发布了新的文献求助10
17秒前
ZYY完成签到,获得积分10
17秒前
清爽幻梅发布了新的文献求助10
18秒前
小卓越完成签到 ,获得积分10
18秒前
李健的小迷弟应助鸡毛采纳,获得10
19秒前
zclzlc发布了新的文献求助10
19秒前
高分求助中
【本贴是提醒信息,请勿应助】请在求助之前详细阅读求助说明!!!! 20000
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Three Stars Each: The Astrolabes and Related Texts 900
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
Multifunctional Agriculture, A New Paradigm for European Agriculture and Rural Development 600
Challenges, Strategies, and Resiliency in Disaster and Risk Management 500
Bernd Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2481991
求助须知:如何正确求助?哪些是违规求助? 2144498
关于积分的说明 5470272
捐赠科研通 1866943
什么是DOI,文献DOI怎么找? 928005
版权声明 563071
科研通“疑难数据库(出版商)”最低求助积分说明 496455