Learning a Common Substructure of Multiple Graphical Gaussian Models

Abstract

Properties of data are frequently seen to vary depending on the sampled situations, which usually changes along a time evolution or owing to environmental effects. One way to analyze such data is to find invariances, or representative features kept constant over changes. The aim of this paper is to identify one such feature, namely interactions or dependencies among variables that are common across multiple datasets collected under different conditions. To that end, we propose a common substructure learning (CSSL) framework based on a graphical Gaussian model. We further present a simple learning algorithm based on the Dual Augmented Lagrangian and the Alternating Direction Method of Multipliers. We confirm the performance of CSSL over other existing techniques in finding unchanging dependency structures in multiple datasets through numerical simulations on synthetic data and through a real world application to anomaly detection in automobile sensors.

47 pages, 6 figures, elsarticle.cls

References in corpus (8)

• Consistency of the group Lasso and multiple kernel learning
• Latent variable graphical model selection via convex optimization
• Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
• Projected Subgradient Methods for Learning Sparse Gaussians
• Group Lasso with Overlaps: the Latent Group Lasso approach
• Sparse Inverse Covariance Selection via Alternating Linearization Methods
• High-Dimensional Graphical Model Selection Using ${\ell }_1$-Regularized Logistic Regression
• Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for Sparsity Regularized Estimation