{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/34574"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/34574","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Ensemble filtering for state space models","abstract":"The state space model has been widely used in various fields including economics, finance, bioinformatics, oceanography, and tomography. The goal of the filtering problem is to find the posterior distribution of the hidden state given the current and past observations. The first part of my thesis focuses on designing efficient proposal distributions for particle filters. I propose a new approach named the augmented particle filter (APF), which combines two sets of particles from the observation and state equations. The APF can be applied to general state space models, and it does not require special structures of the model or any approximation to the target or proposal distribution. I find through simulation studies that the APF performs similarly to or better than other filtering algorithms in the literature. The convergence of the augmented particle filter has been established. The second part of my thesis develops the localization methods for particle filters in high dimensional state space models. Under high dimensional state space models, the computational constraints prevent us from having a large number of particles to avoid the degeneracy problem of the importance weights. When the dimension of the state vector is high, it is common that only a few components of the state vector are dependent on any single component or a set of a few components of the observation vector. In filtering problems, the concept of localization is to use the information in the components of the observation vector to update only the corresponding a few components of the hidden state vector. I propose the localized augmented particle filter. This new approach divides state vectors into small blocks, and it updates each block of the state vectors through state dynamics and observations. By considering blocks, the influence of observations in updating state vectors is restricted to a few blocks of the state vectors, so the localized augmented particle filter allows constructing the proposal distribution in a lower dimension than the original model. The localized augmented particle filter can outperform many other methods in the literature. The convergence of the localized augmented particle filter has been proved for some class of models. The method to improve particle filters by dividing the particles into independent batches is presented. The development of the method is motivated by the particle Markov chain Monte Carlo method proposed by Andrieu et al. (2010). Often, the combination of particle filters in batches outperforms the standard particle filter. Parallel computing techniques can be easily adapted to make the implementation fast. The convergence property of the batched particle filter has been established. As the number of batches goes to infinity, the estimate based on the combination of batches converges to the target.","abstract_html":"The state space model has been widely used in various fields including economics, finance, bioinformatics, oceanography, and tomography. The goal of the filtering problem is to find the posterior distribution of the hidden state given the current and past observations. The first part of my thesis focuses on designing efficient proposal distributions for particle filters. I propose a new approach named the augmented particle filter (APF), which combines two sets of particles from the observation and state equations. The APF can be applied to general state space models, and it does not require special structures of the model or any approximation to the target or proposal distribution. I find through simulation studies that the APF performs similarly to or better than other filtering algorithms in the literature. The convergence of the augmented particle filter has been established. The second part of my thesis develops the localization methods for particle filters in high dimensional state space models. Under high dimensional state space models, the computational constraints prevent us from having a large number of particles to avoid the degeneracy problem of the importance weights. When the dimension of the state vector is high, it is common that only a few components of the state vector are dependent on any single component or a set of a few components of the observation vector. In filtering problems, the concept of localization is to use the information in the components of the observation vector to update only the corresponding a few components of the hidden state vector. I propose the localized augmented particle filter. This new approach divides state vectors into small blocks, and it updates each block of the state vectors through state dynamics and observations. By considering blocks, the influence of observations in updating state vectors is restricted to a few blocks of the state vectors, so the localized augmented particle filter allows constructing the proposal distribution in a lower dimension than the original model. The localized augmented particle filter can outperform many other methods in the literature. The convergence of the localized augmented particle filter has been proved for some class of models. The method to improve particle filters by dividing the particles into independent batches is presented. The development of the method is motivated by the particle Markov chain Monte Carlo method proposed by Andrieu et al. (2010). Often, the combination of particle filters in batches outperforms the standard particle filter. Parallel computing techniques can be easily adapted to make the implementation fast. The convergence property of the batched particle filter has been established. As the number of batches goes to infinity, the estimate based on the combination of batches converges to the target.","abstract_has_math":false,"creators":["Yun, Jong Hyun"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Statistics","degree_department":null,"school":null,"contributors":["Chen, Yuguo","Marden, John I.","Martinsek, Adam T.","Shao, Xiaofeng"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-09-18T21:26:13Z","date_published":"2012-09-18T21:26:13Z","updated_at":"2026-07-22T22:25:31Z","subjects":["Nonlinear filtering","Sequential Monte Carlo","Particle filter","Ensemble Kalman filter","State space model","Target tracking","Augmented particle filter","Localized augmented particle filter","Particle Monte Carlo Markov chain","Lorenz model","Particle filtering with independent batches."],"languages":["en"],"rights":["Copyright 2012 by Jong Hyun Yun. All rights reserved."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/34574","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Chen, Yuguo","Marden, John I.","Martinsek, Adam T.","Shao, Xiaofeng"]},{"key":"dc:creator","label":"Author","values":["Yun, Jong Hyun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-09-18T21:26:13Z","2014-09-18T10:00:47Z","2012-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Nonlinear filtering","Sequential Monte Carlo","Particle filter","Ensemble Kalman filter","State space model","Target tracking","Augmented particle filter","Localized augmented particle filter","Particle Monte Carlo Markov chain","Lorenz model","Particle filtering with independent batches."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 by Jong Hyun Yun. All rights reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/34574"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The state space model has been widely used in various fields including economics, finance, bioinformatics, oceanography, and tomography. The goal of the filtering problem is to find the posterior distribution of the hidden state given the current and past observations. The first part of my thesis focuses on designing efficient proposal distributions for particle filters. I propose a new approach named the augmented particle filter (APF), which combines two sets of particles from the observation and state equations. The APF can be applied to general state space models, and it does not require special structures of the model or any approximation to the target or proposal distribution. I find through simulation studies that the APF performs similarly to or better than other filtering algorithms in the literature. The convergence of the augmented particle filter has been established. The second part of my thesis develops the localization methods for particle filters in high dimensional state space models. Under high dimensional state space models, the computational constraints prevent us from having a large number of particles to avoid the degeneracy problem of the importance weights. When the dimension of the state vector is high, it is common that only a few components of the state vector are dependent on any single component or a set of a few components of the observation vector. In filtering problems, the concept of localization is to use the information in the components of the observation vector to update only the corresponding a few components of the hidden state vector. I propose the localized augmented particle filter. This new approach divides state vectors into small blocks, and it updates each block of the state vectors through state dynamics and observations. By considering blocks, the influence of observations in updating state vectors is restricted to a few blocks of the state vectors, so the localized augmented particle filter allows constructing the proposal distribution in a lower dimension than the original model. The localized augmented particle filter can outperform many other methods in the literature. The convergence of the localized augmented particle filter has been proved for some class of models. The method to improve particle filters by dividing the particles into independent batches is presented. The development of the method is motivated by the particle Markov chain Monte Carlo method proposed by Andrieu et al. (2010). Often, the combination of particle filters in batches outperforms the standard particle filter. Parallel computing techniques can be easily adapted to make the implementation fast. The convergence property of the batched particle filter has been established. As the number of batches goes to infinity, the estimate based on the combination of batches converges to the target.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-07-12T14:15:43Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 Yun_Jong Hyun.pdf: 493375 bytes, checksum: 4b03868a02c118042ceca56125095639 (MD5) Yun_Jong Hyun.pdf: 489816 bytes, checksum: 5b916a2e45871524720c4c145e9c0ec4 (MD5) Yun_Jong Hyun.pdf: 493340 bytes, checksum: c7af3088a697c8d7e1508d6daf0f4d87 (MD5)","Made available in DSpace on 2012-09-18T21:26:13Z (GMT). No. of bitstreams: 2 Yun_JongHyun.pdf: 493340 bytes, checksum: c7af3088a697c8d7e1508d6daf0f4d87 (MD5) license.txt: 4054 bytes, checksum: bff7f8f44cada4db18286da2766f3b62 (MD5)","Item marked as restricted to the 'Administrator' Group (id=1) by Seth Robbins (srobbins@illinois.edu) on 2012-09-18T21:27:34Z Item is restricted until 2014-09-18T21:27:16Z","Restriction data tranferred 2014-07-01T11:35:52-05:00 Original Data Group with Access Administrator Release Date: 2014-09-18 16:27:16 UTC Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 34848 on 2014-09-18T10:00:47Z."]},{"key":"dc:title","label":"Title","values":["Ensemble filtering for state space models"]}]}],"canonical_facts":{"dc:contributor":["Chen, Yuguo","Marden, John I.","Martinsek, Adam T.","Shao, Xiaofeng"],"dc:creator":["Yun, Jong Hyun"],"dc:date":["2012-09-18T21:26:13Z","2014-09-18T10:00:47Z","2012-08"],"dc:description":["The state space model has been widely used in various fields including economics, finance, bioinformatics, oceanography, and tomography. The goal of the filtering problem is to find the posterior distribution of the hidden state given the current and past observations. The first part of my thesis focuses on designing efficient proposal distributions for particle filters. I propose a new approach named the augmented particle filter (APF), which combines two sets of particles from the observation and state equations. The APF can be applied to general state space models, and it does not require special structures of the model or any approximation to the target or proposal distribution. I find through simulation studies that the APF performs similarly to or better than other filtering algorithms in the literature. The convergence of the augmented particle filter has been established. The second part of my thesis develops the localization methods for particle filters in high dimensional state space models. Under high dimensional state space models, the computational constraints prevent us from having a large number of particles to avoid the degeneracy problem of the importance weights. When the dimension of the state vector is high, it is common that only a few components of the state vector are dependent on any single component or a set of a few components of the observation vector. In filtering problems, the concept of localization is to use the information in the components of the observation vector to update only the corresponding a few components of the hidden state vector. I propose the localized augmented particle filter. This new approach divides state vectors into small blocks, and it updates each block of the state vectors through state dynamics and observations. By considering blocks, the influence of observations in updating state vectors is restricted to a few blocks of the state vectors, so the localized augmented particle filter allows constructing the proposal distribution in a lower dimension than the original model. The localized augmented particle filter can outperform many other methods in the literature. The convergence of the localized augmented particle filter has been proved for some class of models. The method to improve particle filters by dividing the particles into independent batches is presented. The development of the method is motivated by the particle Markov chain Monte Carlo method proposed by Andrieu et al. (2010). Often, the combination of particle filters in batches outperforms the standard particle filter. Parallel computing techniques can be easily adapted to make the implementation fast. The convergence property of the batched particle filter has been established. As the number of batches goes to infinity, the estimate based on the combination of batches converges to the target.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-07-12T14:15:43Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 Yun_Jong Hyun.pdf: 493375 bytes, checksum: 4b03868a02c118042ceca56125095639 (MD5) Yun_Jong Hyun.pdf: 489816 bytes, checksum: 5b916a2e45871524720c4c145e9c0ec4 (MD5) Yun_Jong Hyun.pdf: 493340 bytes, checksum: c7af3088a697c8d7e1508d6daf0f4d87 (MD5)","Made available in DSpace on 2012-09-18T21:26:13Z (GMT). No. of bitstreams: 2 Yun_JongHyun.pdf: 493340 bytes, checksum: c7af3088a697c8d7e1508d6daf0f4d87 (MD5) license.txt: 4054 bytes, checksum: bff7f8f44cada4db18286da2766f3b62 (MD5)","Item marked as restricted to the 'Administrator' Group (id=1) by Seth Robbins (srobbins@illinois.edu) on 2012-09-18T21:27:34Z Item is restricted until 2014-09-18T21:27:16Z","Restriction data tranferred 2014-07-01T11:35:52-05:00 Original Data Group with Access Administrator Release Date: 2014-09-18 16:27:16 UTC Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 34848 on 2014-09-18T10:00:47Z."],"dc:identifier":["http://hdl.handle.net/2142/34574"],"dc:language":["en"],"dc:rights":["Copyright 2012 by Jong Hyun Yun. All rights reserved."],"dc:subject":["Nonlinear filtering","Sequential Monte Carlo","Particle filter","Ensemble Kalman filter","State space model","Target tracking","Augmented particle filter","Localized augmented particle filter","Particle Monte Carlo Markov chain","Lorenz model","Particle filtering with independent batches."],"dc:title":["Ensemble filtering for state space models"],"thesis:degree_discipline":["Statistics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:31Z"}