Nash equilibria have been central to game theory since Von Neumann, but how fast can we compute them? The best known upper bound is achieved by letting a minimizing and a maximizing online learning...

Graph neural networks (GNNs) are the predominant architectures for a variety of learning tasks on graphs. We present a new angle on the expressive power of GNNs by studying how the predictions of a...

Decision trees are an effective and concise way of conveying information, easily understood by virtually everyone regardless of the topic. Given the recent interest in explainable AI and related fi...

Equality Saturation: Progress and Open Questions

TBA

A new version of content is available.