The Computational Complexity of Machine Learning

Data Skeptic

In this episode, Professor Michael Kearns from the University of Pennsylvania joins host Kyle Polich to talk about the computational complexity of machine learning, complexity in game theory, and algorithmic fairness. Michael's doctoral thesis gave an early broad overview of computational learning theory, in which he emphasizes the mathematical study of efficient learning algorithms by machines or computational syste

Next Episodes

Data Skeptic

Turing Machines @ Data Skeptic

📆 2017-10-27 02:00


Data Skeptic

Turing Machines @ Data Skeptic

📆 2017-10-27 02:00