Timezone: »

 
Efficient Estimation of Local Robustness of Machine Learning Models
Tessa Han · Suraj Srinivas · Hima Lakkaraju

Fri Jul 28 06:20 PM -- 06:50 PM (PDT) @
in 2nd Workshop on Formal Verification of Machine Learning »

Machine learning models often need to be robust to noisy input data. The effect of real-world noise (which is often random) on model predictions is captured by a model’s local robustness, i.e., the consistency of model predictions in a local region around an input. However, the naïve approach to computing local robustness based on Monte-Carlo sampling is statistically inefficient, leading to prohibitive computational costs for large-scale applications. In this work, we develop the first analytical estimators to efficiently compute local robustness of multi-class discriminative models using local linear function approximation and the multivariate Normal CDF. Through the derivation of these estimators, we show how local robustness is connected to concepts such as randomized smoothing and softmax probability. We also confirm empirically that these estimators accurately and efficiently compute the local robustness of standard deep learning models. In addition, we demonstrate these estimators’ usefulness for various tasks involving local robustness, such as measuring robustness bias and identifying examples that are vulnerable to noise perturbation in a dataset. By developing these analytical estimators, this work not only advances conceptual understanding of local robustness, but also makes its computation practical, enabling the use of local robustness in critical downstream applications.

Author Information

Tessa Han (Harvard University)
Suraj Srinivas (Harvard University)
Hima Lakkaraju (Harvard)

More from the Same Authors