The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-11-15 DOI:10.1137/24m1628207
J. A. Carrillo, F. Hoffmann, A. M. Stuart, U. Vaes
{"title":"The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting","authors":"J. A. Carrillo, F. Hoffmann, A. M. Stuart, U. Vaes","doi":"10.1137/24m1628207","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 6, Page 2549-2587, December 2024. <br/> Abstract. The ensemble Kalman filter is widely used in applications because, for high-dimensional filtering problems, it has a robustness that is not shared, for example, by the particle filter; in particular, it does not suffer from weight collapse. However, there is no theory which quantifies its accuracy as an approximation of the true filtering distribution, except in the Gaussian setting. To address this issue, we provide the first analysis of the accuracy of the ensemble Kalman filter beyond the Gaussian setting. We prove two types of results: The first type comprises a stability estimate controlling the error made by the ensemble Kalman filter in terms of the difference between the true filtering distribution and a nearby Gaussian, and the second type uses this stability result to show that, in a neighborhood of Gaussian problems, the ensemble Kalman filter makes a small error in comparison with the true filtering distribution. Our analysis is developed for the mean-field ensemble Kalman filter. We rewrite the update equations for this filter and for the true filtering distribution in terms of maps on probability measures. We introduce a weighted total variation metric to estimate the distance between the two filters, and we prove various stability estimates for the maps defining the evolution of the two filters in this metric. Using these stability estimates, we prove results of the first and second types in the weighted total variation metric. We also provide a generalization of these results to the Gaussian projected filter, which can be viewed as a mean-field description of the unscented Kalman filter.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"29 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/24m1628207","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Numerical Analysis, Volume 62, Issue 6, Page 2549-2587, December 2024.
Abstract. The ensemble Kalman filter is widely used in applications because, for high-dimensional filtering problems, it has a robustness that is not shared, for example, by the particle filter; in particular, it does not suffer from weight collapse. However, there is no theory which quantifies its accuracy as an approximation of the true filtering distribution, except in the Gaussian setting. To address this issue, we provide the first analysis of the accuracy of the ensemble Kalman filter beyond the Gaussian setting. We prove two types of results: The first type comprises a stability estimate controlling the error made by the ensemble Kalman filter in terms of the difference between the true filtering distribution and a nearby Gaussian, and the second type uses this stability result to show that, in a neighborhood of Gaussian problems, the ensemble Kalman filter makes a small error in comparison with the true filtering distribution. Our analysis is developed for the mean-field ensemble Kalman filter. We rewrite the update equations for this filter and for the true filtering distribution in terms of maps on probability measures. We introduce a weighted total variation metric to estimate the distance between the two filters, and we prove various stability estimates for the maps defining the evolution of the two filters in this metric. Using these stability estimates, we prove results of the first and second types in the weighted total variation metric. We also provide a generalization of these results to the Gaussian projected filter, which can be viewed as a mean-field description of the unscented Kalman filter.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
平均场集合卡尔曼滤波器:近高斯背景
SIAM 数值分析期刊》,第 62 卷,第 6 期,第 2549-2587 页,2024 年 12 月。 摘要集合卡尔曼滤波在应用中被广泛使用,因为对于高维滤波问题,集合卡尔曼滤波具有粒子滤波所不具备的鲁棒性,特别是它不会出现权重崩溃。然而,除高斯分布外,目前还没有一种理论能量化它作为真实滤波分布近似值的准确性。为了解决这个问题,我们首次分析了高斯环境之外的集合卡尔曼滤波器的精度。我们证明了两类结果:第一类结果包括控制集合卡尔曼滤波器误差的稳定性估计,即真实滤波分布与邻近高斯分布之间的差值;第二类结果利用这一稳定性结果表明,在邻近高斯问题中,集合卡尔曼滤波器与真实滤波分布相比误差很小。我们的分析是针对均值场集合卡尔曼滤波器展开的。我们用概率度量的映射重写了该滤波器和真实滤波分布的更新方程。我们引入了一个加权总变化度量来估算两个滤波器之间的距离,并证明了在此度量中定义两个滤波器演化的映射的各种稳定性估计值。利用这些稳定性估计,我们证明了加权总变化度量中的第一和第二类结果。我们还将这些结果推广到了高斯投影滤波器,这可以看作是对无符号卡尔曼滤波器的均值场描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
期刊最新文献
On the Existence of Minimizers in Shallow Residual ReLU Neural Network Optimization Landscapes A Domain Decomposition Method for Stochastic Evolution Equations New Time Domain Decomposition Methods for Parabolic Optimal Control Problems II: Neumann–Neumann Algorithms The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting The Lanczos Tau Framework for Time-Delay Systems: Padé Approximation and Collocation Revisited
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1