Speaker: Abhinav Bhardwaj (Yale Math)
Abstract: Consider a random perturbation of a low rank matrix. In this talk, we discuss entry-wise bounds on the perturbation of the singular vectors (i.e, a Davis-Kahan type bound in the infinity norm). Among others, our result shows that, under common incoherence assumptions, the entry-wise error is evenly dissipated. This improves a number of previous results and has algorithmic applications for many well known clustering problems, including the hidden clique, planted coloring, and planted bipartition.
Location: 24 Hillhouse, room 107
