SearcharxivSearch

arXiv · 1807.10858

Inference of stochastic parameterizations for model error treatment using nested ensemble Kalman filters

Abstract

Stochastic parameterizations are increasingly being used to represent the uncertainty associated with model errors in ensemble forecasting and data assimilation. One of the challenges associated with the use of these parameterizations is the optimization of the properties of the stochastic forcings within their formulation. In this work a hierarchical data assimilation approach based on two nested ensemble Kalman filters is proposed for inferring parameters associated with a stochastic parameterization. The proposed technique is based on the Rao-Blackwellization of the parameter estimation problem. The technique consists in using an ensemble of ensemble Kalman filters, each of them using a different set of stochastic parameter values. We show the ability of the technique to infer parameters related to the covariance structure of stochastic representations of model error in the Lorenz-96 dynamical system. The evaluation is conducted with stochastic twin experiments and imperfect model experiments with unresolved physics in the forecast model. The proposed technique performs successfully under different model error covariance structures. The technique is proposed to be applied offline as part of an a priori optimization of the data assimilation system and could in principle be extended to the estimation of other hyperparameters of a data assimilation system.

Explore related subjects

Keep this discovery

BibTeXRIS

Guillermo Scheffler, Juan Ruiz, Manuel Pulido. 2018-07-27. Inference of stochastic parameterizations for model error treatment using nested ensemble Kalman filters. https://doi.org/10.1002/qj.3542

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO