Guilin Li

Mr. Guilin Li

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
6 July 2024 in Neurocomputing
Verified
Journal Article
Closed access
SZShaokun Zhang
Shaokun Zhang
XZXiawu Zheng
Xiawu Zheng
GLGuilin Li
Guilin Li
CYChenyi Yang
Chenyi Yang
YLYuchao Li
Yuchao Li
RJRongrong Ji
Rongrong Ji

28 October 2024
Verified
Conference Paper
Open access
GLGuilin Li
Guilin Li
MZMengdan Zhang
Mengdan Zhang
XZXiawu Zheng
Xiawu Zheng
PCPeixian Chen
Peixian Chen
ZWZihan Wang
Zihan Wang
RJRongrong Ji
Rongrong Ji
The integration of large language models into open-world detection frameworks significantly improves versatility in new environments. Prompt representations derived from these models help establish classification boundaries for both base and novel categories within open-world detectors. However, we are the first to discover that directly fine-tuning language models in detection systems results in redundant attention patterns and leads to suboptimal prompt representations. In order to fully leverage the capabilities of large language models and augment prompt encoding for detection, this study introduces a redundancy assessment metric to identify uniform attention patterns. Furthermore, in areas with high redundancy, we incorporate multimodal inplace prompt tuning (MIPT) to enrich the text prompt with visual clues. Experimental results validate the efficacy of our MIPT framework, achieving a notable increase across benchmarks, e.g. elevating GLIP-L from 22.6% to 25.0% on ODinW-35, and 9.0% improvement on LVIS.

7 February 2024 in Electronics
Verified
Journal Article
Open access
PDF file
GLGuilin Li
Guilin Li
LTLang Tang
Lang Tang
XZXiawu Zheng
Xiawu Zheng
Neural network pruning has been widely studied for model compression and acceleration, to facilitate model deployment in resource-limited scenarios. Conventional methods either require domain knowledge to manually design the pruned model architecture and pruning algorithm, or AutoML-based methods to search the pruned model architecture but still prune all layers with a single pruning algorithm. However, many pruning algorithms have been proposed and they all differ regarding the importance they attribute to the criterion of filters. Therefore, we propose a hybrid search method, searching for the pruned model architecture and the pruning algorithm at the same time, which automatically finds the pruning ratio and pruning algorithm for each convolution layer. Moreover, to be more efficient, we divide the search process into two phases. Firstly, we search in a huge space with adaptive batch normalization, which is a fast but relatively inaccurate model evaluation method; secondly, we search based on the previous results and evaluate models by fine-tuning, which is more accurate. Therefore, our proposed hybrid search method is efficient, and achieves a clear improvement in performance compared to current state-of-the-art methods, including AMC, MetaPruning, and ABCPruner. For example, when pruning MobileNet, we achieve a 59.8% test accuracy on ImageNet with only 49 M FLOPs, which is 2.6% higher than MetaPruning.