EE Systems Seminar
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Abstract: The prototypical high-dimensional statistics problem entails finding a structured signal in noise. Many of these problems exhibit a curious phenomenon: the amount of data needed by all known computationally efficient algorithms far exceeds what is needed for inefficient algorithms that search over all possible structures. A line of work initiated by Berthet and Rigollet in 2013 has aimed to explain these gaps by reducing from conjecturally hard problems in computer science. However, the delicate nature of average-case reductions has limited the applicability of this approach. In this work we introduce several new techniques to give a web of average-case reductions showing strong computational lower bounds based on the planted clique conjecture. These include tight lower bounds for Planted Independent Set, Planted Dense Subgraph, Biclustering, Sparse Spike Wigner, Sparse PCA, as well as for new models we introduce. Joint work with Matthew Brennan and Wasim Huleihel.
Bio: Guy Bresler is an Assistant Professor in the Department of Electrical Engineering and Computer Science at MIT. He is a member of the Laboratory for Information and Decision Systems (LIDS) as well as the Center for Statistics and Data Science at the Institute for Data, Systems, and Society (IDSS). His research interests are at the interface of statistics, computation, and information theory.
Contact: Liliana Chavarria at 626-395-4715 firstname.lastname@example.org