Compressive Nonparametric Graphical Model Selection For Time Series

Jung, Alexander, Heckel, Reinhard, Bölcskei, Helmut, Hlawatsch, Franz

arXiv.org Machine Learning 

Here, h[m] is a nonnegative weight function that typically increases with m . The CIG of the process x[n] is the graph G: (V, E) with node set V [p]: {1,..., p} representing the scalar component processes {x ABSTRACT We propose a method for inferring the conditional independence graph (CIG) of a high-dimensional discrete-time Gaussian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as, e.g., an autoregressive model) for the vector random process; rather, it only assumes certain spectral smoothness properties. The proposed inference scheme is compressive in that it works for sample sizes that are (much) smaller than the number of scalar process components. We provide analytical conditions for our method to correctly identify the CIG with high probability.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found