大葉大學圖書館 |

登入

回首頁

Structured database Monte Carlo (SDM...

Boston University.

Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation.
作者:	Zhao, Gang.
面頁冊數:	91 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7064.
Contained By:	Dissertation Abstracts International71-11B.
標題:	Engineering, Industrial.
標題:	Operations Research.
ISBN:	9781124297842
摘要、提要註:	Monte Carlo (MC) simulation is a very general and flexible method for estimation of quantities of interest in stochastic models used in diverse areas of science and engineering. While the convergence rate of the method, by contrast to deterministic algorithms, does not grow with problem dimension and depends only on the number of random samples, its computational cost can be substantial due to the slow rate of convergence of the MC estimator. As a result, a large class of efficient Monte Carlo algorithms involves methods to reduce the variance of the MC estimator. They are referred to as Variance Reduction Techniques (VRTs). Most of these techniques cannot be generically applied and depend on special features of the specific estimation problems that need to be discovered by users one problem type at a time.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430454

Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation.
Zhao, Gang.

Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation. - 91 p.

Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7064.

Thesis (Ph.D.)--Boston University, 2011.

Monte Carlo (MC) simulation is a very general and flexible method for estimation of quantities of interest in stochastic models used in diverse areas of science and engineering. While the convergence rate of the method, by contrast to deterministic algorithms, does not grow with problem dimension and depends only on the number of random samples, its computational cost can be substantial due to the slow rate of convergence of the MC estimator. As a result, a large class of efficient Monte Carlo algorithms involves methods to reduce the variance of the MC estimator. They are referred to as Variance Reduction Techniques (VRTs). Most of these techniques cannot be generically applied and depend on special features of the specific estimation problems that need to be discovered by users one problem type at a time.

ISBN: 9781124297842Subjects--Topical Terms:

423093
Engineering, Industrial.

Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation.
LDR:03032nam 2200301 4500 001 345092
005 20110620110233.5
008 110817s2011 ||||||||||||||||| ||eng d
020 $a 9781124297842
035 $a (UMI)AAI3430454
035 $a AAI3430454
040 $a UMI $c UMI
100 1 $a Zhao, Gang. $3 423569
245 1 0 $a Structured database Monte Carlo (SDMC): An approach to efficient parametric estimation.
300 $a 91 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7064.
500 $a Adviser: Pirooz Vakili.
502 $a Thesis (Ph.D.)--Boston University, 2011.
520 $a Monte Carlo (MC) simulation is a very general and flexible method for estimation of quantities of interest in stochastic models used in diverse areas of science and engineering. While the convergence rate of the method, by contrast to deterministic algorithms, does not grow with problem dimension and depends only on the number of random samples, its computational cost can be substantial due to the slow rate of convergence of the MC estimator. As a result, a large class of efficient Monte Carlo algorithms involves methods to reduce the variance of the MC estimator. They are referred to as Variance Reduction Techniques (VRTs). Most of these techniques cannot be generically applied and depend on special features of the specific estimation problems that need to be discovered by users one problem type at a time.
520 $a In this thesis it is assumed that the estimation problem depends on a model or decision parameter. In this parametric setting a new class of efficient MC algorithms, called Structured Database Monte Carlo (SDMC), is introduced that can be generically used in a wide class of parametric estimation problems. The approach relies on computational learning at a nominal parameter value in order to gain efficiency when estimating at neighboring parameters and is based on the variance reduction technique of stratification.
520 $a To analyze the convergence properties of the algorithm a novel connection between variance reduction techniques and the framework of Information Based Complexity (IBC) is established. It is shown that under some assumptions the SDMC algorithm achieves the optimal convergence rate. Additional optimal properties of the algorithm are established. Computational experiments are provided to illustrate the significant computational efficiencies that can be gained. Settings under which the direct application of the approach is not appropriate or effective are discussed and variants of the algorithm that can be used in these setting are presented. Extensions of the approach to problems where the perturbation is in model dynamics rather than model parameters are provided.
590 $a School code: 0017.
650 4 $a Engineering, Industrial. $3 423093
650 4 $a Operations Research. $3 423094
690 $a 0546
690 $a 0796
710 2 $a Boston University. $3 422950
773 0 $t Dissertation Abstracts International $g 71-11B.
790 1 0 $a Vakili, Pirooz, $e advisor
790 $a 0017
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430454

筆 0 讀者評論

多媒體

多媒體檔案
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430454

評論

新增評論分享你的心得

Export

取書館別