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

Yingzhe Xu

dblp:353/6506 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 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 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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 · 87% Learning theory · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization · AAAI 2025
Machine learning › Trustworthy machine learning › robustness › adversarial examples
universal adversarial perturbation
0.912025
Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization · AAAI 2025
Machine learning › Learning theory › generalization
model generalization
0.312025
Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization · AAAI 2025

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

dynamic maximin optimization · 0.9curriculum learning · 0.9
YearPublicationVenuePosition
2025 Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization
abstract
Deep neural networks (DNNs) are susceptible to universal adversarial perturbations (UAPs). These perturbations are meticulously designed to fool the target model universally across all sample classes. Unlike instance-specific adversarial examples (AEs), generating UAPs is more complex because they must be generalized across a wide range of data samples and models. Our research reveals that existing universal attack methods, which optimize UAPs using DNNs with static model parameter snapshots, do not fully leverage the potential of DNNs to generate more effective UAPs. Rather than optimizing UAPs against static DNN models with a fixed training set, we suggest using dynamic model-data pairs to generate UAPs. In particular, we introduce a dynamic maximin optimization strategy, aiming to optimize the UAP across a variety of optimal model-data pairs. We term this approach DM-UAP. DM-UAP utilizes an iterative max-min-min optimization framework that refines the model-data pairs, coupled with a curriculum UAP learning algorithm to examine the combined space of model parameters and data thoroughly. Comprehensive experiments on the ImageNet dataset demonstrate that the proposed DM-UAP markedly enhances both cross-sample universality and cross-model transferability of UAPs. Using only 500 samples for UAP generation, DM-UAP outperforms the state-of-the-art approach with an average increase in fooling ratio of 12.108%.
Yechao Zhang, Yingzhe Xu, Junyu Shi, Leo Yu Zhang, Shengshan Hu, Yanjun Zhang 0002
AAAI2
2023 New semidefinite relaxations for a class of complex quadratic programming problems
Yingzhe Xu, Cheng Lu 0007, Zhibin Deng, Ya-Feng Liu
J. Glob. Optim.1