Saved in:
Bibliographic Details
Main Authors: Li, Zaitang, Chen, Pin-Yu, Ho, Tsung-Yi
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2304.09875
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913565004267520
author Li, Zaitang
Chen, Pin-Yu
Ho, Tsung-Yi
author_facet Li, Zaitang
Chen, Pin-Yu
Ho, Tsung-Yi
contents Current studies on adversarial robustness mainly focus on aggregating local robustness results from a set of data samples to evaluate and rank different models. However, the local statistics may not well represent the true global robustness of the underlying unknown data distribution. To address this challenge, this paper makes the first attempt to present a new framework, called GREAT Score , for global robustness evaluation of adversarial perturbation using generative models. Formally, GREAT Score carries the physical meaning of a global statistic capturing a mean certified attack-proof perturbation level over all samples drawn from a generative model. For finite-sample evaluation, we also derive a probabilistic guarantee on the sample complexity and the difference between the sample mean and the true mean. GREAT Score has several advantages: (1) Robustness evaluations using GREAT Score are efficient and scalable to large models, by sparing the need of running adversarial attacks. In particular, we show high correlation and significantly reduced computation cost of GREAT Score when compared to the attack-based model ranking on RobustBench (Croce,et. al. 2021). (2) The use of generative models facilitates the approximation of the unknown data distribution. In our ablation study with different generative adversarial networks (GANs), we observe consistency between global robustness evaluation and the quality of GANs. (3) GREAT Score can be used for remote auditing of privacy-sensitive black-box models, as demonstrated by our robustness evaluation on several online facial recognition services.
format Preprint
id arxiv_https___arxiv_org_abs_2304_09875
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle GREAT Score: Global Robustness Evaluation of Adversarial Perturbation using Generative Models
Li, Zaitang
Chen, Pin-Yu
Ho, Tsung-Yi
Machine Learning
Artificial Intelligence
Current studies on adversarial robustness mainly focus on aggregating local robustness results from a set of data samples to evaluate and rank different models. However, the local statistics may not well represent the true global robustness of the underlying unknown data distribution. To address this challenge, this paper makes the first attempt to present a new framework, called GREAT Score , for global robustness evaluation of adversarial perturbation using generative models. Formally, GREAT Score carries the physical meaning of a global statistic capturing a mean certified attack-proof perturbation level over all samples drawn from a generative model. For finite-sample evaluation, we also derive a probabilistic guarantee on the sample complexity and the difference between the sample mean and the true mean. GREAT Score has several advantages: (1) Robustness evaluations using GREAT Score are efficient and scalable to large models, by sparing the need of running adversarial attacks. In particular, we show high correlation and significantly reduced computation cost of GREAT Score when compared to the attack-based model ranking on RobustBench (Croce,et. al. 2021). (2) The use of generative models facilitates the approximation of the unknown data distribution. In our ablation study with different generative adversarial networks (GANs), we observe consistency between global robustness evaluation and the quality of GANs. (3) GREAT Score can be used for remote auditing of privacy-sensitive black-box models, as demonstrated by our robustness evaluation on several online facial recognition services.
title GREAT Score: Global Robustness Evaluation of Adversarial Perturbation using Generative Models
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2304.09875