Yaguan Qian

Dr. Yaguan Qian


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YQYaguan Qian
Yaguan Qian
KCKecheng Chen
Kecheng Chen
BWBin Wang
Bin Wang
ZGZhaoquan Gu
Zhaoquan Gu
SJShouling Ji
Shouling Ji
YZYanchun Zhang
Yanchun Zhang
Recent studies have shown that Deep Neural Networks (DNNs) are easily deceived by adversarial examples, revealing their serious vulnerability. Due to the transferability, adversarial examples can attack across multiple models with different architectures, called transfer-based black-box attacks. Input transformation is one of the most effective methods to improve adversarial transferability. In particular, the attacks fusing other categories of image information reveal the potential direction of adversarial attacks. However, the current techniques rely on input transformations in the spatial domain, which ignore the frequency information of the image and limit its transferability. To tackle this issue, we propose Mixed-Frequency Inputs (MFI) based on a frequency domain perspective. MFI alleviates the overfitting of adversarial examples to the source model by considering high-frequency components from various kinds of images in the process of calculating the gradient. By accumulating these high-frequency components, MFI acquires a more steady gradient direction in each iteration, leading to the discovery of better local maxima and enhancing transferability. Extensive experimental results on the ImageNet-compatible datasets demonstrate that MFI outperforms existing transform-based attacks with a clear margin on both Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs), which proves MFI is more suitable for realistic black-box scenarios.

15 September 2022 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
QLQiong Lou
Qiong Lou
YLYingying Li
Yingying Li
YQYaguan Qian
Yaguan Qian
FLFang Lu
Fang Lu
JMJinlian Ma
Jinlian Ma

19 May 2022 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
YQYaguan Qian
Yaguan Qian
YGYankai Guo
Yankai Guo
QSQiqi Shao
Qiqi Shao
JWJiamin Wang
Jiamin Wang
BWBin Wang
Bin Wang
CWChunming Wu
Chunming Wu
Edge intelligence has played an important role in constructing smart cities, but the vulnerability of edge nodes to adversarial attacks becomes an urgent problem. A so-called adversarial example can fool a deep learning model on an edge node for misclassification. Due to the transferability property of adversarial examples, an adversary can easily fool a black-box model by a local substitute model. Edge nodes in general have limited resources, which cannot afford a complicated defense mechanism like that on a cloud data center. To address the challenge, we propose a dynamic defense mechanism, namely EI-MTD. The mechanism first obtains robust member models of small size through differential knowledge distillation from a complicated teacher model on a cloud data center. Then, a dynamic scheduling policy, which builds on a Bayesian Stackelberg game, is applied to the choice of a target model for service. This dynamic defense mechanism can prohibit the adversary from selecting an optimal substitute model for black-box attacks. We also conduct extensive experiments to evaluate the proposed mechanism, and results show that EI-MTD could protect edge intelligence effectively against adversarial attacks in black-box settings.

10 July 2023 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
YDYinyao Dai
Yinyao Dai
YQYaguan Qian
Yaguan Qian
FLFang Lu
Fang Lu
BWBin Wang
Bin Wang
ZGZhaoquan Gu
Zhaoquan Gu
YZYanchun Zhang
Yanchun Zhang

23 October 2022
Verified
Book Chapter
Closed access
PDF file
ZHZhiqiang He
Zhiqiang He
YQYaguan Qian
Yaguan Qian
YWYuqi Wang
Yuqi Wang
BWBin Wang
Bin Wang
XGXiaohui Guan
Xiaohui Guan
WZWujie Zhou
Wujie Zhou

18 April 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YQYaguan Qian
Yaguan Qian
ZHZhiqiang He
Zhiqiang He
YWYuqi Wang
Yuqi Wang
BWBin Wang
Bin Wang
XLXiang Ling
Xiang Ling
WSWassim Swaileh
Wassim Swaileh
Convolutional neural networks (CNNs) have been successfully applied to various fields. However, CNNs’ overparameterization requires more memory and training time, making it unsuitable for some resource-constrained devices. To address this issue, filter pruning as one of the most efficient ways was proposed. In this article, we propose a feature-discrimination-based filter importance criterion, uniform response criterion (URC), as a key component of filter pruning. It converts the maximum activation responses into probabilities and then measures the importance of the filter through the distribution of these probabilities over classes. However, applying URC directly to global threshold pruning may cause some problems. The first problem is that some layers will be completely pruned under global pruning settings. The second problem is that global threshold pruning neglects that filters in different layers have different importance. To address these issues, we propose hierarchical threshold pruning (HTP) with URC. It performs a pruning step limited in a relatively redundant layer rather than comparing the filters’ importance across all layers, which can avoid some important filters being pruned. The effectiveness of our method benefits from three techniques: 1) measuring filter importance by URC; 2) normalizing filter scores; and 3) conducting prune in relatively redundant layers. Extensive experiments on CIFAR-10/100 and ImageNet show that our method achieves the state-of-the-art performance on multiple benchmarks.