Foundations of sparse approximation

Underpinning much of my applied work is a long-running program on the mathematical foundations of sparse approximation: sublinear-time and sparse Fourier algorithms, compressive sensing, and structured transforms such as orthogonal polynomial transforms (Sparse Recovery for Orthogonal Polynomial Transforms, ICALP 2020).

This is where the algorithms, harmonic analysis, and probability behind the rest of the group’s work come from — a good entry point for mathematically inclined students.