Estimation of Switched Markov Polynomial NARX models
- URL: http://arxiv.org/abs/2009.14073v1
- Date: Tue, 29 Sep 2020 15:00:47 GMT
- Title: Estimation of Switched Markov Polynomial NARX models
- Authors: Alessandro Brusaferri and Matteo Matteucci and Stefano Spinelli
- Abstract summary: We identify a class of models for hybrid dynamical systems characterized by nonlinear autoregressive (NARX) components.
The proposed approach is demonstrated on a SMNARX problem composed by three nonlinear sub-models with specific regressors.
- Score: 75.91002178647165
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This work targets the identification of a class of models for hybrid
dynamical systems characterized by nonlinear autoregressive exogenous (NARX)
components, with finite-dimensional polynomial expansions, and by a Markovian
switching mechanism. The estimation of the model parameters is performed under
a probabilistic framework via Expectation Maximization, including submodel
coefficients, hidden state values and transition probabilities. Discrete mode
classification and NARX regression tasks are disentangled within the
iterations. Soft-labels are assigned to latent states on the trajectories by
averaging over the state posteriors and updated using the parametrization
obtained from the previous maximization phase. Then, NARXs parameters are
repeatedly fitted by solving weighted regression subproblems through a cyclical
coordinate descent approach with coordinate-wise minimization. Moreover, we
investigate a two stage selection scheme, based on a l1-norm bridge estimation
followed by hard-thresholding, to achieve parsimonious models through selection
of the polynomial expansion. The proposed approach is demonstrated on a SMNARX
problem composed by three nonlinear sub-models with specific regressors.
Related papers
- Variational EP with Probabilistic Backpropagation for Bayesian Neural
Networks [0.0]
I propose a novel approach for nonlinear Logistic regression using a two-layer neural network (NN) model structure with hierarchical priors on the network weights.
I derive a computationally efficient algorithm, whose complexity scales similarly to an ensemble of independent sparse logistic models.
arXiv Detail & Related papers (2023-03-02T19:09:47Z) - Variational Laplace Autoencoders [53.08170674326728]
Variational autoencoders employ an amortized inference model to approximate the posterior of latent variables.
We present a novel approach that addresses the limited posterior expressiveness of fully-factorized Gaussian assumption.
We also present a general framework named Variational Laplace Autoencoders (VLAEs) for training deep generative models.
arXiv Detail & Related papers (2022-11-30T18:59:27Z) - A Class of Two-Timescale Stochastic EM Algorithms for Nonconvex Latent
Variable Models [21.13011760066456]
The Expectation-Maximization (EM) algorithm is a popular choice for learning variable models.
In this paper, we propose a general class of methods called Two-Time Methods.
arXiv Detail & Related papers (2022-03-18T22:46:34Z) - Time varying regression with hidden linear dynamics [74.9914602730208]
We revisit a model for time-varying linear regression that assumes the unknown parameters evolve according to a linear dynamical system.
Counterintuitively, we show that when the underlying dynamics are stable the parameters of this model can be estimated from data by combining just two ordinary least squares estimates.
arXiv Detail & Related papers (2021-12-29T23:37:06Z) - A Variational Inference Approach to Inverse Problems with Gamma
Hyperpriors [60.489902135153415]
This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors.
The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement.
arXiv Detail & Related papers (2021-11-26T06:33:29Z) - Meta-Model Structure Selection: Building Polynomial NARX Model for
Regression and Classification [0.0]
This work presents a new meta-heuristic approach to select the structure of NARX models for regression and classification problems.
The robustness of the new algorithm is tested on several simulated and experimental system with different nonlinear characteristics.
arXiv Detail & Related papers (2021-09-21T02:05:40Z) - A non-asymptotic model selection in block-diagonal mixture of polynomial
experts models [1.491109220586182]
We introduce a penalized maximum likelihood selection criterion to estimate the unknown conditional density of a regression model.
We provide a strong theoretical guarantee, including a finite-sample oracle satisfied by the penalized maximum likelihood with a Jensen-Kullback-Leibler type loss.
arXiv Detail & Related papers (2021-04-18T21:32:20Z) - Probabilistic Circuits for Variational Inference in Discrete Graphical
Models [101.28528515775842]
Inference in discrete graphical models with variational methods is difficult.
Many sampling-based methods have been proposed for estimating Evidence Lower Bound (ELBO)
We propose a new approach that leverages the tractability of probabilistic circuit models, such as Sum Product Networks (SPN)
We show that selective-SPNs are suitable as an expressive variational distribution, and prove that when the log-density of the target model is aweighted the corresponding ELBO can be computed analytically.
arXiv Detail & Related papers (2020-10-22T05:04:38Z) - Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system.
In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX)
The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
arXiv Detail & Related papers (2020-09-29T12:50:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.