Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models

IF 0.7 4区 管理学 Q3 Engineering Military Operations Research Pub Date : 2023-07-06 DOI:10.1287/opre.2022.2337
Jiaqi Zhou, I. Ryzhov
{"title":"Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models","authors":"Jiaqi Zhou, I. Ryzhov","doi":"10.1287/opre.2022.2337","DOIUrl":null,"url":null,"abstract":"A major focus of the simulation literature is the study of optimal budget allocation. The goal is to divide a simulation budget between alternatives with unknown values in a manner that leads to efficient identification of the best alternative. Existing analytical techniques, based on large deviations theory, are limited to finite sets of alternatives, each of which is assigned a certain proportion of the budget. In “A New Rate-Optimal Sampling Allocation for Linear Belief Models,” Zhou and Ryzhov develop the first provably optimal budget allocation for a continuous problem where linear regression is used to model the value of a choice. The allocation is expressible in closed form and is simpler and easier to implement than analogous solutions for the discrete setting. This work bridges the emerging literature on contextual (regression-based) learning and the well-known statistical problem of optimal experimental design.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"19 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.2337","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

A major focus of the simulation literature is the study of optimal budget allocation. The goal is to divide a simulation budget between alternatives with unknown values in a manner that leads to efficient identification of the best alternative. Existing analytical techniques, based on large deviations theory, are limited to finite sets of alternatives, each of which is assigned a certain proportion of the budget. In “A New Rate-Optimal Sampling Allocation for Linear Belief Models,” Zhou and Ryzhov develop the first provably optimal budget allocation for a continuous problem where linear regression is used to model the value of a choice. The allocation is expressible in closed form and is simpler and easier to implement than analogous solutions for the discrete setting. This work bridges the emerging literature on contextual (regression-based) learning and the well-known statistical problem of optimal experimental design.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
线性信念模型的一种新的率最优抽样分配方法
仿真文献的一个主要焦点是研究最优预算分配。目标是在具有未知值的备选方案之间划分模拟预算,从而有效地识别最佳备选方案。现有的分析技术以大偏差理论为基础,仅限于有限的备选方案,每一套方案都分配一定比例的预算。在“线性信念模型的一种新的率最优抽样分配”中,Zhou和Ryzhov为一个连续问题开发了第一个可证明的最优预算分配,其中线性回归用于建模选择的价值。该分配以封闭形式表示,比离散设置的类似解决方案更简单,更容易实现。这项工作连接了上下文(基于回归)学习的新兴文献和众所周知的最佳实验设计统计问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
期刊最新文献
Optimal Routing Under Demand Surges: The Value of Future Arrival Rates Demand Estimation Under Uncertain Consideration Sets Optimal Routing to Parallel Servers in Heavy Traffic The When and How of Delegated Search A Data-Driven Approach to Beating SAA Out of Sample
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1