Robustness Bounds on the Successful Adversarial Examples: Theory and Practice
<|reference_start|>Robustness Bounds on the Successful Adversarial Examples: Theory and Practice: Adversarial example (AE) is an attack method for machine learning, which is crafted by adding imperceptible perturbation to the data inducing misclassification. In the current paper, we investigated the upper bound of the probability of successful AEs based on the Gaussian Process (GP) classification. We proved a new upper bound that depends on AE's perturbation norm, the kernel function used in GP, and the distance of the closest pair with different labels in the training dataset. Surprisingly, the upper bound is determined regardless of the distribution of the sample dataset. We showed that our theoretical result was confirmed through the experiment using ImageNet. In addition, we showed that changing the parameters of the kernel function induces a change of the upper bound of the probability of successful AEs.<|reference_end|>
@article{maeshima2024robustness,
    title={Robustness Bounds on the Successful Adversarial Examples: Theory and
  Practice},
    author={Hiroaki Maeshima, Akira Otsuka},
    journal={arXiv preprint arXiv:2403.01896},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.01896},
    primaryClass={cs.LG cs.CR stat.ML}
}