Rethinking Sketching as Sampling: A Graph Signal Processing Approach
Fernando Gama, Antonio G. Marques, Gonzalo Mateos, Alejandro Ribeiro

TL;DR
This paper introduces a graph signal processing-based sampling method that efficiently approximates the output of linear operators on low-dimensional signals, reducing computational complexity in sequential data processing.
Contribution
It proposes a novel joint optimization framework for sample selection and linear transformation sketching tailored for graph signals, enabling fast approximation of linear operator outputs.
Findings
Effective in classifying handwritten digits with minimal pixel data
Successful sensor selection for distributed parameter estimation
Reduces computational complexity in sequential data processing
Abstract
Sampling of signals belonging to a low-dimensional subspace has well-documented merits for dimensionality reduction, limited memory storage, and online processing of streaming network data. When the subspace is known, these signals can be modeled as bandlimited graph signals. Most existing sampling methods are designed to minimize the error incurred when reconstructing the original signal from its samples. Oftentimes these parsimonious signals serve as inputs to computationally-intensive linear operators. Hence, interest shifts from reconstructing the signal itself towards approximating the output of the prescribed linear operator efficiently. In this context, we propose a novel sampling scheme that leverages graph signal processing, exploiting the low-dimensional (bandlimited) structure of the input as well as the transformation whose output we wish to approximate. We formulate…
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.
