The Computational Complexity of Machine Learning

Powerful models become much more interesting when we look at what is happening underneath. 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 systems.

Guest

Professor Michael Kearns