Shiliang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shiliang Zhang has a total of 153 co-authors. Here are the top co-authors by number of shared publications:
- Qi Tian
Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen, China and Huawei Technologies Ltd., Shenzhen, China
9 shared publications - Yaowei Wang
Harbin Institute of Technology (Shenzhen), Shenzhen, China and Pengcheng Laboratory, Shenzhen, China
9 shared publications - Tiejun Huang
Peking University
7 shared publications - Hao Chen
State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China
6 shared publications - Ming Yang
Ant Group, Hangzhou, China
5 shared publications Wen Gao
Department of Electrical Engineering and Computer Science, Peking University, Beijing, China
5 shared publications
Latest Publications
- 22 September 2026
- Published by Springer Nature
- p. 168-188
Prefill-Time Interventions Against Adversarial Attacks on Large Vision-Language Models
- 22 September 2026
- Published by Springer Nature
- p. 168-188
Prefill-Time Interventions Against Adversarial Attacks on Large Vision-Language Models
- 11 September 2026
- Published by Springer Nature
- p. 313-332
DiverseAD: A Large-Scale Driving Dataset with Diverse Atmospheric Conditions
- 11 September 2026
- Published by Springer Nature
- p. 313-332
DiverseAD: A Large-Scale Driving Dataset with Diverse Atmospheric Conditions
- Open Access
- 6 June 2026
- Published by Elsevier in SSRN Electronic Journal
FlattenGPT: Depth Compression for Transformer with Layer Flattening
Recent works have indicated redundancy across transformer blocks, prompting the research of depth compression to prune less crucial blocks. However, current ways of entire-block pruning suffer from risks of discarding meaningful cues learned in those blocks, leading to substantial performance degradation. As another line of model compression, channel pruning can better preserve performance, while it cannot reduce model depth and thus often brings limited latency reduction in autoregressive inference. To pursue better model compression and acceleration, this paper proposes FlattenGPT, a novel way to detect and reduce depth-wise redundancies.By flatting two adjacent blocks into one, it compresses the network depth, meanwhile enables more effective parameter redundancy detection and removal. FlattenGPT allows to preserve the knowledge learned in all blocks, and remains consistent with the original transformer architecture. Extensive experiments demonstrate that FlattenGPT enhances model efficiency with a decent trade-off to performance. It outperforms existing pruning methods in both zero-shot accuracies and WikiText-2 perplexity across various model types and parameter sizes. On LLaMA-2/3 and Qwen-1.5 models, FlattenGPT retains 90-96% of zero-shot performance with a compression ratio of 20%. It also outperforms other pruning methods in accelerating LLM inference, making it promising for enhancing the efficiency of transformers.
- 6 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessFlattenGPT: Depth Compression for Transformer with Layer Flattening
Recent works have indicated redundancy across transformer blocks, prompting the research of depth compression to prune less crucial blocks. However, current ways of entire-block pruning suffer from risks of discarding meaningful cues learned in those blocks, leading to substantial performance degradation. As another line of model compression, channel pruning can better preserve performance, while it cannot reduce model depth and thus often brings limited latency reduction in autoregressive inference. To pursue better model compression and acceleration, this paper proposes FlattenGPT, a novel way to detect and reduce depth-wise redundancies.By flatting two adjacent blocks into one, it compresses the network depth, meanwhile enables more effective parameter redundancy detection and removal. FlattenGPT allows to preserve the knowledge learned in all blocks, and remains consistent with the original transformer architecture. Extensive experiments demonstrate that FlattenGPT enhances model efficiency with a decent trade-off to performance. It outperforms existing pruning methods in both zero-shot accuracies and WikiText-2 perplexity across various model types and parameter sizes. On LLaMA-2/3 and Qwen-1.5 models, FlattenGPT retains 90-96% of zero-shot performance with a compression ratio of 20%. It also outperforms other pruning methods in accelerating LLM inference, making it promising for enhancing the efficiency of transformers.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. PP  (15209210) , 1-11
PDF: Prompt-Guided Decoupled Feature Learning for Cloth-Changing Person Re-Identification
Cloth-changing person re-identification (CC-ReID) aims to extract cloth-irrelevant visual features to match individuals across different outfits. While images contain rich visual cues, textual descriptions often provide explicit and structured attribute information, offering a potential pathway to decouple and suppress cloth-relevant features in visual representations. In this paper, we propose a novel prompt-guided decoupled feature learning framework that leverages text prompts to guide the learning of cloth-irrelevant features for CC-ReID. Given that human-annotated descriptions are typically unavailable in CC-ReID datasets, we explore the use of prompts generated by multimodal large language models (MLLMs) as a substitute. To extract cloth-relevant features, we design a prompt-guided visual feature extractor that learns attribute-aware features aligned with the prompts. A decoupled feature learning module is then employed to suppress the cloth-relevant components from the raw visual features. Through this prompt-guided learning strategy, our framework is able to construct cloth-irrelevant representations. Extensive experiments on multiple CC-ReID benchmarks demonstrate that our method outperforms existing state-of-the-art approaches, validating its effectiveness and robustness.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. PP  (15209210) , 1-11
PDF: Prompt-Guided Decoupled Feature Learning for Cloth-Changing Person Re-Identification
Cloth-changing person re-identification (CC-ReID) aims to extract cloth-irrelevant visual features to match individuals across different outfits. While images contain rich visual cues, textual descriptions often provide explicit and structured attribute information, offering a potential pathway to decouple and suppress cloth-relevant features in visual representations. In this paper, we propose a novel prompt-guided decoupled feature learning framework that leverages text prompts to guide the learning of cloth-irrelevant features for CC-ReID. Given that human-annotated descriptions are typically unavailable in CC-ReID datasets, we explore the use of prompts generated by multimodal large language models (MLLMs) as a substitute. To extract cloth-relevant features, we design a prompt-guided visual feature extractor that learns attribute-aware features aligned with the prompts. A decoupled feature learning module is then employed to suppress the cloth-relevant components from the raw visual features. Through this prompt-guided learning strategy, our framework is able to construct cloth-irrelevant representations. Extensive experiments on multiple CC-ReID benchmarks demonstrate that our method outperforms existing state-of-the-art approaches, validating its effectiveness and robustness.
- 19 May 2026
- Published by Elsevier in Pattern Recognition
- Vol. 180
VideoAligner: Text-driven feature decomposition for precise video–text alignment
- 19 May 2026
- Published by Elsevier in Pattern Recognition
- Vol. 180
VideoAligner: Text-driven feature decomposition for precise video–text alignment
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28  (15209210) , 4420-4432
SA-BCT: Self-Adapting Backward-Compatible Training
Backward-compatible training enables the deployment of advanced models without requiring updates to old gallery databases. However, existing methods, including old-prototype-based (i.e., those relying on prototypes from the old model) and instance-based approaches, often overlook the impact of the old model's quality. High-quality old models exhibit compact intra-class feature distributions, which facilitate effective alignment between old and new models across various methods. In contrast, low-quality old models produce dispersed features, making it difficult for old-prototype-based methods to extract sufficient information. Additionally, instance-based methods are overly restrictive, limiting the flexibility of new models. In this work, we propose SA-BCT, an extremely simple yet effective backward-compatible training method that offers a unified framework for accommodating old models of varying quality. SA-BCT employs a single loss function applied to both old and new features, self-adaptively adjusting the constraint space for new features based on the distribution of old features. Extensive experiments in diverse settings demonstrate the effectiveness of SA-BCT. Code is available at https://github.com/yuleung/SA-BCT.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28  (15209210) , 4420-4432
SA-BCT: Self-Adapting Backward-Compatible Training
Backward-compatible training enables the deployment of advanced models without requiring updates to old gallery databases. However, existing methods, including old-prototype-based (i.e., those relying on prototypes from the old model) and instance-based approaches, often overlook the impact of the old model's quality. High-quality old models exhibit compact intra-class feature distributions, which facilitate effective alignment between old and new models across various methods. In contrast, low-quality old models produce dispersed features, making it difficult for old-prototype-based methods to extract sufficient information. Additionally, instance-based methods are overly restrictive, limiting the flexibility of new models. In this work, we propose SA-BCT, an extremely simple yet effective backward-compatible training method that offers a unified framework for accommodating old models of varying quality. SA-BCT employs a single loss function applied to both old and new features, self-adaptively adjusting the constraint space for new features based on the distribution of old features. Extensive experiments in diverse settings demonstrate the effectiveness of SA-BCT. Code is available at https://github.com/yuleung/SA-BCT.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28  (15209210) , 2226-2237
Efficient Human Feature Refinement for Weakly Supervised Group Activity Recognition
Weakly supervised group activity recognition (WSGAR) aims to identify the joint activity of a group of people without relying on hand-annotated human bounding boxes. Existing WSGAR methods typically acquire coarse human-level features by pooling from detected bounding boxes or applying human queries with cross attentions. These approaches focus on learning human relations from the acquired features. However, discriminative person-specific clues might be confused with irrelevant backgrounds, hindering the effectiveness of downstream human relation learning. To address this limitation, we propose a Human Feature Refinement framework that enhances human-level information with graph convolutional networks and self-attention. We define in-box regions as tokens and learn their spatial correspondence through GCN and self-attention. By explicitly extracting in-box details and suppressing irrelevant regions, our method acquires more discriminative human-level features for relation learning and group activity prediction. We further propose a Graph-based Token Merging algorithm to reduce the computation cost of Human Feature Refinement, while minimizing information loss and overfitting risk. Experiments show that our method outperforms previous WSGAR methods on Volleyball, NBA and JRDB-PAR benchmarks, with reduced computation cost.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28  (15209210) , 2226-2237
Efficient Human Feature Refinement for Weakly Supervised Group Activity Recognition
Weakly supervised group activity recognition (WSGAR) aims to identify the joint activity of a group of people without relying on hand-annotated human bounding boxes. Existing WSGAR methods typically acquire coarse human-level features by pooling from detected bounding boxes or applying human queries with cross attentions. These approaches focus on learning human relations from the acquired features. However, discriminative person-specific clues might be confused with irrelevant backgrounds, hindering the effectiveness of downstream human relation learning. To address this limitation, we propose a Human Feature Refinement framework that enhances human-level information with graph convolutional networks and self-attention. We define in-box regions as tokens and learn their spatial correspondence through GCN and self-attention. By explicitly extracting in-box details and suppressing irrelevant regions, our method acquires more discriminative human-level features for relation learning and group activity prediction. We further propose a Graph-based Token Merging algorithm to reduce the computation cost of Human Feature Refinement, while minimizing information loss and overfitting risk. Experiments show that our method outperforms previous WSGAR methods on Volleyball, NBA and JRDB-PAR benchmarks, with reduced computation cost.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10867-10875
HDCFN: Haze Distribution-aware Cross-modal Fusion Network for Infrared-guided Dense Haze Removal in UAVs
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10867-10875
Open AccessHDCFN: Haze Distribution-aware Cross-modal Fusion Network for Infrared-guided Dense Haze Removal in UAVs
- 27 September 2025
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 261
Generalization-preserving adaptation of vision-language models for open-vocabulary segmentation
- 27 September 2025
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 261
Generalization-preserving adaptation of vision-language models for open-vocabulary segmentation
- Open Access
Efficient Multi-modal Long Context Learning for Training-free Adaptation
Traditional approaches to adapting multi-modal large language models (MLLMs) to new tasks have relied heavily on fine-tuning. This paper introduces Efficient Multi-Modal Long Context Learning (EMLoC), a novel training-free alternative that embeds demonstration examples directly into the model input. EMLoC offers a more efficient, flexible, and scalable solution for task adaptation. Because extremely lengthy inputs introduce prohibitive computational and memory overhead, EMLoC contributes a chunk-wise compression mechanism combined with layer-wise adaptive pruning. It condenses long-context multimodal inputs into compact, task-specific memory representations. By adaptively pruning tokens at each layer under a Jensen-Shannon divergence constraint, our method achieves a dramatic reduction in inference complexity without sacrificing performance. This approach is the first to seamlessly integrate compression and pruning techniques for multi-modal long-context learning, offering a scalable and efficient solution for real-world applications. Extensive experiments on diverse vision-language benchmarks demonstrate that EMLoC achieves performance on par with or superior to naive long-context approaches. Our results highlight the potential of EMLoC as a groundbreaking framework for efficient and flexible adaptation of multi-modal models in resource-constrained environments. Codes are publicly available at https://github.com/Zehong-Ma/EMLoC.
Open AccessEfficient Multi-modal Long Context Learning for Training-free Adaptation
Traditional approaches to adapting multi-modal large language models (MLLMs) to new tasks have relied heavily on fine-tuning. This paper introduces Efficient Multi-Modal Long Context Learning (EMLoC), a novel training-free alternative that embeds demonstration examples directly into the model input. EMLoC offers a more efficient, flexible, and scalable solution for task adaptation. Because extremely lengthy inputs introduce prohibitive computational and memory overhead, EMLoC contributes a chunk-wise compression mechanism combined with layer-wise adaptive pruning. It condenses long-context multimodal inputs into compact, task-specific memory representations. By adaptively pruning tokens at each layer under a Jensen-Shannon divergence constraint, our method achieves a dramatic reduction in inference complexity without sacrificing performance. This approach is the first to seamlessly integrate compression and pruning techniques for multi-modal long-context learning, offering a scalable and efficient solution for real-world applications. Extensive experiments on diverse vision-language benchmarks demonstrate that EMLoC achieves performance on par with or superior to naive long-context approaches. Our results highlight the potential of EMLoC as a groundbreaking framework for efficient and flexible adaptation of multi-modal models in resource-constrained environments. Codes are publicly available at https://github.com/Zehong-Ma/EMLoC.