Towards the Statistically Principled Design of ML Algorithms

Frederic Koehler, Stanford University Theoretical Computer Science
January 27, 2023 3:00 pm ESB 2012

What are the optimal algorithms for learning from data? Have we found them already, or are better ones out there to be discovered? Making these questions precise, and answering them, requires taking on the mathematically deep interplay between statistical and computational constraints. It also requires reconciling our theoretical toolbox with surprising new phenomena arising from practice, which seem to violate conventional rules of thumb regarding algorithm and model design. I will discuss progress along these lines: in terms of designing new algorithms for basic learning problems, controlling generalization in large statistical models, and understanding key statistical questions for generative modeling.

A reception will precede the talk, at 2:15, in the PIMS lounge (ESB 4133).