Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.


Computer Science/Discrete Mathematics Seminar I

Optimization-Friendly Generic Mechanisms Without Money
11:15am|Simonyi 101 and Remote Access

Our goal is to develop a generic framework for converting modern gradient-descent based optimization algorithms into mechanisms where inputs come from self-interested agents.

We focus on aggregating preferences from n players in a context without...


Computer Science/Discrete Mathematics Seminar II

A Characterization of Multiclass Learnability
Nataly Brukhim
10:30am|Simonyi Hall 101 and Remote Access

A seminal result in learning theory characterizes the PAC learnability of binary classes through the VC dimension. Extending this characterization to the general multiclass setting has been open since the late 1980s.

We resolve this problem by...