An Ensemble Information Filter: Learning and Encoding Sparse Structures in Ensemble Kalman Methods
集成信息滤波:在集成卡尔曼方法中学习与编码稀疏结构AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用高维数据同化与稀疏精度矩阵,未明确对应所列经济计量细分方向。
集成信息滤波:在集成卡尔曼方法中学习与编码稀疏结构AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Ensemble-based Data Assimilation faces significant challenges in high-dimensional systems due to spurious correlations and ensemble collapse. We propose the Ensemble Information Filter, which addresses these issues by encoding locality directly in the precision matrix through sparse Markov structure. This approach is motivated by connections to SPDE-based models, where local operators induce sparse precision representations and provide a principled form of regularisation. The framework further incorporates sparse regression for learning the observation operator, enabling stable inference in regimes where $p \gg n$. By enforcing structure prior to estimation, EnIF avoids the need for heuristic localisation and improves both statistical and computational scalability. The methodology is demonstrated on filtering, smoothing, and parameter estimation problems, where it adapts to the underlying dependence structure and yields stable and efficient inference in high-dimensional systems.