November 17, 2026
Stanford University
https://regularitylemmas.github.io/
In recent years, a connection to algorithmic fairness, where this indistinguishability condition is known as multiaccuracy and its strengthening as multicalibration, has led to a surge of work on regularity lemmas. These results have clarified what can be achieved through multiaccuracy alone and what additional guarantees arise from different forms of calibration. They have also led to new connections and applications in complexity theory, cryptography, learning theory, information theory, and communication complexity, among other areas. This workshop brings together researchers working on these developments to discuss recent progress and open problems.
