354 citations · 806 across the 36 of their papers we have counts for
Showing 2019 · cs.CCShow all
3 papers · 2 filters
cs.CC2019★ 8 cited
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
Matthew Brennan, Guy Bresler
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computatio…
cs.CC2019
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
Enric Boix-Adserà, Matthew Brennan, Guy Bresler
We consider the problem of counting -cliques in -uniform Erdos-Renyi hypergraphs with edge density , and show that its fine-grained average-case complexity can…
cs.CC2019★ 20 cited
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Matthew Brennan, Guy Bresler
In the past decade, sparse principal component analysis has emerged as an archetypal problem for illustrating statistical-computational tradeoffs. This trend has largely been drive…