University of Cambridge > > Churchill CompSci Talks > PAC learning

PAC learning

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

If you have a question about this talk, please contact Jasper Lee.

Machine learning allows computers to solve problems without being explicitly programmed with the solution. However, what sorts of problems can be learned? What does it even mean to learn a problem? The Probably Approximately Correct (PAC) machine learning framework addresses these questions, specifying worst case error bounds before a problem can be said to be learnable. In this talk, we will see a formulation of the supervised binary classification problem, followed by a definition of PAC learning. We will then try to find a way of determining which problems are PAC learnable, and which are not.

This talk is part of the Churchill CompSci Talks 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