An adjoint-free algorithm for conditional nonlinear optimal perturbations (CNOPs) via sampling

In this paper, we propose a sampling algorithm based on state-of-the-art statistical machine learning techniques to obtain conditional nonlinear optimal perturbations (CNOPs), which is different from traditional (deterministic) optimization methods.1 Specifically, the traditional approach is unavail...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Nonlinear processes in geophysics Ročník 30; číslo 3; s. 263 - 276
Hlavní autoři: Shi, Bin, Sun, Guodong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Gottingen Copernicus GmbH 06.07.2023
Copernicus Publications
Témata:
Algorithms
Analysis
Atmosphere
Atmospheric models
Burgers equation
Computation
Computing time
Fluid dynamics
General circulation models
Machine learning
Mathematical models
Methods
Modelling
Numerical models
Objective function
Ocean models
Optimization
Ordinary differential equations
Perturbation
Perturbations
Probability theory
Sampling
Viscosity
ISSN:1607-7946, 1023-5809, 1607-7946
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we propose a sampling algorithm based on state-of-the-art statistical machine learning techniques to obtain conditional nonlinear optimal perturbations (CNOPs), which is different from traditional (deterministic) optimization methods.1 Specifically, the traditional approach is unavailable in practice, which requires numerically computing the gradient (first-order information) such that the computation cost is expensive, since it needs a large number of times to run numerical models. However, the sampling approach directly reduces the gradient to the objective function value (zeroth-order information), which also avoids using the adjoint technique that is unusable for many atmosphere and ocean models and requires large amounts of storage. We show an intuitive analysis for the sampling algorithm from the law of large numbers and further present a Chernoff-type concentration inequality to rigorously characterize the degree to which the sample average probabilistically approximates the exact gradient. The experiments are implemented to obtain the CNOPs for two numerical models, the Burgers equation with small viscosity and the Lorenz-96 model. We demonstrate the CNOPs obtained with their spatial patterns, objective values, computation times, and nonlinear error growth. Compared with the performance of the three approaches, all the characters for quantifying the CNOPs are nearly consistent, while the computation time using the sampling approach with fewer samples is much shorter. In other words, the new sampling algorithm shortens the computation time to the utmost at the cost of losing little accuracy.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1607-7946
1023-5809
1607-7946
DOI:10.5194/npg-30-263-2023