Despite impressive performance on many benchmarks, state-of-the-art machine learning algorithms have been shown to be extremely brittle on out-of-distribution inputs. While there has been a focus in recent years on robustness to small lp-perturbations, this talk will discuss robustness to more general types of corruptions. We will investigate several questions related to robustness: Why are current models so brittle? Is recent work on lp-robustness making progress towards robustness to distribution shift? How should we best measure model robustness to ensure that models can be safely deployed in complex dynamic environments? Additionally, we will present experiments showing how models latch onto spurious correlations in image data, and how data augmentation shifts model bias towards different features in the data, resulting in trade-offs in the robustness properties of the model.
The Information Systems Laboratory Colloquium (ISLC) is typically held in Packard 101 every Thursday at 4:30 pm during the academic year. Coffee and refreshments are served at 4pm in the second floor kitchen of Packard Bldg.
The Colloquium is organized by graduate students Joachim Neu, Tavor Baharav and Kabir Chandrasekher. To suggest speakers, please contact any of the students.