arrow
Return

Optimal Computing Budget Allocation for regression with gradient information

delete2021-12-01
delete9
delete
OA
AI
T
Tianxiang Wang
J
Jie Xu
J
Jian-Qiang Hu *
C
Chun‐Hung Chen
DOI:10.1016/j.automatica.2021.109927delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We consider the problem of optimizing the performance of a stochastic system, e.g., a discrete event system, where the system performance is evaluated using stochastic simulations. Our objective is to allocate simulation budget to maximize the probability of correct selection (PCS) of the best design, where both system performance and gradient information can be obtained simultaneously via simulation. The objective function is assumed to be quadratic, or can be approximated by a quadratic regression model. The main contribution of our work is to utilize gradient information to enhance the efficiency of traditional Optimal Computing Budget Allocation (OCBA). We develop near-optimal rules that determine design points where simulations should be run and the number of runs allocated to each point. Our numerical experiments demonstrate that the proposed approach performs much better than other existing ranking and selection methods, even in cases where derivative information is very noisy and its simulation cost is high. (C) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Simulation optimization
Stochastic systems
Gradient information
Computing budget allocation
Quadratic model
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Automatica cover
Automatica
IF:
5.9
Papers:
1.2W
Citations:
5.2W

Organization

G
George Mason University
Scholars:
7.7K
Papers: 7.9K
Citations: 1.0W
F
fudan university
Scholars:
11.6W
Papers: 7.7W
Citations: 121