AR Identification of Latent-Variable Graphical Models
From MaRDI portal
Abstract: The paper proposes an identification procedure for autoregressive gaussian stationary stochastic processes wherein the manifest (or observed) variables are mostly related through a limited number of latent (or hidden) variables. The method exploits the sparse plus low-rank decomposition of the inverse of the manifest spectral density and the efficient convex relaxations recently proposed for such decomposition.
Cited in
(18)- Identification of low rank vector processes
- Sparse plus low rank network identification: a nonparametric approach
- Finite time identification in unstable linear systems
- Empirical Bayesian learning in AR graphical models
- First-order methods for nonnegative trigonometric matrix polynomials
- Topology identification under spatially correlated noise
- An interpretation of the dual problem of the THREE-like approaches
- Discrete-time negative imaginary systems
- Matrix spectral factorization for SA4 multiwavelet
- Identifiability of directed Gaussian graphical models with one latent source
- An alternating minimization algorithm for factor analysis.
- Graphical model selection for a particular class of continuous-time processes.
- Generalized maximum entropy based identification of graphical ARMA models
- Autoregressive identification of Kronecker graphical models
- Sparse plus low-rank identification for dynamical latent-variable graphical AR models
- Probabilistic reduced-dimensional vector autoregressive modeling with oblique projections
- Nonparametric identification of Kronecker networks
- Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs
This page was built for publication: AR Identification of Latent-Variable Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980382)