SCREENING, PREDICTING, AND COMPUTER EXPERIMENTS

被引:410
作者
WELCH, WJ
BUCK, RJ
SACKS, J
WYNN, HP
MITCHELL, TJ
MORRIS, MD
机构
[1] CITY UNIV LONDON, SCH MATH ACTUARIAL SCI & STAT, LONDON EC1V 0HB, ENGLAND
[2] NATL INST STAT SCI, RES TRIANGLE PK, NC 27709 USA
[3] OAK RIDGE NATL LAB, DIV ENGN PHYS & MATH, OAK RIDGE, TN 37831 USA
[4] UNIV ILLINOIS, DEPT CIVIL ENGN, CHAMPAIGN, IL 61820 USA
关键词
COMPUTER CODE; DATA-ADAPTIVE MODELING; DIMENSION REDUCTION; ELECTRONIC-CIRCUIT SIMULATION; MAXIMUM LIKELIHOOD; SIMULATION; STOCHASTIC PROCESS;
D O I
10.2307/1269548
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Many scientific phenomena are now investigated by complex computer models or codes. Given the input values, the code produces one or more outputs via a complex mathematical model. Often the code is expensive to run, and it may be necessary to build a computationally cheaper predictor to enable, for example, optimization of the inputs. If there are many input factors, an initial step in building a predictor is identifying (screening) the active factors. We model the output of the computer code as the realization of a stochastic process. This model has a number of advantages. First, it provides a statistical basis, via the likelihood, for a stepwise algorithm to determine the important factors. Second, it is very flexible, allowing nonlinear and interaction effects to emerge without explicitly modeling such effects. Third, the same data are used for screening and building the predictor, so expensive runs are efficiently used. We illustrate the methodology with two examples, both having 20 input variables. In these examples, we identify the important variables, detect curvature and interactions, and produce a useful predictor with 30-50 runs of the computer code.
引用
收藏
页码:15 / 25
页数:11
相关论文
共 15 条
[1]  
[Anonymous], 1986, NUMERICAL RECIPES
[2]   AN ANALYSIS FOR UNREPLICATED FRACTIONAL FACTORIALS [J].
BOX, GEP ;
MEYER, RD .
TECHNOMETRICS, 1986, 28 (01) :11-18
[3]   BAYESIAN PREDICTION OF DETERMINISTIC FUNCTIONS, WITH APPLICATIONS TO THE DESIGN AND ANALYSIS OF COMPUTER EXPERIMENTS [J].
CURRIN, C ;
MITCHELL, T ;
MORRIS, M ;
YLVISAKER, D .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1991, 86 (416) :953-963
[4]  
IMAN RL, 1980, COMMUN STAT A-THEOR, V9, P1749, DOI 10.1080/03610928008827996
[5]   A COMPARISON OF THREE METHODS FOR SELECTING VALUES OF INPUT VARIABLES IN THE ANALYSIS OF OUTPUT FROM A COMPUTER CODE [J].
MCKAY, MD ;
BECKMAN, RJ ;
CONOVER, WJ .
TECHNOMETRICS, 1979, 21 (02) :239-245
[7]   A SIMPLEX-METHOD FOR FUNCTION MINIMIZATION [J].
NELDER, JA ;
MEAD, R .
COMPUTER JOURNAL, 1965, 7 (04) :308-313
[8]  
Plackett R.L., 1946, BIOMETRIKA, V33, P305, DOI [10.1093/biomet/33.4.305, DOI 10.2307/2332195, DOI 10.1093/BIOMET/33.4.305]
[9]   DESIGNS FOR COMPUTER EXPERIMENTS [J].
SACKS, J ;
SCHILLER, SB ;
WELCH, WJ .
TECHNOMETRICS, 1989, 31 (01) :41-47
[10]  
Sacks J., 1989, STAT SCI, V4, P409, DOI DOI 10.1214/SS/1177012413