Sparse vector autoregressive modeling
The vector autoregressive (VAR) model has been widely used for modeling temporal
dependence in a multivariate time series. For large (and even moderate) dimensions, the …
dependence in a multivariate time series. For large (and even moderate) dimensions, the …
Generalized maximum entropy based identification of graphical ARMA models
This paper focuses on the joint estimation of parameters and topologies of multivariate
graphical autoregressive moving-average (ARMA) processes. Since the graphical structure …
graphical autoregressive moving-average (ARMA) processes. Since the graphical structure …
[PDF][PDF] Topology selection in graphical models of autoregressive processes
J Songsiri, L Vandenberghe - The Journal of Machine Learning Research, 2010 - jmlr.org
An algorithm is presented for topology selection in graphical models of autoregressive
Gaussian time series. The graph topology of the model represents the sparsity pattern of the …
Gaussian time series. The graph topology of the model represents the sparsity pattern of the …
Sparse plus low-rank identification for dynamical latent-variable graphical AR models
J You, C Yu - Automatica, 2024 - Elsevier
This paper focuses on the identification of graphical autoregressive models with dynamical
latent variables. The dynamical structure of latent variables is described by a matrix …
latent variables. The dynamical structure of latent variables is described by a matrix …
AR identification of latent-variable graphical models
M Zorzi, R Sepulchre - IEEE Transactions on Automatic Control, 2015 - ieeexplore.ieee.org
The paper proposes an identification procedure for autoregressive Gaussian stationary
stochastic processes under the assumption that the manifest (or observed) variables are …
stochastic processes under the assumption that the manifest (or observed) variables are …
Graphical lasso based model selection for time series
A Jung, G Hannak, N Goertz - IEEE Signal Processing Letters, 2015 - ieeexplore.ieee.org
We propose a novel graphical model selection scheme for high-dimensional stationary time
series or discrete time processes. The method is based on a natural generalization of the …
series or discrete time processes. The method is based on a natural generalization of the …
On sparse high-dimensional graphical model learning for dependent time series
JK Tugnait - Signal Processing, 2022 - Elsevier
We consider the problem of inferring the conditional independence graph (CIG) of a sparse,
high-dimensional stationary multivariate Gaussian time series. A sparse-group lasso-based …
high-dimensional stationary multivariate Gaussian time series. A sparse-group lasso-based …
Learning networks of stochastic differential equations
J Pereira, M Ibrahimi… - Advances in Neural …, 2010 - proceedings.neurips.cc
We consider linear models for stochastic dynamics. Any such model can be associated a
network (namely a directed graph) describing which degrees of freedom interact under the …
network (namely a directed graph) describing which degrees of freedom interact under the …
Time series graphical lasso and sparse VAR estimation
A two-stage sparse vector autoregression method is proposed. It relies on the more recent
and powerful technique of time series graphical lasso to estimate sparse inverse spectral …
and powerful technique of time series graphical lasso to estimate sparse inverse spectral …
Identification of sparse reciprocal graphical models
In this letter we propose an identification procedure of a sparse graphical model associated
to a Gaussian stationary stochastic process. The identification paradigm exploits the …
to a Gaussian stationary stochastic process. The identification paradigm exploits the …