Optimal state space reconstruction via Monte Carlo decision tree search

Abstract

A novel idea for an optimal time delay state space reconstruction from uni- and multivariate time series is presented. The entire embedding process is considered as a game, in which each move corresponds to an embedding cycle and is subject to an evaluation through an objective function. This way the embedding procedure can be modeled as a tree, in which each leaf holds a specific value of the objective function. By using a Monte Carlo ansatz, the proposed algorithm populates the tree with many leafs by computing different possible embedding paths and the final embedding is chosen as that particular path, which ends at the leaf with the lowest achieved value of the objective function. The method aims to prevent getting stuck in a local minimum of the objective function and can be used in a modular way, enabling practitioners to choose a statistic for possible delays in each embedding cycle as well as a suitable objective function themselves. The proposed method guarantees the optimization of the chosen objective function over the parameter space of the delay embedding as long as the tree is sampled sufficiently. As a proof of concept, we demonstrate the superiority of the proposed method over the classical time delay embedding methods using a variety of application examples. We compare recurrence plot-based statistics inferred from reconstructions of a Lorenz-96 system and highlight an improved forecast accuracy for map-like model data as well as for palaeoclimate isotope time series. Finally, we utilize state space reconstruction for the detection of causality and its strength between observables of a gas turbine type thermoacoustic combustor.

Distributed 3D Environment Design System Based on Color Image Model

“…where τ d u φ x 0 represents the combination of texture pixel sets, and gradient processing techniques are used to present features using the local space and redesign the broken 3D interior design visuals [16,17].…”

Recurrence flow measure of nonlinear dependence

“…. , τ m for the different coordinates are free parameters and need to be chosen with respect to some notion of optimality [47]. The recurrence flow Φ(τ ) is computed by summing over the recurrence flow matrix φ i,j at given τ and dividing by the number of non-recurrences (i.e., zeros in the RP):…”

Spike Spectra for Recurrences

“…Then, we construct the inter-spike spectrogram of the -RR by first determining an appropriate embedding. By using a recent tree-embedding ansatz [ 36 ], we minimize the false nearest neighbor statistic [ 37 ] and use the continuity statistic [ 38 ] for potential delays. Eventually, we obtain 8-dimensional embedding with embedding delays (in sampling units) for the entire time series.…”