Dicing algorithm for the degeneracy problem of the sequential importance sampling in the sequential Monte Carlo Methods순차몬테칼로에서 순차중요표본추출의 퇴보 문제를 풀기 위한 다이싱 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 524
  • Download : 0
Many problems in science and engineering require estimation of unknown quantities from a sequence of noisy and partial observations. In most cases, the problems can be easily solved, from a theoretical perspective, within a sequential Bayesian inference framework such that the unknown quantities can be inferred from posterior distributions that are recursively computed by the prior distributions of the unknown quantities and the likelihood functions of the observations. In practice, however, numerical approximate techniques are necessary due to the computational intractability of the theoretical methods. As one of the approximate techniques, Sequential Monte Carlo (SMC) methods are a class of simulation-based methods designed to use random samples to recursively simulate the posterior distributions. Over the last few years, the methods have become extremely popular with their supportability of both nonlinearity and non-Gaussianity allowing the problems to be much more realistically modeled. The basis of SMC methods is a Sequential Importance Sampling (SIS) algorithm that is a sequential version of an Importance Sampling (IS) algorithm in Monte Carlo (MC) methods. Because of the degeneracy problem of the SIS scheme, however, SMC methods only using SIS do not provide good estimation performance. To solve this problem, a Resampling algorithm is generally used. Even though it has some limitations such as the loss of diversity problem, there have been no better alternatives to the resampling scheme with respect to estimation accuracy, computational cost and algorithmic efficiency. As a result, the combination of SIS and resampling has been widely regarded as generic SMC methods in the most of literature and many advanced versions developed from the generic methods have been proposed for some improvements of the generic ones. In this thesis, we propose a novel algorithm, called Dicing, designed to not only solve the degeneracy problem of the SIS but also avoid ...
Advisors
Kim, Dae-Youngresearcher김대영researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
419157/325007  / 020084271
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2010.2, [ vi, 38 p. ]

Keywords

Resampling; Degeneracy; Sequential Importance Sampling; Sequential Monte Carlo; Loss of Diversity; 피폐; 표본재추출; 퇴보; 순차중요표본추출; 순차몬테칼로

URI
http://hdl.handle.net/10203/34906
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=419157&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0