# Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data Source: [Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data]() Collection index: [llms.txt]() Data updated: 2026-06-09T05:00:07.006Z Authors: William Cappelletti, Pascal Frossard Published: 2024-11-08T17:40:43.000Z ## Abstract Representing and exploiting multivariate signals requires capturing relations between variables, which we can represent by graphs. Graph dictionaries allow to describe complex relational information as a sparse sum of simpler structures, but no prior model exists to infer such underlying structure elements from data. We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution as filters on the weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed node signals, which allows to include a priori knowledge about signal properties, and about underlying graphs and their coefficients. We introduce a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We show the capability of our method to reconstruct graphs from signals in multiple synthetic settings, where our model outperforms popular baselines. Then, we exploit graph-dictionary representations in an illustrative motor imagery decoding task on brain activity data, where we classify imagined motion better than standard methods relying on many more features. Our graph-dictionary model bridges a gap between sparse representations of multivariate data and a structured decomposition of sample-varying relationships into a sparse combination of elementary graph atoms. ## Recorded benchmark results A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage. - [Edge Recovery on EMEG 32 graphs, 20 win. size (test)](): Edge Recovery; EMEG 32 graphs, 20 win. size (test); MCC: 61. - [Edge Recovery on EMEG 512 graphs, 1 win. size (test)](): Edge Recovery; EMEG 512 graphs, 1 win. size (test); MCC: 46.2. - [Edge Recovery on SBG 32 graphs, 20 win. size (test)](): Edge Recovery; SBG 32 graphs, 20 win. size (test); MCC: 48.1. - [Edge Recovery on SBG 512 graphs, 1 win. size (test)](): Edge Recovery; SBG 512 graphs, 1 win. size (test); MCC: 44. ## Original sources and implementation [Original paper]() [PDF]()