國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Adaptive Computer Experiments for Me...

Erickson, Collin B.

Adaptive Computer Experiments for Metamodeling.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Adaptive Computer Experiments for Metamodeling.
作者:	Erickson, Collin B.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2019
面頁冊數:	173 p.
附註:	Source: Dissertations Abstracts International, Volume: 81-03, Section: B.
附註:	Advisor: Ankenman, Bruce E.;Plumlee, Matthew.
Contained By:	Dissertations Abstracts International81-03B.
標題:	Industrial engineering.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13884002
ISBN:	9781085643016

Adaptive Computer Experiments for Metamodeling.
Erickson, Collin B.

Adaptive Computer Experiments for Metamodeling. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 173 p.

Source: Dissertations Abstracts International, Volume: 81-03, Section: B.

Thesis (Ph.D.)--Northwestern University, 2019.

This item must not be sold to any third party vendors.

Computer simulation experiments are commonly used as an inexpensive alternative to real-world experiments to form a metamodel that approximates the input-output relationship of the real-world experiment. The metamodel can be useful for decision making and making predictions for inputs that have not been evaluated yet since it can be evaluated much faster than the actual simulation. The two main components of computer experiments are choosing which input points to evaluate and building a statistical model, called a metamodel, using the data that can be used to approximate the simulation output. In this dissertation, we study three problems in computer experiments.First, we investigate Gaussian process models, one of the most commonly used types of metamodel. We find that, despite implementing nearly the same model, different software implementations fit to the same data can provide very different predictions. The difference in time it takes to fit each model can also vary by orders of magnitude across the software implementations.Second, we propose a new algorithm for running sequential computer experiments when the user wants to have better prediction accuracy in regions where the simulation output varies the most. In sequential experiments, the data is gathered in batches, and data from previous batches can help inform the choice of which points to select in following batches. We assert that practitioners often have a goal of fitting the entire surface reasonably well, but want to have better prediction accuracy in regions that are more interesting to them. This goal can be achieved by changing the criterion that is used each iteration to choose which points to evaluate next.Third, we devise a new algorithm for adaptive computer experiments that allows for the construction of a metamodel using large amounts of data. Gaussian process models are infeasible for more than a couple thousand points because of computational demands. Using the sparse grid designs of Plumlee [2014], Gaussian process inference can be done on over 100,000 points. We build upon this work to allow for data to be added adaptively in order to focus simulation effort in the input dimensions that are harder to predict.

ISBN: 9781085643016Subjects--Topical Terms:

200218
Industrial engineering.

Adaptive Computer Experiments for Metamodeling.
LDR:03194nmm a2200301 4500 001 570775
005 20200514111956.5
008 200901s2019 ||||||||||||||||| ||eng d
020 $a 9781085643016
035 $a (MiAaPQ)AAI13884002
035 $a AAI13884002
040 $a MiAaPQ $c MiAaPQ
100 1 $a Erickson, Collin B. $3 857470
245 1 0 $a Adaptive Computer Experiments for Metamodeling.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 173 p.
500 $a Source: Dissertations Abstracts International, Volume: 81-03, Section: B.
500 $a Advisor: Ankenman, Bruce E.;Plumlee, Matthew.
502 $a Thesis (Ph.D.)--Northwestern University, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a Computer simulation experiments are commonly used as an inexpensive alternative to real-world experiments to form a metamodel that approximates the input-output relationship of the real-world experiment. The metamodel can be useful for decision making and making predictions for inputs that have not been evaluated yet since it can be evaluated much faster than the actual simulation. The two main components of computer experiments are choosing which input points to evaluate and building a statistical model, called a metamodel, using the data that can be used to approximate the simulation output. In this dissertation, we study three problems in computer experiments.First, we investigate Gaussian process models, one of the most commonly used types of metamodel. We find that, despite implementing nearly the same model, different software implementations fit to the same data can provide very different predictions. The difference in time it takes to fit each model can also vary by orders of magnitude across the software implementations.Second, we propose a new algorithm for running sequential computer experiments when the user wants to have better prediction accuracy in regions where the simulation output varies the most. In sequential experiments, the data is gathered in batches, and data from previous batches can help inform the choice of which points to select in following batches. We assert that practitioners often have a goal of fitting the entire surface reasonably well, but want to have better prediction accuracy in regions that are more interesting to them. This goal can be achieved by changing the criterion that is used each iteration to choose which points to evaluate next.Third, we devise a new algorithm for adaptive computer experiments that allows for the construction of a metamodel using large amounts of data. Gaussian process models are infeasible for more than a couple thousand points because of computational demands. Using the sparse grid designs of Plumlee [2014], Gaussian process inference can be done on over 100,000 points. We build upon this work to allow for data to be added adaptively in order to focus simulation effort in the input dimensions that are harder to predict.
590 $a School code: 0163.
650 4 $a Industrial engineering. $3 200218
650 4 $a Statistics. $3 182057
690 $a 0546
690 $a 0463
710 2 $a Northwestern University. $b Industrial Engineering and Management Sciences. $3 603247
773 0 $t Dissertations Abstracts International $g 81-03B.
790 $a 0163
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13884002