Title: Polynomial-time algorithms are not always welcome – sparse PCA as a case study When: October 27, Sunday, 12:00 Where: Gonda building, room 101 Abstract: The taxing computational effort that is involved in solving some high-dimensional statistical problems, in particular problems involving non-convex optimization, has popularized the development and analysis of  algorithms that run efficiently (polynomial-time) but ... Read more