CSAIL Professor Sam Hopkins gives an overview of the landscape of high dimensional statistics, and shares some of the research that he and his colleagues at CSAIL are working on to shape it.
Professor Hopkins would like to note one correction, when he refers to the "planted clique" problem, it should be "max clique in a random graph."
CSAIL Professor Arvind details his work in Near-storage computing. He explains how he's using flash storage instead of massive amounts of DRAM for big data problems.