CS 294. Efficient Algorithms and Computational Complexity in Statistics, Fall 2022

Lecture: Tuesday 11:00am-12:30pm, 310 Soda
Instructor: Prasad Raghavendra
Office hours: Tuesday 2:30-3:30pm

Course Description

In this course, we will explore the tractability of computational problems arising in high-dimensional statistics. Specifically, we will study

A tentative list of topics include the following:

Problems:

Algorithmic Tools:

Evidence of intractability

Ideas from statistical physics:

Prerequisites:

The class is aimed at graduate students specializing in theoretical computer science,statistics or related areas. A solid background in probability and linear algebra is an absolute must.

Assessment:

Enrollment:

If you are interested in taking the class, please drop me an email with the subject line 'CS294 Enrollment’ along with details of what graduate program and research group you belong to, and relevant course/research experience if any.