Beyond Worst Case Analysis in ML

Published on ● Video Link: https://www.youtube.com/watch?v=2FN147Oihp8



Duration: 20:11
676 views
17


Emmanouil-Vasileios Vlatakis-Gkaragkounis (Simons Institute/FODSI)
https://simons.berkeley.edu/talks/teamwork-makes-von-neumann-work-two-team-zero-sum-games-0
Meet the Fellows Welcome Event Fall 2022

Back in the day, machine learning problems were a drag. Either classification or data-generation, the main tasks of artificial intelligence, had been classified as computationally hard problems. Decades later, with subsequent computing innovation, machines have transformed into their ultra-smart, self-learning, automated versions that are sweeping the human landscape.

This unreasonable effectiveness of modern machine learning algorithms has thrown down the gauntlet to algorithms researchers, and there is perhaps no other problem domain with a more urgent need for the beyond worst-case approach.

In this talk, we will discuss a series of recent results in the area of Local Search, Continuous Optimization and Game Dynamics.







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2022
Emmanouil-Vasileios Vlatakis-Gkaragkounis