Time Varying Undirected Graphs
Abstract
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using ℓ1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolves over time then the data are not longer identically distributed. In this paper we develop a nonparametric method for estimating time varying graphical structure for multivariate Gaussian distributions using an ℓ1 regularization method, and show that, as long as the covariances change smoothly over time, we can estimate the covariance matrix well (in predictive risk) even when p is large.
Cite
Text
Zhou et al. "Time Varying Undirected Graphs." Annual Conference on Computational Learning Theory, 2008. doi:10.1007/s10994-010-5180-0Markdown
[Zhou et al. "Time Varying Undirected Graphs." Annual Conference on Computational Learning Theory, 2008.](https://mlanthology.org/colt/2008/zhou2008colt-time/) doi:10.1007/s10994-010-5180-0BibTeX
@inproceedings{zhou2008colt-time,
title = {{Time Varying Undirected Graphs}},
author = {Zhou, Shuheng and Lafferty, John D. and Wasserman, Larry A.},
booktitle = {Annual Conference on Computational Learning Theory},
year = {2008},
pages = {455-466},
doi = {10.1007/s10994-010-5180-0},
url = {https://mlanthology.org/colt/2008/zhou2008colt-time/}
}