mlsanityData to 14 Oct 2026

Enhancing Graphical Lasso: A Robust Scheme for Non-Stationary Mean Data

arXiv 2503.19651 ↗First posted 25 Mar 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

This work addresses the problem of graph learning from data following a Gaussian Graphical Model (GGM) with a time-varying mean. Graphical Lasso (GL), the standard method for estimating sparse precision matrices, assumes that the observed data follows a zero-mean Gaussian distribution. However, this assumption is often violated in real-world scenarios where the mean evolves over time due to external influences, trends, or regime shifts. When the mean is not properly accounted for, applying GL directly can lead to estimating a biased precision matrix, hence hindering the graph learning task. To overcome this limitation, we propose Graphical Lasso with Adaptive Targeted Adaptive Importance Sampling (GL-ATAIS), an iterative method that jointly estimates the time-varying mean and the precision matrix. Our approach integrates Bayesian inference with frequentist estimation, leveraging importance sampling to obtain an estimate of the mean while using a regularized maximum likelihood estimator to infer the precision matrix. By iteratively refining both estimates, GL-ATAIS mitigates the bias introduced by time-varying means, leading to more accurate graph recovery. Our numerical evaluation demonstrates the impact of properly accounting for time-dependent means and highlights the advantages of GL-ATAIS over standard GL in recovering the true graph structure.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 33 references that are in the map. First posted on arXiv 25 Mar 2025.

Builds on

20 of 33 references.

References · 20

  1. 2016How to learn a graph from smooth signalscited by 146
  2. 2018Connecting the Dots: Identifying Network Structure via Graph Signal Processingcited by 111
  3. 2016Network Topology Inference from Spectral Templatescited by 58
  4. 2017Network Inference via the Time-Varying Graphical Lassocited by 55
  5. 2020Marginal likelihood computation for model selection and hypothesis testing: an extensive reviewcited by 33
  6. 2019Structured Graph Learning Via Laplacian Spectral Constraintscited by 20
  7. 2021Learning Graphs from Smooth and Graph-Stationary Signals with Hidden Variablescited by 20
  8. 2021Learning Time-Varying Graphs from Online Datacited by 12
  9. 2022Enhanced graph-learning schemes driven by similar distributions of motifscited by 11
  10. 2022Joint Network Topology Inference via a Shared Graphon Modelcited by 11
  11. 2024Fair GLASSO: Estimating Fair Graphical Models with Unbiased Statistical Behaviorcited by 10
  12. 2014Learning Latent Variable Gaussian Graphical Modelscited by 8
8 more
  1. 2018Estimating Time-Varying Graphical Modelscited by 8
  2. 2024Polynomial Graphical Lasso: Learning Edges from Gaussian Graph-Stationary Signalscited by 8
  3. 2017Time-dependent spatially varying graphical models, with application to brain fMRI data analysiscited by 7
  4. 2015Testing for Differences in Gaussian Graphical Models: Applications to Brain Connectivitycited by 6
  5. 2021Automatic tempered posterior distributions for Bayesian inversion problemscited by 6
  6. 2022Joint graph learning from Gaussian observations in the presence of hidden nodescited by 3
  7. 2024Online Learning Of Expanding Graphscited by 2
  8. 2025Adaptive posterior distributions for uncertainty analysis of covariance matrices in Bayesian inversion problems for multioutput signalscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.