Enhancing Low-Rank Adaptation with Recoverability-Based Reinforcement Pruning for Object Counting
Haojie Guo, Junyu Gao, Yuan Yuan
Abstract
Object counting is crucial for understanding the distribution of objects in different scenarios. Recently, many object counting networks have been designed to be more complex to achieve marginal improvements, leading to excessive time spent on model design. With the development of large models (LMs), various visual tasks can be accomplished by transferring pre-trained weights from LMs and fine-tuning them. However, tens of millions of training data make the pre-training parameters of LMs not entirely necessary. Moreover, if unnecessary parameters in the large model are not removed, it may lead to decreased performance on the tasks to be transferred. Motivated by this, this paper proposes an Enhancing low-Rank adaptation with Recoverability-based Reinforcement Pruning (E3RP) method to balance the complexity of large model and the accuracy of counting tasks. Firstly, we design a new reward mechanism based on the feature similarity of large model before and after globally unstructured pruning of specific parameters. Additionally, we propose a Patch Query Flip Attention (PQFA) mechanism to align multi-scale features through bidirectional interaction of features. Finally, the parameters of large model are pruned utilizing the pruning rate autonomously determined by the reinforcement learning network, and the large model is fine-tuned to counting tasks by a simple decoding head. Extensive experiments on four cross-scenario datasets demonstrate that the proposed method can remove redundant network parameters while ensuring network performance, with a maximum reduction of up to 63%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2d9110be-93eb-435a-beff-9a242cb480e6Cited by top-tier papers1
Ask how each one uses itBuilds on10
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu et al.ICLR 2022 · 18,833 citations
- Bayesian Loss for Crowd Count Estimation With Point SupervisionZhiheng Ma, Xing Wei, Xiaopeng Hong, Yihong GongICCV 2019 · 612 citations
- Prompt-aligned Gradient for Prompt TuningBeier Zhu, Yulei Niu, Yucheng Han, Yue Wu et al.ICCV 2023 · 475 citations
- A Fixed-Point Approach to Unified Prompt-Based CountingWei Lin, Antoni B. ChanAAAI 2024 · 11 citations
- Optimal Transport Minimization: Crowd Localization on Density Maps for Semi-Supervised CountingWei Lin, Antoni B. ChanCVPR 2023
Related papers
- DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank DistributionYulong Mao, Kaiyu Huang, Changhao Guan, Ganglin Bao et al.ACL 2024 · 15 citations
- PLoP: Precise LoRA Placement for Efficient Finetuning of Large ModelsSoufiane Hayou, Nikhil Ghosh, Bin YuICLR 2026 · 14 citations
- Learning Rate Scaling across LoRA Ranks and Transfer to Full FinetuningNan Chen, Soledad Villar, Soufiane HayouICML 2026 · 8 citations
- PAC-Net: A Model Pruning Approach to Inductive Transfer LearningSanghoon Myung, In Huh, Wonik Jang, Jae Myung Choe et al.ICML 2022 · 18 citations
- LeLoRA: Learnable Low-Rank Adaptation of Large Language ModelsXiaoling Zhou, Mingjie Zhang, Zhemg Lee, Wei Ye et al.ACL 2026
