Bayesian inference of sparsity in stable vector autoregressive processes
Sarah E. Heaps, Ian H. Jermyn, Yujiang Wang, Darren J. Wilkinson

TL;DR
This paper develops a Bayesian method for inferring sparse, stable vector autoregressive models from high-dimensional time-series data, with applications in genetics, neuroscience, and macroeconomics.
Contribution
It introduces a novel spike-and-slab prior that enforces both stability and sparsity in VAR models, addressing complex geometric constraints.
Findings
Improved inference accuracy demonstrated in simulations.
Enhanced predictive performance in macroeconomic and neuroscience data.
Effective computational approach using Metropolis-within-Gibbs sampling.
Abstract
Advances in sensing technology have made it possible to collect large volumes of high-dimensional time-series data. In fields like genetics and neuroscience, key questions concern whether directed relationships between variables can be learned from these data. To this end, graphical vector autoregressions are a popular tool because zeros among the autoregressive coefficients and error precision matrix have natural interpretations in terms of Granger non-causality and contemporaneous conditional independence. In applications where system dynamics are subject to functional or structural constraints, assuming the process is stable can be advantageous. However, enforcing stability demands restricting the autoregressive coefficients to lie in a constrained space with a complex geometry called the stationary region. The resulting inferential challenges are compounded when sparsity is also a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
