Piecewise smooth system identification in reproducing kernel Hilbert space

Fabien Lauer (1) , Gérard Bloch (2)

1 ABC - Machine Learning and Computational Biology
2 CRAN - Centre de Recherche en Automatique de Nancy

The paper extends the recent approach of Ohlsson and Ljung for piecewise affine system identification to the nonlinear case while taking a clustering point of view. In this approach, the problem is cast as the minimization of a convex cost function implementing a trade-off between the fit to the data and a sparsity prior on the number of pieces. Here, we consider the nonlinear case of piecewise smooth system identification without prior knowledge on the type of nonlinearities involved. This is tackled by simultaneously learning a collection of local models from a reproducing kernel Hilbert space via the minimization of a convex functional, for which we prove a representer theorem that provides the explicit form of the solution. An example of application to piecewise smooth system identification shows that both the mode and the nonlinear local models can be accurately estimated.

Mots clés: System identification; estimation; learning; regression kernel methods; hybrid systems

Domaines: Automatique / Robotique; Apprentissage [cs.LG]

Fabien Lauer, Gérard Bloch. Piecewise smooth system identification in reproducing kernel Hilbert space. 53rd IEEE Conference on Decision and Control, CDC 2014, Dec 2014, Los Angeles, United States. ⟨hal-01059957⟩