Understanding evolution of research themes

Wang, Xiaolong; Zhai, ChengXiang; Roth, Dan

doi:10.1145/2487575.2487698

Cited by 42 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the one hand, for the estimation of explicit probability distributions with parameters θ, the model provides a likelihood of L = ∏ m i=1 p model x (i) , θ to the m training samples, and the maximum likelihood principle chooses the parameter θ * = arg max θ ∏ m i=1 p model x (i) , θ that maximizes that probability; on the other hand, for the estimation of implicit probability distributions, the maximum likelihood can be approximated as the solution of the parameter θ * = arg max θ D KL (p data (x) p model (x; θ)) that minimizes the Kullback-Leibler divergence [32] between the model distribution and the data distribution. Therefore, likelihoodbased generative models can be divided into implicit models and explicit models [33].…”

Section: Probability Density Estimation Methodsmentioning

confidence: 99%

Probability-Distribution-Guided Adversarial Sample Attacks for Boosting Transferability and Interpretability

Li,

Yu,

et al. 2023

Mathematics

View full text Add to dashboard Cite

In recent years, with the rapid development of technology, artificial intelligence (AI) security issues represented by adversarial sample attack have aroused widespread concern in society. Adversarial samples are often generated by surrogate models and then transfer to attack the target model, and most AI models in real-world scenarios belong to black boxes; thus, transferability becomes a key factor to measure the quality of adversarial samples. The traditional method relies on the decision boundary of the classifier and takes the boundary crossing as the only judgment metric without considering the probability distribution of the sample itself, which results in an irregular way of adding perturbations to the adversarial sample, an unclear path of generation, and a lack of transferability and interpretability. In the probabilistic generative model, after learning the probability distribution of the samples, a random term can be added to the sampling to gradually transform the noise into a new independent and identically distributed sample. Inspired by this idea, we believe that by removing the random term, the adversarial sample generation process can be regarded as the static sampling of the probabilistic generative model, which guides the adversarial samples out of the original probability distribution and into the target probability distribution and helps to boost transferability and interpretability. Therefore, we proposed a score-matching-based attack (SMBA) method to perform adversarial sample attacks by manipulating the probability distribution of the samples, which showed good transferability in the face of different datasets and models and provided reasonable explanations from the perspective of mathematical theory and feature space. Compared with the current best methods based on the decision boundary of the classifier, our method increased the attack success rate by 51.36% and 30.54% to the maximum extent in non-targeted and targeted attack scenarios, respectively. In conclusion, our research established a bridge between probabilistic generative models and adversarial samples, provided a new entry angle for the study of adversarial samples, and brought new thinking to AI security.

show abstract

Section: Probability Density Estimation Methodsmentioning

confidence: 99%