Time Series Gaussian Chain Graph Models
arXiv stat.ML / 4/9/2026
💬 OpinionIdeas & Deep AnalysisModels & Research
Key Points
- The paper proposes a new class of time-series Gaussian chain graph models that separates contemporaneous/lagged cross-block causal relations (directed edges) from within-block conditional dependencies (undirected edges).
- In the frequency domain, the approach yields a shared group sparse plus group low-rank decomposition of inverse spectral density matrices, enabling identifiability of the underlying chain graph structure.
- The authors introduce a three-stage estimation procedure based on a regularized Whittle likelihood, using group lasso to promote group sparsity and a tensor-unfolding nuclear norm penalty to encourage group low-rank structure.
- The method is theoretically supported with asymptotic results guaranteeing consistency for exact recovery of the chain graph, and empirically validated via simulations and an application to U.S. macroeconomic data on monetary policy transmission mechanisms.
Related Articles

Why Anthropic’s new model has cybersecurity experts rattled
Reddit r/artificial
Does the AI 2027 paper still hold any legitimacy?
Reddit r/artificial

Why Most Productivity Systems Fail (And What to Do Instead)
Dev.to

Moving from proof of concept to production: what we learned with Nometria
Dev.to

Frontend Engineers Are Becoming AI Trainers
Dev.to