Identification of Stochastic Wiener Systems using Indirect Inference

We study identification of stochastic Wiener dynamic systems using so-called indirect inference. The main idea is to first fit an auxiliary model to the observed data and then in a second step, often by simulation, fit a more structured model to the estimated auxiliary model. This two-step procedure can be used when the direct maximum-likelihood estimate is difficult or intractable to compute. One such example is the identification of stochastic Wiener systems, i.e.,~linear dynamic systems with process noise where the output is measured using a non-linear sensor with additive measurement noise. It is in principle possible to evaluate the log-likelihood cost function using numerical integration, but the corresponding optimization problem can be quite intricate. This motivates studying consistent, but sub-optimal, identification methods for stochastic Wiener systems. We will consider indirect inference using the best linear approximation as an auxiliary model. We show that the key to obtain a reliable estimate is to use uncertainty weighting when fitting the stochastic Wiener model to the auxiliary model estimate. The main technical contribution of this paper is the corresponding asymptotic variance analysis. A numerical evaluation is presented based on a first-order finite impulse response system with a cubic non-linearity, for which certain illustrative analytic properties are derived.Comment: The 17th IFAC Symposium on System Identification, SYSID 2015, Beijing, China, October 19-21, 201

Multi-innovation stochastic gradient algorithms for dual-rate sampled systems with preload nonlinearity

AbstractSince the stochastic gradient algorithm has a slower convergence rate, this letter presents a multi-innovation stochastic gradient algorithm for a class of dual-rate sampled systems with preload nonlinearity. The basic idea is to transform the dual-rate system model into an identification model which can use dual-rate data by using the polynomial transformation technique. A simulation example is provided to verify the effectiveness of the proposed method

Least Squares Based and Two-Stage Least Squares Based Iterative Estimation Algorithms for H-FIR-MA Systems

This paper studies the identification of Hammerstein finite impulse response moving average (H-FIR-MA for short) systems. A new two-stage least squares iterative algorithm is developed to identify the parameters of the H-FIR-MA systems. The simulation cases indicate the efficiency of the proposed algorithms

Data filtering-based least squares iterative algorithm for Hammerstein nonlinear systems by using the model decomposition

This paper focuses on the iterative identification problems for a class of Hammerstein nonlinear systems. By decomposing the system into two fictitious subsystems, a decomposition-based least squares iterative algorithm is presented for estimating the parameter vector in each subsystem. Moreover, a data filtering-based decomposition least squares iterative algorithm is proposed. The simulation results indicate that the data filtering-based least squares iterative algorithm can generate more accurate parameter estimates than the least squares iterative algorithm

Combined state and parameter estimation for Hammerstein systems with time-delay using the Kalman filtering

This paper discusses the state and parameter estimation problem for a class of Hammerstein state space systems with time-delay. Both the process noise and the measurement noise are considered in the system. Based on the observable canonical state space form and the key term separation, a pseudo-linear regressive identification model is obtained. For the unknown states in the information vector, the Kalman filter is used to search for the optimal state estimates. A Kalman-filter based least squares iterative and a recursive least squares algorithms are proposed. Extending the information vector to include the latest information terms which are missed for the time-delay, the Kalman-filter based recursive extended least squares algorithm is derived to obtain the estimates of the unknown time-delay, parameters and states. The numerical simulation results are given to illustrate the effectiveness of the proposed algorithms

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

Robust H2/H∞-state estimation for discrete-time systems with error variance constraints

Copyright [1997] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper studies the problem of an H∞-norm and variance-constrained state estimator design for uncertain linear discrete-time systems. The system under consideration is subjected to time-invariant norm-bounded parameter uncertainties in both the state and measurement matrices. The problem addressed is the design of a gain-scheduled linear state estimator such that, for all admissible measurable uncertainties, the variance of the estimation error of each state is not more than the individual prespecified value, and the transfer function from disturbances to error state outputs satisfies the prespecified H∞-norm upper bound constraint, simultaneously. The conditions for the existence of desired estimators are obtained in terms of matrix inequalities, and the explicit expression of these estimators is also derived. A numerical example is provided to demonstrate various aspects of theoretical results

Identification of Input Nonlinear Control Autoregressive Systems Using Fractional Signal Processing Approach

A novel algorithm is developed based on fractional signal processing approach for parameter estimation of input nonlinear control autoregressive (INCAR) models. The design scheme consists of parameterization of INCAR systems to obtain linear-in-parameter models and to use fractional least mean square algorithm (FLMS) for adaptation of unknown parameter vectors. The performance analyses of the proposed scheme are carried out with third-order Volterra least mean square (VLMS) and kernel least mean square (KLMS) algorithms based on convergence to the true values of INCAR systems. It is found that the proposed FLMS algorithm provides most accurate and convergent results than those of VLMS and KLMS under different scenarios and by taking the low-to-high signal-to-noise ratio