SearcharxivSearch

arXiv · 1510.00292

On Classification Issues within Ensemble-Based Complex System Simulation Tasks

Abstract

Contemporary tasks of complex system simulation are often related to the issue of uncertainty management. It comes from the lack of information or knowledge about the simulated system as well as from restrictions of the model set being used. One of the powerful tools for the uncertainty management is ensemble-based simulation, which uses variation in input or output data, model parameters, or available versions of models to improve the simulation performance. Furthermore the system of models for complex system simulation (especially in case of hiring ensemble-based approach) can be considered as a complex system. As a result, the identification of the complex model's structure and parameters provide additional sources of uncertainty to be managed. Within the presented work we are developing a conceptual and technological approach to manage the ensemble-based simulation taking into account changing states of both simulated system and system of models within the ensemble-based approach. The states of these systems are considered as a subject of classification with consequent inference of better strategies for ensemble evolution over the simulation time and ensemble aggregation. Here the ensemble evolution enables implementation of dynamic reactive solutions which can automatically conform to the changing states of both systems. The ensemble aggregation can be considered within a scope of averaging (regression way) or selection (classification way, which complement the classification mentioned earlier) approach. The technological basis for such approach includes ensemble-based simulation techniques using domain-specific software combined within a composite application; data science approaches for analysis of available datasets (simulation data, observations, situation assessment etc.); and machine learning algorithms for classes identification, ensemble management and knowledge acquisition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey V. Kovalchuk, Aleksey V. Krikunov, Konstantin V. Knyazkov, Sergey S. Kosukhin, Alexander V. Boukhanovsky. 2016-03-18. On Classification Issues within Ensemble-Based Complex System Simulation Tasks. https://doi.org/10.1007/s00477-016-1324-5

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