pith. sign in

arxiv: 2204.00769 · v1 · pith:XP7Q4E4Qnew · submitted 2022-04-02 · 📊 stat.ML · cs.LG· cs.SY· eess.SP· eess.SY

Variational message passing for online polynomial NARMAX identification

classification 📊 stat.ML cs.LGcs.SYeess.SPeess.SY
keywords variationalestimatoronlinebayesianformgraphidentificationinference
0
0 comments X
read the original abstract

We propose a variational Bayesian inference procedure for online nonlinear system identification. For each output observation, a set of parameter posterior distributions is updated, which is then used to form a posterior predictive distribution for future outputs. We focus on the class of polynomial NARMAX models, which we cast into probabilistic form and represent in terms of a Forney-style factor graph. Inference in this graph is efficiently performed by a variational message passing algorithm. We show empirically that our variational Bayesian estimator outperforms an online recursive least-squares estimator, most notably in small sample size settings and low noise regimes, and performs on par with an iterative least-squares estimator trained offline.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.