{"title":"Iterated extended Kalman smoothing with expectation-propagation","authors":"A. Ypma, T. Heskes","doi":"10.1109/NNSP.2003.1318021","DOIUrl":null,"url":null,"abstract":"We formulate extended Kalman smoothing in an expectation-propagation (EP) framework. The approximation involved (a local linearization) can be looked upon as a 'collapse' of a non-Gaussian belief state onto a Gaussian form. This formulation allows us to come up with better approximations to the belief states, since we can iterate the algorithm until no further refinement of the beliefs is obtained. Compared to the standard extended Kalman smoother, we linearize around the mode of the actual two-slice belief state instead of the predicted mean of the one-slice belief. In initial experiments with a one-dimensional nonlinear dynamical system we found that our method improves over the extended Kalman filter and performs comparable to the unscented Kalman filter, whereas only second-order approximations are being made. The EP-formulation in principle allows for incorporation of higher-order approximations, possibly leading to further improvements.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NNSP.2003.1318021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
We formulate extended Kalman smoothing in an expectation-propagation (EP) framework. The approximation involved (a local linearization) can be looked upon as a 'collapse' of a non-Gaussian belief state onto a Gaussian form. This formulation allows us to come up with better approximations to the belief states, since we can iterate the algorithm until no further refinement of the beliefs is obtained. Compared to the standard extended Kalman smoother, we linearize around the mode of the actual two-slice belief state instead of the predicted mean of the one-slice belief. In initial experiments with a one-dimensional nonlinear dynamical system we found that our method improves over the extended Kalman filter and performs comparable to the unscented Kalman filter, whereas only second-order approximations are being made. The EP-formulation in principle allows for incorporation of higher-order approximations, possibly leading to further improvements.