Efficient Robust Learning at the Information-Theoretic Limit
In an important recent work, Blanc (2026) gave an algorithm for robustly learning Boolean concept classes with respect to a fixed distribution that outputs a (randomized) classifier achieving the optimal error of $\eta + \varepsilon$ where $\eta$ is the noise rate. In contrast, it is well known that deterministic hypot...
Adam R. Klivans, Konstantinos Stavropoulos, S. Tikhonov et al.
· 0 citations