Now showing items 1-1 of 1
Reducibility and computational lower bounds for problems with planted sparse structure
(Massachusetts Institute of Technology, 2018)
Recently, research in unsupervised learning has gravitated towards exploring statistical-computational gaps induced by sparsity. A line of work initiated by Berthet and Rigollet has aimed to explain these gaps through ...