Shuhan Qi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shuhan Qi has a total of 147 co-authors. Here are the top co-authors by number of shared publications:
- Xuan Wang
School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China
21 shared publications - Jiajia Zhang
School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China
15 shared publications Xuan Wang
12 shared publications- Huale Li
School of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China
7 shared publications - Qing Liao
Harbin Institute of Technology, Shenzhen, China
6 shared publications - Yang Liu
Department of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen 518055, China
6 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 16392-16400
Text-Guided Prior Decoupling and Alignment for Few-Shot Surface Defect Segmentation
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 16392-16400
Open AccessText-Guided Prior Decoupling and Alignment for Few-Shot Surface Defect Segmentation
- Open Access
- 27 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 813
Strategic allocation and dynamic rescue for multi-defender stackelberg security games with infectious attacks
Interconnected systems can suffer infectious attacks, where the compromise of one node exposes neighboring nodes and may trigger cascading loss. Existing Stackelberg and network-defense models usually address only part of this setting: a centralized defender, independent targets, or no post-attack resource transfer. This paper studies an observable pure-strategy setting in which multiple heterogeneous defenders independently allocate limited resources before an attacker selects a target. A publicly announced response rule fixed before deployment then reallocates transferable surplus after the target is observed. We formulate the resulting allocation game by backward induction: rescue is target-contingent for every allocation–target pair, the attacker anticipates that response when choosing a target, and defenders anticipate both continuation stages when choosing their allocations. We give a necessary-and-sufficient equilibrium characterization and sufficient conditions for pure-strategy existence, and use a centralized MILP only as an aggregate minimax benchmark. The optimal rescue problem is NP-hard even with fixed initial allocation and target. We therefore propose a two-stage heuristic aimed at the $$(\epsilon ,\xi )$$ -SNE conditions: equilibrium-guided initial allocation followed by feasible node-level greedy rescue. Experiments on three simulated and three real-world networks show lower aggregate loss than the tested baselines on all six datasets, at the cost of additional runtime. On the tested power-law instances, the method remains close to the centralized MILP lower-bound benchmark.- 27 August 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (7) , 813
Open AccessStrategic allocation and dynamic rescue for multi-defender stackelberg security games with infectious attacks
Interconnected systems can suffer infectious attacks, where the compromise of one node exposes neighboring nodes and may trigger cascading loss. Existing Stackelberg and network-defense models usually address only part of this setting: a centralized defender, independent targets, or no post-attack resource transfer. This paper studies an observable pure-strategy setting in which multiple heterogeneous defenders independently allocate limited resources before an attacker selects a target. A publicly announced response rule fixed before deployment then reallocates transferable surplus after the target is observed. We formulate the resulting allocation game by backward induction: rescue is target-contingent for every allocation–target pair, the attacker anticipates that response when choosing a target, and defenders anticipate both continuation stages when choosing their allocations. We give a necessary-and-sufficient equilibrium characterization and sufficient conditions for pure-strategy existence, and use a centralized MILP only as an aggregate minimax benchmark. The optimal rescue problem is NP-hard even with fixed initial allocation and target. We therefore propose a two-stage heuristic aimed at the $$(\epsilon ,\xi )$$ -SNE conditions: equilibrium-guided initial allocation followed by feasible node-level greedy rescue. Experiments on three simulated and three real-world networks show lower aggregate loss than the tested baselines on all six datasets, at the cost of additional runtime. On the tested power-law instances, the method remains close to the centralized MILP lower-bound benchmark. - 19 July 2026
- Published by Springer Nature
- p. 316-331
Policy Extraction-Based Adversarial Attack in Multi-Agent Reinforcement Learning
- 19 July 2026
- Published by Springer Nature
- p. 316-331
Policy Extraction-Based Adversarial Attack in Multi-Agent Reinforcement Learning
- 24 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
DCMF-BFL: A decentralized consensus multi-factor approach for blockchain-based federated learning
- 24 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
DCMF-BFL: A decentralized consensus multi-factor approach for blockchain-based federated learning
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8533-8536
AWMA-MoE: Attention-Guided Watermark Adapter with MoE for Latent Diffusion Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8533-8536
Open AccessAWMA-MoE: Attention-Guided Watermark Adapter with MoE for Latent Diffusion Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1923-1934
PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1923-1934
Open AccessPruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation
- Open Access
- 25 March 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (6)
Nash equilibrium strategy solving in two-player imperfect-information games: a survey
- 25 March 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (6)
Open AccessNash equilibrium strategy solving in two-player imperfect-information games: a survey
- Open Access
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 25 (2) , 1-18
Orchestrating Prompt Expertise: Enhancing Knowledge Distillation via Expert-Guided Tuning
Multi-teacher knowledge distillation transfers knowledge from multiple large teacher models to a small student model and has performed well on many downstream tasks. However, when distilling knowledge from multiple teachers, it always suffers from the severe problems of being time-consuming and storage-extensive for multiple teacher models training and inference. We present MoE-KD, a simple but effective framework that produces supervision for training the student model from one single teacher model, which fixes the above problems and improves effectiveness. In the proposed MoE-KD, multiple trainable prompts are used to extract different views of samples from a single pre-trained language model and only a few parameters (prompts) need to be trained and stored. To guarantee the generated supervision signals with increased robustness and correctness, we introduce an uncertainty-based mechanism and a selector module, which routes the input instance to its corresponding teacher. We have also extended MoE KD to lifelong learning scenarios, proposing a lightweight solution for catastrophic forgetting. We conduct experiments on traditional KD scenarios and lifelong learning scenarios. MoE-KD yields improvements up to 1.1% and 140% in accuracy and efficiency in knowledge distillation and 2.8% improvements on average in lifelong learning, compared with the strong baseline methods.
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 25 (2) , 1-18
Open AccessOrchestrating Prompt Expertise: Enhancing Knowledge Distillation via Expert-Guided Tuning
Multi-teacher knowledge distillation transfers knowledge from multiple large teacher models to a small student model and has performed well on many downstream tasks. However, when distilling knowledge from multiple teachers, it always suffers from the severe problems of being time-consuming and storage-extensive for multiple teacher models training and inference. We present MoE-KD, a simple but effective framework that produces supervision for training the student model from one single teacher model, which fixes the above problems and improves effectiveness. In the proposed MoE-KD, multiple trainable prompts are used to extract different views of samples from a single pre-trained language model and only a few parameters (prompts) need to be trained and stored. To guarantee the generated supervision signals with increased robustness and correctness, we introduce an uncertainty-based mechanism and a selector module, which routes the input instance to its corresponding teacher. We have also extended MoE KD to lifelong learning scenarios, proposing a lightweight solution for catastrophic forgetting. We conduct experiments on traditional KD scenarios and lifelong learning scenarios. MoE-KD yields improvements up to 1.1% and 140% in accuracy and efficiency in knowledge distillation and 2.8% improvements on average in lifelong learning, compared with the strong baseline methods.
- Open Access
Fast-Slow Efficient Training for Multimodal Large Language Models via Visual Token Pruning
Multimodal Large Language Models (MLLMs) suffer from severe training inefficiency issue, which is associated with their massive model sizes and visual token numbers. Existing efforts in efficient training focus on reducing model sizes or trainable parameters. Inspired by the success of Visual Token Pruning (VTP) in improving inference efficiency, we are exploring another substantial research direction for efficient training by reducing visual tokens. However, applying VTP at the training stage results in a training-inference mismatch: pruning-trained models perform poorly when inferring on non-pruned full visual token sequences. To close this gap, we propose DualSpeed, a fast-slow framework for efficient training of MLLMs. The fast-mode is the primary mode, which incorporates existing VTP methods as plugins to reduce visual tokens, along with a mode isolator to isolate the model's behaviors. The slow-mode is the auxiliary mode, where the model is trained on full visual sequences to retain training-inference consistency. To boost its training, it further leverages self-distillation to learn from the sufficiently trained fast-mode. Together, DualSpeed can achieve both training efficiency and non-degraded performance. Experiments show DualSpeed accelerates the training of LLaVA-1.5 by 2.1$\times$ and LLaVA-NeXT by 4.0$\times$, retaining over 99% performance. Code: https://github.com/dingkun-zhang/DualSpeed
Open AccessFast-Slow Efficient Training for Multimodal Large Language Models via Visual Token Pruning
Multimodal Large Language Models (MLLMs) suffer from severe training inefficiency issue, which is associated with their massive model sizes and visual token numbers. Existing efforts in efficient training focus on reducing model sizes or trainable parameters. Inspired by the success of Visual Token Pruning (VTP) in improving inference efficiency, we are exploring another substantial research direction for efficient training by reducing visual tokens. However, applying VTP at the training stage results in a training-inference mismatch: pruning-trained models perform poorly when inferring on non-pruned full visual token sequences. To close this gap, we propose DualSpeed, a fast-slow framework for efficient training of MLLMs. The fast-mode is the primary mode, which incorporates existing VTP methods as plugins to reduce visual tokens, along with a mode isolator to isolate the model's behaviors. The slow-mode is the auxiliary mode, where the model is trained on full visual sequences to retain training-inference consistency. To boost its training, it further leverages self-distillation to learn from the sufficiently trained fast-mode. Together, DualSpeed can achieve both training efficiency and non-degraded performance. Experiments show DualSpeed accelerates the training of LLaVA-1.5 by 2.1$\times$ and LLaVA-NeXT by 4.0$\times$, retaining over 99% performance. Code: https://github.com/dingkun-zhang/DualSpeed
- Open Access
PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) has become a powerful framework for enhancing large language models in knowledge-intensive and reasoning tasks. However, as reasoning chains deepen or search trees expand, RAG systems often face two persistent failures: evidence forgetting, where retrieved knowledge is not effectively used, and inefficiency, caused by uncontrolled query expansions and redundant retrieval. These issues reveal a critical gap between retrieval and evidence utilization in current RAG architectures. We propose PruneRAG, a confidence-guided query decomposition framework that builds a structured query decomposition tree to perform stable and efficient reasoning. PruneRAG introduces three key mechanisms: adaptive node expansion that regulates tree width and depth, confidence-guided decisions that accept reliable answers and prune uncertain branches, and fine-grained retrieval that extracts entity-level anchors to improve retrieval precision. Together, these components preserve salient evidence throughout multi-hop reasoning while significantly reducing retrieval overhead. To better analyze evidence misuse, we define the Evidence Forgetting Rate as a metric to quantify cases where golden evidence is retrieved but not correctly used. Extensive experiments across various multi-hop QA benchmarks show that PruneRAG achieves superior accuracy and efficiency over state-of-the-art baselines.
Open AccessPruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) has become a powerful framework for enhancing large language models in knowledge-intensive and reasoning tasks. However, as reasoning chains deepen or search trees expand, RAG systems often face two persistent failures: evidence forgetting, where retrieved knowledge is not effectively used, and inefficiency, caused by uncontrolled query expansions and redundant retrieval. These issues reveal a critical gap between retrieval and evidence utilization in current RAG architectures. We propose PruneRAG, a confidence-guided query decomposition framework that builds a structured query decomposition tree to perform stable and efficient reasoning. PruneRAG introduces three key mechanisms: adaptive node expansion that regulates tree width and depth, confidence-guided decisions that accept reliable answers and prune uncertain branches, and fine-grained retrieval that extracts entity-level anchors to improve retrieval precision. Together, these components preserve salient evidence throughout multi-hop reasoning while significantly reducing retrieval overhead. To better analyze evidence misuse, we define the Evidence Forgetting Rate as a metric to quantify cases where golden evidence is retrieved but not correctly used. Extensive experiments across various multi-hop QA benchmarks show that PruneRAG achieves superior accuracy and efficiency over state-of-the-art baselines.