Time varying undirected graphs
- 1.2k Downloads
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.
KeywordsGraph selection ℓ1 regularization High dimensional asymptotics Risk consistency
- Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2008). Model selection through sparse maximum likelihood estimation. Journal of Machine Learning Research, 9, 485–516. Google Scholar
- Ravikumar, P., Wainwright, M., Raskutti, G., & Yu, B. (2008) High-dimensional covariance estimation by minimizing ℓ 1 -penalized log-determinant divergence (Tech. Rep. 767). UC Berkeley, Department of Statistics. Google Scholar