University of Cambridge > > Statistics > Statistical algorithms and planted satisfiability problems

Statistical algorithms and planted satisfiability problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Quentin Berthet.

I will discuss a general framework originating in learning theory for proving average-case algorithmic lower bounds for the class of “statistical algorithms”. I will give an overview of the types of algorithmic approaches that can be implemented in this framework, and then discuss the example of planted random satisfiability problems, for which we can identify a tractability threshold for statistical algorithms. Based on joint work with Vitaly Feldman and Santosh Vempala.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity