1 Design of experiment for computer simulations Let X = (X 1,…,X p )  R p denote the vector of input values chosen for the computer program Each X j is.

Slides:



Advertisements
Similar presentations
Rachel T. Johnson Douglas C. Montgomery Bradley Jones
Advertisements

Design of Experiments Lecture I
General Linear Model With correlated error terms  =  2 V ≠  2 I.
Lecture 23 Exemplary Inverse Problems including Earthquake Location.
Monte Carlo Methods and Statistical Physics
Pattern Recognition and Machine Learning
Kriging.
Data Modeling and Parameter Estimation Nov 9, 2005 PSCI 702.
Sensitivity Analysis In deterministic analysis, single fixed values (typically, mean values) of representative samples or strength parameters or slope.
Confidence Intervals This chapter presents the beginning of inferential statistics. We introduce methods for estimating values of these important population.
Experimental Design, Response Surface Analysis, and Optimization
Lecture 3 Probability and Measurement Error, Part 2.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Visual Recognition Tutorial
Resampling techniques Why resampling? Jacknife Cross-validation Bootstrap Examples of application of bootstrap.
Common Factor Analysis “World View” of PC vs. CF Choosing between PC and CF PAF -- most common kind of CF Communality & Communality Estimation Common Factor.
AGC DSP AGC DSP Professor A G Constantinides© Estimation Theory We seek to determine from a set of data, a set of parameters such that their values would.
Additional Topics in Regression Analysis
An Optimal Learning Approach to Finding an Outbreak of a Disease Warren Scott Warren Powell
Development of Empirical Models From Process Data
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Chapter 11 Multiple Regression.
Experimental Evaluation
Uncertainty analysis is a vital part of any experimental program or measurement system design. Common sources of experimental uncertainty were defined.
Statistical Methods for long-range forecast By Syunji Takahashi Climate Prediction Division JMA.
Principles of the Global Positioning System Lecture 10 Prof. Thomas Herring Room A;
CHAPTER 15 S IMULATION - B ASED O PTIMIZATION II : S TOCHASTIC G RADIENT AND S AMPLE P ATH M ETHODS Organization of chapter in ISSO –Introduction to gradient.
Copyright © Cengage Learning. All rights reserved. 12 Simple Linear Regression and Correlation.
Simulation Output Analysis
Gaussian process modelling
PATTERN RECOGNITION AND MACHINE LEARNING
ENCI 303 Lecture PS-19 Optimization 2
Population All members of a set which have a given characteristic. Population Data Data associated with a certain population. Population Parameter A measure.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory 101 Quasi-Newton Methods.
Statistical Decision Making. Almost all problems in statistics can be formulated as a problem of making a decision. That is given some data observed from.
Orthogonal Linear Contrasts This is a technique for partitioning ANOVA sum of squares into individual degrees of freedom.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Chapter 11Design & Analysis of Experiments 8E 2012 Montgomery 1.
Yaomin Jin Design of Experiments Morris Method.
Overview of Supervised Learning Overview of Supervised Learning2 Outline Linear Regression and Nearest Neighbors method Statistical Decision.
Chapter 4 Linear Regression 1. Introduction Managerial decisions are often based on the relationship between two or more variables. For example, after.
Center for Radiative Shock Hydrodynamics Fall 2011 Review Assessment of predictive capability Derek Bingham 1.
Orthogonal Linear Contrasts This is a technique for partitioning ANOVA sum of squares into individual degrees of freedom.
Clustering and Testing in High- Dimensional Data M. Radavičius, G. Jakimauskas, J. Sušinskas (Institute of Mathematics and Informatics, Vilnius, Lithuania)
PROCESS MODELLING AND MODEL ANALYSIS © CAPE Centre, The University of Queensland Hungarian Academy of Sciences Statistical Model Calibration and Validation.
5-1 ANSYS, Inc. Proprietary © 2009 ANSYS, Inc. All rights reserved. May 28, 2009 Inventory # Chapter 5 Six Sigma.
CHAPTER SEVEN ESTIMATION. 7.1 A Point Estimate: A point estimate of some population parameter is a single value of a statistic (parameter space). For.
Simulated Annealing G.Anuradha.
Vaida Bartkutė, Leonidas Sakalauskas
CHAPTER 17 O PTIMAL D ESIGN FOR E XPERIMENTAL I NPUTS Organization of chapter in ISSO –Background Motivation Finite sample and asymptotic (continuous)
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
Designing Factorial Experiments with Binary Response Tel-Aviv University Faculty of Exact Sciences Department of Statistics and Operations Research Hovav.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
CS Statistical Machine learning Lecture 12 Yuan (Alan) Qi Purdue CS Oct
Anders Nielsen Technical University of Denmark, DTU-Aqua Mark Maunder Inter-American Tropical Tuna Commission An Introduction.
Statistical Decision Making. Almost all problems in statistics can be formulated as a problem of making a decision. That is given some data observed from.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Updated by J.-H. Eom (2 nd round revision) Summarized by K.-I.
Multiple Regression Analysis: Inference
Applied Statistics and Probability for Engineers
EXCEL: Multiple Regression
Chapter 7. Classification and Prediction
What If There Are More Than Two Factor Levels?
Other confidence intervals
Inference on Mean, Var Unknown
Filtering and State Estimation: Basic Concepts
Slides for Introduction to Stochastic Search and Optimization (ISSO) by J. C. Spall CHAPTER 15 SIMULATION-BASED OPTIMIZATION II: STOCHASTIC GRADIENT AND.
Simple Linear Regression
Simple Linear Regression
Parametric Methods Berlin Chen, 2005 References:
Uncertainty Propagation
Presentation transcript:

