University of Cambridge > Talks.cam > Churchill CompSci Talks > PAC learning

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

PAC learning

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Changing Health Faculty of Law, Sidgwick Avenue German Embassy, 22 Belgrave Square,. London

Other talks

What’s my reproduction number? Life history strategies: an interdisciplinary perspective Group Work Title to be confirmed Filial Lines: Art Spiegelman, Alison Bechdel, and Comics Form Quantifying the unquantifiable? Assessing the importance of almsgiving in early modern France and Spain Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study
 

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