基于高维函数逼近的最优设计自适应算法
An Adaptive Algorithm based on High-Dimensional Function Approximation to obtain Optimal Designs
摘要:
计算局部最优连续设计的算法通常依赖于有限的设计空间或重复求解复杂的非线性规划。这两种方法都需要对基础模型的雅可比Df进行广泛的评估。这些评估提出了一个沉重的计算负担。基于Kiefer-Wolfowitz等价定理,提出了一种新的在连续设计空间中计算最优设计的试验设计算法。对于这种迭代算法,我们结合了自适应贝叶斯样采样方案与高斯过程回归近似的设计准则的方向导数。近似值允许我们自适应地选择新的设计点来评估模型。算法的自适应选择需要显著更少的Df评估,并减少计算的运行时间。我们展示了新算法的可行性,从化学工程的两个例子。
英文摘要:
Algorithms which compute locally optimal continuous designs often rely on a finite design space or on repeatedly solving a complex non-linear program. Both methods require extensive evaluations of the Jacobian Df of the underlying model. These evaluations present a heavy computational burden. Based on the Kiefer-Wolfowitz Equivalence Theorem we present a novel design of experiments algorithm which computes optimal designs in a continuous design space. For this iterative algorithm we combine an adaptive Bayes-like sampling scheme with Gaussian process regression to approximate the directional derivative of the design criterion. The approximation allows us to adaptively select new design points on which to evaluate the model. The adaptive selection of the algorithm requires significantly less evaluations of Df and reduces the runtime of the computations. We show the viability of the new algorithm on two examples from chemical engineering.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。