Robust Sparse Recovery and Applications: Order-Optimal Measurements and Complexity With Sidharth Jaggi Department of Information Engineering Chinese University of Hong Kong Faculty Host: Bobak Nazer Refreshments will be served outside Room 339 at 3:45 p.m. Abstract: Sparse recovery problems are usually in the setting in which a vector x with ambient dimension n has only k "significant" entries. This vector x is "compressively measured" (with possibly "noisy" measurements) as y, where y has just m<