EDBT 2026 Demo / reviewers in the wild / expert
Jiayu Zhang 0001
dblp:189/6819-1
· DBLP profile ↗
8ranked-venue papers in the field
1as first author
8since 2021 · last 2026
0009-0008-6636-8656ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 4 (1 first)Information Retrieval & Web Search · 4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | K&L: Penetrating Backdoor Defense with Key and Locks
Xinyi Wang 0005, Jiayu Zhang 0001, Zhibo Jin, Dong Yuan 0001, Huaming Chen |
WWW | 2 |
| 2025 | PAR-AdvGAN: Improving Adversarial Attack Capability with Progressive Auto-regression AdvGAN
Jiayu Zhang 0001, Xinyi Wang 0005, Silin Liao, Zhibo Jin, Flora D. Salim, Huaming Chen |
ECML/PKDD (7) | 1 |
| 2024 | Improving Adversarial Transferability via Frequency-Guided Sample Relevance AttackabstractDeep neural networks (DNNs) are known to be vulnerable to adversarial examples. To facilitate model safety, transfer-based attacks employ surrogate models to craft adversarial examples. In this work, we firstly study the intricate mechanisms of such attacks. We observe a correlation between the sharpness of decision boundaries in model sensitive regions and overfitting during adversarial training, which hampers the adversarial examples' transferability. To address this issue, we propose a novel approach termed Frequency-Guided Sample Relevance Attack (FGSRA). Specifically, we leverage frequency information to explore similar sensitive regions across different models, thereby generating neighborhood samples. Additional similarity weights are subsequently introduced to assess the adversarial contribution of the neighborhood samples. A hybrid gradient is then obtained to thoroughly exploit neighborhood information within input samples. Extensive experiments demonstrate the prominent performance of our approach. Compared to other state-of-the-art benchmarks on surrogate model Inc-v3, our method has an average improvement of 27.21% for normally trained CNNs and 42.1% for adversarially trained CNNs. Moreover, we achieve an average improvement of 24.6% for ViTs. Our code is available at:https://github.com/LMBTough/FGSRA Xinyi Wang 0005, Zhibo Jin, Jiayu Zhang 0001, Huaming Chen |
CIKM | 4 |
| 2024 | GE-AdvGAN: Improving the transferability of adversarial samples by gradient editing-based adversarial generative modelabstractAdversarial generative models, such as Generative Adversarial Networks (GANs), are widely applied for generating various types of data, i.e., images, text, and audio. Accordingly, its promising performance has led to the GAN-based adversarial attack methods in the white-box and black-box attack scenarios. The importance of transferable black-box attacks lies in their ability to be effective across different models and settings, more closely aligning with real-world applications. However, it remains challenging to retain the performance in terms of transferable adversarial examples for such methods. Meanwhile, we observe that some enhanced gradient-based transferable adversarial attack algorithms require prolonged time for adversarial sample generation. Thus, in this work, we propose a novel algorithm named GE-AdvGAN to enhance the transferability of adversarial samples whilst improving the algorithm's efficiency. The main approach is via optimising the training process of the generator parameters. With the functional and characteristic similarity analysis, we introduce a novel gradient editing (GE) mechanism and verify its feasibility in generating transferable samples on various models. Moreover, by exploring the frequency domain information to determine the gradient editing direction, GE-AdvGAN can generate highly transferable adversarial samples while minimizing the execution time in comparison to the state-of-the-art transferable adversarial attack algorithms. The performance of GE-AdvGAN is comprehensively evaluated by large-scale experiments on different datasets, which results demonstrate the superiority of our algorithm. The code for our algorithm is available at: https://github.com/LMBTough/GE-advGAN. Huaming Chen, Xinyi Wang 0005, Jiayu Zhang 0001, Zhibo Jin, Kim-Kwang Raymond Choo, Jun Shen 0001, Dong Yuan 0001 |
SDM | 4 |
| 2023 | DANAA: Towards Transferable Attacks with Double Adversarial Neuron Attribution
Zhibo Jin, Xinyi Wang 0005, Jiayu Zhang 0001, Jun Shen 0001, Huaming Chen |
ADMA (2) | 4 |
| 2023 | FVW: Finding Valuable Weight on Deep Neural Network for Model PruningabstractThe rapid development of deep learning has demonstrated its potential for deployment in many intelligent service systems. However, some issues such as optimisation (e.g., how to reduce the deployment resources costs and further improve the detection speed), especially in scenarios where limited resources are available, remain challenging to address. In this paper, we aim to delve into the principles of deep neural networks, focusing on the importance of network neurons. The goal is to identify the neurons that exert minimal impact on model performances, thereby aiding in the process of model pruning. In this work, we have thoroughly considered the deep learning model pruning process with and without fine-tuning step, ensuring the model performance consistency. To achieve our objectives, we propose a methodology that employs adversarial attack methods to explore deep neural network parameters. This approach is combined with an innovative attribution algorithm to analyse the level of network neurons involvement. In our experiments, our approach can effectively quantify the importance of network neuron. We extend the evaluation through comprehensive experiments conducted on a range of datasets, including CIFAR-10, CIFAR-100 and Caltech101. The results demonstrate that, our method have consistently achieved the state-of-the-art performance over many existing methods. We anticipate that this work will help to reduce the heavy training and inference cost of deep neural network models where a lightweight deep learning enhanced service and system is possible. The source code is open source at https://github.com/LMBTough/FVW. Huaming Chen, Zhibo Jin, Xinyi Wang 0005, Jiayu Zhang 0001, Minhui Xue 0001, Qinghua Lu 0001, Jun Shen 0001, Kim-Kwang Raymond Choo |
CIKM | 5 |
| 2023 | Improving Adversarial Transferability via Frequency-based Stationary Point SearchabstractDeep neural networks (DNNs) have been shown vulnerable to interference from adversarial samples, leading to erroneous predictions. Investigating adversarial attacks can effectively improve the reliability as well as the performance of deep neural models in real-world applications. Since it is generally challenging to infer the parameters in black-box models, high transferability becomes an important factor for the success rate of an attack method. Recently, the Spectrum Simulation Attack method exhibits promising results based on the frequency domain. In light of SSA, we propose a novel attack approach in this paper, which achieves the best results among diverse state-of-the-art transferable adversarial attack methods. Our method aims to find a stationary point, which extends the ability to find multiple local optima with the optimal local attack effect. After finding the stationary point, a frequency-based search is employed to explore the best adversarial samples in the neighbouring space, utilmately determining the final adversarial direction. We compare our method against a variety of cutting-edge transferable adversarial methods. Extensive experiments validate that our method improves the attack success rate by 4.7% for conventionally trained models and 53.1% for adversarially trained models. Our code is available at https://github.com/LMBTough/FSPS Huaming Chen, Jiayu Zhang 0001, Xinyi Wang 0005, Zhibo Jin, Qinghua Lu 0001, Jun Shen 0001, Kim-Kwang Raymond Choo |
CIKM | 3 |
| 2023 | Towards Minimising Perturbation Rate for Adversarial Machine Learning with Pruning
Jiayu Zhang 0001, Zhibo Jin, Xinyi Wang 0005, Minhui Xue 0001, Jun Shen 0001, Kim-Kwang Raymond Choo, Huaming Chen |
ECML/PKDD (1) | 2 |