Applied and Computational Mathematics Seminar

Paul Hand (MIT). In this talk, we will present existing results for planted clique with planted random and semirandom models. We will also discuss the potential for semirandom models in two other problems: sparse principal component analysis and the problem of finding the sparsest element in a subspace.