1 Design of experiment for computer simulations Let X = (X 1,…,X p )  R p denote the vector of input values chosen for the computer program Each X j is continuously adjustable between a lower and an upper limit, or 0 and 1 after transformation Let Y = (Y 1,…,Y q )  R q denote the vector of q output quantities Y = f(X), X  [0,1] p Important considerations: The number of input p The number of output q The speed with which f can be computed They are deterministic, not stochastic Why a statistical approach is called for?

2 Design of experiment for computer simulations Conventional one-factor-at-a-time approach It may miss good combinations of X because it doesn’t fully explore the design space. It is slow, especially when p is large It may be misleading when interactions among the components of X are strong Randomness is required in order to generate probability or confidence intervals Introducing randomness by modeling the function f as a realization of a Gaussian process Introducing randomness by taking random input points

3 Goals in computer experiments Optimization Standard optimization methods (e.g. quasi-Newton or conjugate gradients) can be unsatisfactory for computer experiments as they usually require first and possibly second derivatives of f Standard methods also depend strongly on having good starting values Computer experimentation is useful in the early stages of optimization where one is searching for a suitable starting value, and for searching for several widely separated regions for the predictor space that might all have good Y values

4 Goals in computer experiments Visualization – being able to compute a function f at any given X doesn’t necessarily imply that one “understands” the function Computer simulation results can be used to help identify strong dependencies Approximation If the original program f is exceedingly expensive to evaluate, it may be approximated by some very simple function, holding adequately in a region of interest, though not necessarily over the entire domain of f Optimization may be done using large number of runs of the simple function

5 Approaches to computer experiments There are two main statistical approaches to computer experiments One is based on Bayesian statistics Another is a frequentist one based on sampling techniques It is essential to introduce randomness in both approaches Frequentist approach For a scalar function Y = f(X), consider a regression model Y = f(X)  Z(X)  The coefficients  can be determined by least squares method with respect to some distribution F on [0,1] p  LS = (  Z(X)’Z(X)dF) -1  Z(X)’f(X)dF The quality of the approximation may be assessed globally by the integrated mean squared error  (Y – Z(X)  ) 2 dF

6 Frequentist experimental design Assume the region of interest is the unit cube [0,1] p, p = 5 Grids (choose k different values for each of X 1 through X p and run all k p combinations) – works well but completely impractical when p is large. In situations where one of the responses Y k depends very strongly on only one or two of the inputs X j the grid design leads to much wasteful duplication

7 Frequentist experimental design Good lattice points (based on number theory)

8 Frequentist experimental design Latin hypercubes

9 Frequentist experimental design Randomized orthogonal arrays

10 Example – critical specimen size study

11 W critical = f(t, h; E,  y,  0, e; k) 19 mm (ANSI/AWS) 25 mm (MIL) 35 mm (ISO) 76 mm (ANSI/AWS) 102 mm (MIL) 45 m m (IS O) 25 mm (MI L) 105 mm (ISO) 19 mm (ANSI/A WS) Specimen size requirements for tensile shear tests of 0.8 mm gauge steel sheets.

12 P D Peak Load E Energy Maximum Displacement

Peak Load (kN)

14 Table 1. Ranges selected for computer simulation. t (mm)h (mm)E (GPa)  y (MPa)  0 (MPa) e (%)k 0.5~2.00.1~1.5190~200205~172550~2002~651.0~3.0 Table 2. Design matrix and simulation results. Ru n v1v1 t (mm) v2v2 h (mm) v3v3 E (MPa ) v4v4 kv5v5  y (MPa) v6v6 e (%) v7v7  uts (MPa) W criti cal (mm)

15 Coupon Size Determination Simulation A two level full factorial would require 2 7 = 128 runs In the computer experiment, N levels of each variable can be chosen (based on the number of variables n). N is also the total number of runs needed. N = 17 for seven (7) variables in the example The computer simulation results are used to create the dependence of critical specimen size on the variables by Kriging regression method

16 W critical,1 = t W critical,2 = t  y h W critical,3 = t  y h e (  uts -  y ) E h e (  uts -  y )