Decomposition-based recursive least squares identification methods for multivariate pseudo-linear systems using the multi-innovation

© 2018 Informa UK Limited, trading as Taylor & Francis Group. This paper studies the parameter estimation algorithms of multivariate pseudo-linear autoregressive systems. A decomposition-based recursive generalised least squares algorithm is deduced for estimating the system parameters by decomposing the multivariate pseudo-linear autoregressive system into two subsystems. In order to further improve the parameter accuracy, a decomposition based multi-innovation recursive generalised least squares algorithm is developed by means of the multi-innovation theory. The simulation results confirm that these two algorithms are effective

Modeling sparse connectivity between underlying brain sources for EEG/MEG

We propose a novel technique to assess functional brain connectivity in EEG/MEG signals. Our method, called Sparsely-Connected Sources Analysis (SCSA), can overcome the problem of volume conduction by modeling neural data innovatively with the following ingredients: (a) the EEG is assumed to be a linear mixture of correlated sources following a multivariate autoregressive (MVAR) model, (b) the demixing is estimated jointly with the source MVAR parameters, (c) overfitting is avoided by using the Group Lasso penalty. This approach allows to extract the appropriate level cross-talk between the extracted sources and in this manner we obtain a sparse data-driven model of functional connectivity. We demonstrate the usefulness of SCSA with simulated data, and compare to a number of existing algorithms with excellent results.Comment: 9 pages, 6 figure

Gradient-based iterative parameter estimation for bilinear-in-parameter systems using the model decomposition technique

The parameter estimation issues of a block-oriented non-linear system that is bilinear in the parameters are studied, i.e. the bilinear-in-parameter system. Using the model decomposition technique, the bilinear-in-parameter model is decomposed into two fictitious submodels: one containing the unknown parameters in the non-linear block and the other containing the unknown parameters in the linear dynamic one and the noise model. Then a gradient-based iterative algorithm is proposed to estimate all the unknown parameters by formulating and minimising two criterion functions. The stochastic gradient algorithms are provided for comparison. The simulation results indicate that the proposed iterative algorithm can give higher parameter estimation accuracy than the stochastic gradient algorithms

Integrated Pre-Processing for Bayesian Nonlinear System Identification with Gaussian Processes

We introduce GP-FNARX: a new model for nonlinear system identification based on a nonlinear autoregressive exogenous model (NARX) with filtered regressors (F) where the nonlinear regression problem is tackled using sparse Gaussian processes (GP). We integrate data pre-processing with system identification into a fully automated procedure that goes from raw data to an identified model. Both pre-processing parameters and GP hyper-parameters are tuned by maximizing the marginal likelihood of the probabilistic model. We obtain a Bayesian model of the system's dynamics which is able to report its uncertainty in regions where the data is scarce. The automated approach, the modeling of uncertainty and its relatively low computational cost make of GP-FNARX a good candidate for applications in robotics and adaptive control.Comment: Proceedings of the 52th IEEE International Conference on Decision and Control (CDC), Firenze, Italy, December 201

Parameter estimation algorithm for multivariable controlled autoregressive autoregressive moving average systems

This paper investigates parameter estimation problems for multivariable controlled autoregressive autoregressive moving average (M-CARARMA) systems. In order to improve the performance of the standard multivariable generalized extended stochastic gradient (M-GESG) algorithm, we derive a partially coupled generalized extended stochastic gradient algorithm by using the auxiliary model. In particular, we divide the identification model into several subsystems based on the hierarchical identification principle and estimate the parameters using the coupled relationship between these subsystems. The simulation results show that the new algorithm can give more accurate parameter estimates of the M-CARARMA system than the M-GESG algorithm

Partially coupled gradient estimation algorithm for multivariable equation-error autoregressive moving average systems using the data filtering technique

System identification provides many convenient and useful methods for engineering modelling. This study targets the parameter identification problems for multivariable equation-error autoregressive moving average systems. To reduce the influence of the coloured noises on the parameter estimation, the data filtering technique is adopted to filter the input and output data, and to transform the original system into a filtered system with white noises. Then the filtered system is decomposed into several subsystems and a filtering-based partially-coupled generalised extended stochastic gradient algorithm is developed via the coupling concept. In contrast to the multivariable generalised extended stochastic gradient algorithm, the proposed algorithm can give more accurate parameter estimates. Finally, the effectiveness of the proposed algorithm is well demonstrated by simulation examples

Linear State Models for Volatility Estimation and Prediction

This report covers the important topic of stochastic volatility modelling with an emphasis on linear state models. The approach taken focuses on comparing models based on their ability to fit the data and their forecasting performance. To this end several parsimonious stochastic volatility models are estimated using realised volatility, a volatility proxy from high frequency stock price data. The results indicate that a hidden state space model performs the best among the realised volatility-based models under consideration. For the state space model different sampling intervals are compared based on in-sample prediction performance. The comparisons are partly based on the multi-period prediction results that are derived in this report

Least squares-based iterative identification methods for linear-in-parameters systems using the decomposition technique

By extending the least squares-based iterative (LSI) method, this paper presents a decomposition-based LSI (D-LSI) algorithm for identifying linear-in-parameters systems and an interval-varying D-LSI algorithm for handling the identification problems of missing-data systems. The basic idea is to apply the hierarchical identification principle to decompose the original system into two fictitious sub-systems and then to derive new iterative algorithms to estimate the parameters of each sub-system. Compared with the LSI algorithm and the interval-varying LSI algorithm, the decomposition-based iterative algorithms have less computational load. The numerical simulation results demonstrate that the proposed algorithms work quite well