通过优化最大均值差异实现集合传输滤波器

Dengfei Zeng, Lijian Jiang
{"title":"通过优化最大均值差异实现集合传输滤波器","authors":"Dengfei Zeng, Lijian Jiang","doi":"arxiv-2407.11518","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new ensemble-based filter method by\nreconstructing the analysis step of the particle filter through a transport\nmap, which directly transports prior particles to posterior particles. The\ntransport map is constructed through an optimization problem described by the\nMaximum Mean Discrepancy loss function, which matches the expectation\ninformation of the approximated posterior and reference posterior. The proposed\nmethod inherits the accurate estimation of the posterior distribution from\nparticle filtering. To improve the robustness of Maximum Mean Discrepancy, a\nvariance penalty term is used to guide the optimization. It prioritizes\nminimizing the discrepancy between the expectations of highly informative\nstatistics for the approximated and reference posteriors. The penalty term\nsignificantly enhances the robustness of the proposed method and leads to a\nbetter approximation of the posterior. A few numerical examples are presented\nto illustrate the advantage of the proposed method over the ensemble Kalman\nfilter.","PeriodicalId":501323,"journal":{"name":"arXiv - STAT - Other Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ensemble Transport Filter via Optimized Maximum Mean Discrepancy\",\"authors\":\"Dengfei Zeng, Lijian Jiang\",\"doi\":\"arxiv-2407.11518\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new ensemble-based filter method by\\nreconstructing the analysis step of the particle filter through a transport\\nmap, which directly transports prior particles to posterior particles. The\\ntransport map is constructed through an optimization problem described by the\\nMaximum Mean Discrepancy loss function, which matches the expectation\\ninformation of the approximated posterior and reference posterior. The proposed\\nmethod inherits the accurate estimation of the posterior distribution from\\nparticle filtering. To improve the robustness of Maximum Mean Discrepancy, a\\nvariance penalty term is used to guide the optimization. It prioritizes\\nminimizing the discrepancy between the expectations of highly informative\\nstatistics for the approximated and reference posteriors. The penalty term\\nsignificantly enhances the robustness of the proposed method and leads to a\\nbetter approximation of the posterior. A few numerical examples are presented\\nto illustrate the advantage of the proposed method over the ensemble Kalman\\nfilter.\",\"PeriodicalId\":501323,\"journal\":{\"name\":\"arXiv - STAT - Other Statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Other Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.11518\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Other Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.11518","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种新的基于集合的滤波方法,它通过一个传输图(transportmap)来重新构建粒子滤波的分析步骤,直接将先验粒子传输到后验粒子。传输图是通过最大均差损失函数(Maximum Mean Discrepancy loss function)描述的优化问题构建的,它匹配了近似后验和参考后验的期望信息。所提出的方法继承了粒子滤波法对后验分布的精确估计。为了提高最大均差法的鲁棒性,使用了方差惩罚项来指导优化。它优先最小化近似后验和参考后验的高信息量统计期望之间的差异。惩罚项显著增强了所提方法的鲁棒性,并使后验的近似度更高。本文列举了几个数值示例来说明所提方法相对于集合卡尔曼滤波器的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ensemble Transport Filter via Optimized Maximum Mean Discrepancy
In this paper, we present a new ensemble-based filter method by reconstructing the analysis step of the particle filter through a transport map, which directly transports prior particles to posterior particles. The transport map is constructed through an optimization problem described by the Maximum Mean Discrepancy loss function, which matches the expectation information of the approximated posterior and reference posterior. The proposed method inherits the accurate estimation of the posterior distribution from particle filtering. To improve the robustness of Maximum Mean Discrepancy, a variance penalty term is used to guide the optimization. It prioritizes minimizing the discrepancy between the expectations of highly informative statistics for the approximated and reference posteriors. The penalty term significantly enhances the robustness of the proposed method and leads to a better approximation of the posterior. A few numerical examples are presented to illustrate the advantage of the proposed method over the ensemble Kalman filter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Censored Data Forecasting: Applying Tobit Exponential Smoothing with Time Aggregation How to survive the Squid Games using probability theory Cross-sectional personal network analysis of adult smoking in rural areas Modeling information spread across networks with communities using a multitype branching process framework Asymptotic confidence intervals for the difference and the ratio of the weighted kappa coefficients of two diagnostic tests subject to a paired design
×
引用
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