Explore a comprehensive seminar lecture from the prestigious Kolmogorov seminar series on computational and descriptional complexity that delves into the PAC (Probably Approximately Correct) learning framework for decision trees, delivered by Sasha Kozachinskiy as part of the long-running academic series established by Kolmogorov in 1979.
Overview
Syllabus
20.03.2023 Sasha Kozachinskiy: PAC learning of decision trees
Taught by
Kolmogorov-Seminar
Related Courses
-
Computable PAC Learning - Part 2
-
Introduction to Probably Approximately Correct (PAC) Learning
-
Computable PAC Learning - Part 1
-
PAC Learning: From Finite Families to CNF Formulas - Lecture on March 20, 2023
-
Machine Learning: Random Forests & Decision Trees
-
Decision trees and dealing with uncertainty
