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.

Lei Zhang 0197

dblp:97/8704-197 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 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.

Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 78% Graph learning · 12% Generative modeling · 10%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
dataset distillation
0.712023
Accelerating Dataset Distillation via Model Augmentation · CVPR 2023
Machine learning › Efficient and distributed learning
gradient matching
0.712023
Accelerating Dataset Distillation via Model Augmentation · CVPR 2023
Security and privacy of machine learning
adversarial attack
0.612022
Towards Efficient Data Free Blackbox Adversarial Attack · CVPR 2022
Security and privacy of machine learning › adversarial attack
black-box attack
0.612022
Towards Efficient Data Free Blackbox Adversarial Attack · CVPR 2022
Security and privacy of machine learning › adversarial attack
data-free adversarial attack
0.612022
Towards Efficient Data Free Blackbox Adversarial Attack · CVPR 2022
Machine learning › Graph learning
model augmentation
0.212023
Accelerating Dataset Distillation via Model Augmentation · CVPR 2023
Machine learning › Generative modeling
generative adversarial network
0.212022
Towards Efficient Data Free Blackbox Adversarial Attack · CVPR 2022

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

query-efficient attack · 1.1generative adversarial network · 1.1parameter perturbation · 0.7early-stage models · 0.7
YearPublicationVenuePosition
2023 Accelerating Dataset Distillation via Model Augmentation
abstract
Dataset Distillation (DD), a newly emerging field, aims at generating much smaller but efficient synthetic training datasets from large ones. Existing DD methods based on gradient matching achieve leading performance; however, they are extremely computationally intensive as they require continuously optimizing a dataset among thousands of randomly initialized models. In this paper, we assume that training the synthetic data with diverse models leads to better generalization performance. Thus we propose two model augmentation techniques, i.e. using early-stage models and parameter perturbation to learn an informative synthetic set with significantly reduced training cost. Extensive experiments demonstrate that our method achieves up to 20× speedup and comparable performance on par with state-of-the-art methods.
Lei Zhang 0197, Jie Zhang 0081, Bowen Lei, Subhabrata Mukherjee, Xiang Pan 0001, Bo Zhao 0023, Caiwen Ding, Yao Li 0015, Dongkuan Xu
CVPR1
2022 Towards Efficient Data Free Blackbox Adversarial Attack
abstract
Classic black-box adversarial attacks can take advantage of transferable adversarial examples generated by a similar substitute model to successfully fool the target model. However, these substitute models need to be trained by target models' training data, which is hard to acquire due to privacy or transmission reasons. Recognizing the limited availability of real data for adversarial queries, recent works proposed to train substitute models in a data-free black-box scenario. However, their generative adversarial networks (GANs) based framework suffers from the convergence failure and the model collapse, resulting in low efficiency. In this paper, by rethinking the collaborative relationship between the generator and the substitute model, we design a novel black-box attack framework. The proposed method can efficiently imitate the target model through a small number of queries and achieve high attack success rate. The comprehensive experiments over six datasets demonstrate the effectiveness of our method against the state-of-the-art attacks. Especially, we conduct both label-only and probability-only attacks on the Microsoft Azure online model, and achieve a 100% attack success rate with only 0.46% query budget of the SOTA method [49].
Jie Zhang 0081, Bo Li 0115, Jianghe Xu, Shuang Wu 0001, Shouhong Ding, Lei Zhang 0197, Chao Wu 0001
CVPR6
2022 Adversarial Examples for Good: Adversarial Examples Guided Imbalanced Learning
abstract
Adversarial examples are inputs for machine learning models that have been designed by attackers to cause the model to make mistakes. In this paper, we demonstrate that adversarial examples can also be utilized for good to improve the performance of imbalanced learning. We provide a new perspective on how to deal with imbalanced data: adjust the biased decision boundary by training with Guiding Adversarial Examples (GAEs). Our method can effectively increase the accuracy of minority classes while sacrificing little accuracy on majority classes. We empirically show, on several benchmark datasets, our proposed method is comparable to the state-of-the-art method. To our best knowledge, we are the first to deal with imbalanced learning with adversarial examples.
Jie Zhang 0081, Lei Zhang 0197, Gang Li 0050, Chao Wu 0001
ICIP2