Revisiting the Relation Between Robustness and Universality
M. Klabunde, L. Caspari, F. Lemmerich
TL;DR
This work reexamines the modified universality hypothesis (MUH) which posits that adversarially robust models trained for a task learn highly similar representations. Through extensive experiments across multiple datasets and a suite of representational and predictive similarity measures, the authors find that predictive universality does not hold: robust models do not converge to identical predictions on regular data as robustness increases. Representations, however, become more similar under robustness in some settings (notably ImageNet1k), though the degree of similarity is dataset-dependent and available measures may give conflicting impressions. Importantly, the study shows that the classifier at the end of the network largely drives predictive differences, and retraining the classifier can push predictions toward universality, indicating partial universality—robustness enforces some universal properties but not a blanket, universal behavior across all components.
Abstract
The modified universality hypothesis proposed by Jones et al. (2022) suggests that adversarially robust models trained for a given task are highly similar. We revisit the hypothesis and test its generality. While we verify Jones' main claim of high representational similarity in specific settings, results are not consistent across different datasets. We also discover that predictive behavior does not converge with increasing robustness and thus is not universal. We find that differing predictions originate in the classification layer, but show that more universal predictive behavior can be achieved with simple retraining of the classifiers. Overall, our work points towards partial universality of neural networks in specific settings and away from notions of strict universality.
