# Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data

arXiv: https://arxiv.org/abs/2411.05729 · HTML: https://mlsanity.com/paper/2411.05729/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 10 of its 34 references that are in the map.
- First posted on arXiv 8 Nov 2024.

## Builds on (most cited first, 10 of 10)

- [How to learn a graph from smooth signals](https://mlsanity.com/paper/1601.02513/) (2016)
- [Learning graphs from data: A signal representation perspective](https://mlsanity.com/paper/1806.00848/) (2018)
- [Connecting the Dots: Identifying Network Structure via Graph Signal Processing](https://mlsanity.com/paper/1810.13066/) (2018)
- [Online Graph Dictionary Learning](https://mlsanity.com/paper/2102.06555/) (2021)
- [Large Scale Graph Learning from Smooth Signals](https://mlsanity.com/paper/1710.05654/) (2017)
- [Joint Inference of Multiple Graphs from Matrix Polynomials](https://mlsanity.com/paper/2010.08120/) (2020)
- [Time-Varying Graph Learning with Constraints on Graph Temporal Variation](https://mlsanity.com/paper/2001.03346/) (2020)
- [Graph Laplacian mixture model](https://mlsanity.com/paper/1810.10053/) (2018)
- [Multiview Graph Learning with Consensus Graph](https://mlsanity.com/paper/2401.13769/) (2024)
- [Graph heat mixture model learning](https://mlsanity.com/paper/1901.08585/) (2019)

## Abstract (arXiv)

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.