Nonlinear System Identification Via Direct Weight Optimization
2005 (English)Report (Other academic)
A general framework for estimating nonlinear functions and systems is described and analyzed in this paper. Identification of a system is seen as estimation of a predictor function. The considered predictor function estimate at a particular point is defined to be affine in the observed outputs, and the estimate is defined by the weights in this expression. For each given point, the maximal mean-square error (or an upper bound) of the function estimate over a class of possible true functions is minimized with respect to the weights, which is a convex optimization problem. This gives different types of algorithms depending on the chosen function class. It is shown how the classical linear least squares is obtained as a special case and how unknown-but-bounded disturbances can be handled. Most of the paper deals with the method applied to locally smooth predictor functions. It is shown how this leads to local estimators with a finite bandwidth, meaning that only observations in a neighborhood of the target point will be used in the estimate. The size of this neighborhood (the bandwidth) is automatically computed and reflects the noise level in the data and the smoothness priors. The approach is applied to a number of dynamical systems to illustrate its potential.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2005. , 33 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2696
Nonparametric identification, Function approximation, Minimax techniques, Quadratic programming, Nonlinear systems, Mean-square error, Local structures
IdentifiersURN: urn:nbn:se:liu:diva-56033ISRN: LiTH-ISY-R-2696OAI: oai:DiVA.org:liu-56033DiVA: diva2:316912