The views expressed here are those of the individual authors and not necessarily those of the JSM sponsors, their officers, or their staff.
Online Program Home
Abstract Details
Activity Number:
|
356
|
Type:
|
Contributed
|
Date/Time:
|
Tuesday, July 31, 2012 : 10:30 AM to 12:20 PM
|
Sponsor:
|
Section on Statistical Learning and Data Mining
|
Abstract - #305947 |
Title:
|
Batch Sequencing Methods for Computer Experiments
|
Author(s):
|
Aaron Quan*+
|
Companies:
|
|
Address:
|
1150 Kinnear Rd., Columbus, OH, 43212, United States
|
Keywords:
|
computer experiments ;
batch ;
space filling ;
batch sequencing ;
expected improvement ;
data mining
|
Abstract:
|
Previously, computer experiments simulations have been performed with the use of a single computer. In order to take advantage of the presence of multiple computers, these simulations need to be run in batches with the batch size determined by the number of computers. Various methods to perform these simulations in batches have been proposed to supplant the approach of sampling one site at a time. The batch methods make use of expected improvement criteria and space filling designs in order to efficiently find all optima. These methods pick the site with the highest expected improvement with the rest of the batch sites selected through various methods that have the right balance of having high expected improvement and being space filling. These methods are tested on various problem types, and the results are compared and contrasted with each other to determine the ideal approach to sampling in batches.
|
The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.
Back to the full JSM 2012 program
|
2012 JSM Online Program Home
For information, contact jsm@amstat.org or phone (888) 231-3473.
If you have questions about the Continuing Education program, please contact the Education Department.