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

YangTian Yan

dblp:402/0310 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.912025
Data-Free Universal Attack by Exploiting the Intrinsic Vulnerability of Deep Models · AAAI 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
Data-Free Universal Attack by Exploiting the Intrinsic Vulnerability of Deep Models · AAAI 2025
Machine learning › Trustworthy machine learning › adversarial machine learning
black-box attack
0.912025
Data-Free Universal Attack by Exploiting the Intrinsic Vulnerability of Deep Models · AAAI 2025
Machine learning › Trustworthy machine learning › robustness › adversarial examples
universal adversarial perturbation
0.912025
Data-Free Universal Attack by Exploiting the Intrinsic Vulnerability of Deep Models · AAAI 2025

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

singular value decomposition · 0.9lipschitz analysis · 0.9
YearPublicationVenuePosition
2025 Data-Free Universal Attack by Exploiting the Intrinsic Vulnerability of Deep Models
abstract
Deep neural networks (DNNs) are susceptible to Universal Adversarial Perturbations (UAPs), which are instance-agnostic perturbations that can deceive a target model across a wide range of samples. Unlike instance-specific adversarial examples, UAPs present a greater challenge as they must generalize across different samples and models. Generating UAPs typically requires access to numerous examples, which is a strong assumption in real-world tasks. In this paper, we propose a novel data-free method called Intrinsic UAP(IntriUAP), by exploiting the intrinsic vulnerabilities of deep models. We analyze a series of popular deep models composed of linear and nonlinear layers with a Lipschitz constant of 1, revealing that the vulnerability of these models is predominantly influenced by their linear components. Based on this observation, we leverage the ill-conditioned nature of the linear components by aligning the UAP with the right singular vectors corresponding to the maximum singular value of each linear layer. Remarkably, our method achieves highly competitive performance in attacking popular image classification deep models without using any image samples. We also evaluate the black-box attack performance of our method, showing that it matches the state-of-the-art baseline for data-free methods on models that conform to our theoretical framework. Beyond the data-free assumption, IntriUAP also operates under a weaker assumption, where the adversary only can access a few of the victim model's layers. Experiments demonstrate that the attack success rate decreases by only 4% when the adversary has access to just 50% of the linear layers in the victim model.
YangTian Yan, Jinyu Tian 0001
AAAI1