Explore advanced concepts in computational learning theory through a recorded seminar lecture that delves into the second part of computable PAC (Probably Approximately Correct) learning, presented at the prestigious Kolmogorov seminar series on computational and descriptional complexity - a forum established by the renowned mathematician Andrey Kolmogorov in 1979.
Overview
Syllabus
Tomasz Steifer's talk on computable PAC learning, part 2 (20.2.2023)
Taught by
Kolmogorov-Seminar
Related Courses
-
Computable PAC Learning - Part 1
-
Introduction to Probably Approximately Correct (PAC) Learning
-
PAC Learning of Decision Trees
-
PAC Learning: From Finite Families to CNF Formulas - Lecture on March 20, 2023
-
One-Way Computable Transformations - The Barmalias-Zhang Example
-
Improving Solovay's Theorem - Part 2
