2010 | OriginalPaper | Chapter
Sparse and Low-Rank Estimation of Time-Varying Markov Networks with Alternating Direction Method of Multipliers
Authors : Jun-ichiro Hirayama, Aapo Hyvärinen, Shin Ishii
Published in: Neural Information Processing. Theory and Algorithms
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Several authors have recently proposed sparse estimation techniques for
time-varying
Markov networks, in which both graph structures and model parameters may change with time. In this study, we extend a previous approach with a low-rank assumption on the matrix of parameter sequence, utilizing a recent technique of nuclear norm regularization. This can potentially improve the estimation performance particularly in such cases that the local smoothness assumed in previous studies do not really hold. Then, we derive a simple algorithm based on the alternating direction method of multipliers (ADMM) which can effectively utilize the separable structure of our convex minimization problem. With an artificially-generated dataset, its superior performance in structure learning is demonstrated.