Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhaoyan Jiang

dblp:380/8946 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0001-0285-3598ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.812024
Adaptive Perturbation for Adversarial Attack · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.812024
Adaptive Perturbation for Adversarial Attack · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Trustworthy machine learning › robustness › adversarial attack
gradient-based attack
0.812024
Adaptive Perturbation for Adversarial Attack · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Adaptive Perturbation for Adversarial Attack · IEEE Trans. Pattern Anal. Mach. Intell. 2024

Methods — techniques the papers use, named apart from their topics

sign function · 0.8gradient direction · 0.8adaptive scaling factor · 0.8
YearPublicationVenuePosition
2024 Adaptive Perturbation for Adversarial Attack
abstract
In recent years, the security of deep learning models achieves more and more attentions with the rapid development of neural networks, which are vulnerable to adversarial examples. Almost all existing gradient-based attack methods use the sign function in the generation to meet the requirement of perturbation budget on$L_\infty$norm. However, we find that the sign function may be improper for generating adversarial examples since it modifies the exact gradient direction. Instead of using the sign function, we propose to directly utilize the exact gradient direction with a scaling factor for generating adversarial perturbations, which improves the attack success rates of adversarial examples even with fewer perturbations. At the same time, we also theoretically prove that this method can achieve better black-box transferability. Moreover, considering that the best scaling factor varies across different images, we propose an adaptive scaling factor generator to seek an appropriate scaling factor for each image, which avoids the computational cost for manually searching the scaling factor. Our method can be integrated with almost all existing gradient-based attack methods to further improve their attack success rates. Extensive experiments on the CIFAR10 and ImageNet datasets show that our method exhibits higher transferability and outperforms the state-of-the-art methods.
Zheng Yuan 0005, Jie Zhang 0071, Zhaoyan Jiang, Shiguang Shan
IEEE Trans. Pattern Anal. Mach. Intell.3