Optimal Design via Curve Fitting of Monte Carlo Experiments
通过蒙特卡洛实验的曲线拟合实现最优设计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用贝叶斯实验设计与随机优化,临床应用不直接对应所列经济计量细分方向。
通过蒙特卡洛实验的曲线拟合实现最优设计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article explores numerical methods for stochastic optimization, with special attention to Bayesian design problems. A common and challenging situation occurs when the objective function (in Bayesian applications, the expected utility) is very expensive to evaluate, perhaps because it requires integration over a space of very large dimensionality. Our goal is to explore a class of optimization algorithms designed to gain efficiency in such situations, by exploiting smoothness of the expected utility surface and borrowing information from neighboring design points. The central idea is that of implementing stochastic optimization by curve fitting of Monte Carlo samples. This is done by simulating draws from the joint parameter/sample space and evaluating the observed utilities. Fitting a smooth surface through these simulated points serves as estimate for the expected utility surface. The optimal design can then be found deterministically. In this article we introduce a general algorithm for curve-fitting-based optimization, discuss implementation options, and present a consistency property for one particular implementation of the algorithm. To illustrate the advantages and limitations of curve-fitting-based optimization, and to compare it with some of the alternatives, we consider in detail two important practical applications: an information theoretical stopping rule for a clinical trial, with an objective function based on the expected amount of information acquired about a subvector of parameters of interest, and the design of exploratory shock levels in the implantation of heart defibrillators. This latter example is also used for comparison with some of the alternative schemes. One of the main attractions of efficient optimization algorithms in design is the application to sequential problems. We conclude with an outlook on how the ideas presented here can be extended to solve stochastic dynamic programming problems such as those occurring in Bayesian sequential design.