Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2103.00318

Help | Advanced Search

Physics > Computational Physics

arXiv:2103.00318 (physics)
[Submitted on 27 Feb 2021 ]

Title: Machine Learning Techniques to Construct Patched Analog Ensembles for Data Assimilation

Title: 用于数据同化的分块模拟集合构建的机器学习技术

Authors:Lucia Minah Yang, Ian Grooms
Abstract: Using generative models from the machine learning literature to create artificial ensemble members for use within data assimilation schemes has been introduced in [Grooms QJRMS, 2020] as constructed analog ensemble optimal interpolation (cAnEnOI). Specifically, we study general and variational autoencoders for the machine learning component of this method, and combine the ideas of constructed analogs and ensemble optimal interpolation in the data assimilation piece. To extend the scalability of cAnEnOI for use in data assimilation on complex dynamical models, we propose using patching schemes to divide the global spatial domain into digestible chunks. Using patches makes training the generative models possible and has the added benefit of being able to exploit parallelism during the generative step. Testing this new algorithm on a 1D toy model, we find that larger patch sizes make it harder to train an accurate generative model (i.e. a model whose reconstruction error is small), while conversely the data assimilation performance improves at larger patch sizes. There is thus a sweet spot where the patch size is large enough to enable good data assimilation performance, but not so large that it becomes difficult to train an accurate generative model. In our tests the new patched cAnEnOI method outperforms the original (unpatched) cAnEnOI, as well as the ensemble square root filter results from [Grooms QJRMS, 2020].
Abstract: 使用机器学习文献中的生成模型来创建用于数据同化方案的人工集合成员,已在[Grooms QJRMS, 2020]中引入,称为构造模拟集合最优插值(cAnEnOI)。 具体而言,我们研究了通用和变分自编码器作为该方法机器学习组件的选项,并在数据同化部分结合了构造模拟和集合最优插值的思想。 为了扩展cAnEnOI在复杂动力模型上的可扩展性,我们提出使用补丁方案将全球空间域划分为可处理的块。 使用补丁使得训练生成模型成为可能,并且在生成步骤中能够利用并行性。 在一个一维玩具模型上测试这个新算法,我们发现较大的补丁尺寸会使训练准确的生成模型变得困难(即,其重建误差较小的模型),而相反地,数据同化性能在较大的补丁尺寸下得到改善。 因此存在一个最佳点,其中补丁尺寸足够大以实现良好的数据同化性能,但又不至于大到难以训练出准确的生成模型。 在我们的测试中,新的带补丁的cAnEnOI方法优于原始(无补丁)的cAnEnOI,以及[Grooms QJRMS, 2020]中的集合平方根滤波结果。
Comments: 21 pages, 10 figures
Subjects: Computational Physics (physics.comp-ph) ; Machine Learning (cs.LG); Computation (stat.CO)
MSC classes: 68T07, 62M45, 93E11
Cite as: arXiv:2103.00318 [physics.comp-ph]
  (or arXiv:2103.00318v1 [physics.comp-ph] for this version)
  https://doi.org/10.48550/arXiv.2103.00318
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1016/j.jcp.2021.110532
DOI(s) linking to related resources

Submission history

From: Lucia Yang [view email]
[v1] Sat, 27 Feb 2021 20:47:27 UTC (3,979 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
physics.comp-ph
< prev   |   next >
new | recent | 2021-03
Change to browse by:
cs
cs.LG
physics
stat
stat.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号