4.7 Article

Time varying undirected graphs

Journal

MACHINE LEARNING
Volume 80, Issue 2-3, Pages 295-319

Publisher

SPRINGER
DOI: 10.1007/s10994-010-5180-0

Keywords

Graph selection; l(1) regularization; High dimensional asymptotics; Risk consistency

Ask authors/readers for more resources

Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using a (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 a (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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available