Bo Lv
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bo Lv has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Li Jin
Aerospace Information Research Institute Chinese Academy of Sciences
2 shared publications - Nayu Liu
School of Computer Science and Technology Tianjin Laboratory Autonomous Intelligence Technology and Systems Tiangong University
2 shared publications Ping Luo
Institute of Computing Technology Key Lab of Intelligent Information Processing Chinese Academy of Sciences (ICT/CAS
2 shared publications- Xiaoyu Li
Aerospace Information Research Institute Chinese Academy of Sciences Beijing China
2 shared publications Xin Liu
2 shared publicationsYue Yu
2 shared publications
Latest Publications
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 25285-25298
Language Constrained Multimodal Hyper Adapter For Many-to-Many Multimodal Summarization
Nayu Liu, Fanglong Yao, Haoran Luo, Yong Yang, Chen Tang, Bo Lv. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 25285-25298
Open AccessLanguage Constrained Multimodal Hyper Adapter For Many-to-Many Multimodal Summarization
Nayu Liu, Fanglong Yao, Haoran Luo, Yong Yang, Chen Tang, Bo Lv. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 19516-19528
Whether LLMs Know If They Know: Identifying Knowledge Boundaries via Debiased Historical In-Context Learning
Bo Lv, Nayu Liu, Yang Shen, Xin Liu, Ping Luo, Yue Yu. Findings of the Association for Computational Linguistics: ACL 2025. 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 19516-19528
Open AccessWhether LLMs Know If They Know: Identifying Knowledge Boundaries via Debiased Historical In-Context Learning
Bo Lv, Nayu Liu, Yang Shen, Xin Liu, Ping Luo, Yue Yu. Findings of the Association for Computational Linguistics: ACL 2025. 2025.
- Open Access
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 4421-4434
URG: A Unified Ranking and Generation Method for Ensembling Language Models
Bo Lv, Chen Tang, Yanan Zhang, Xin Liu, Ping Luo, Yue Yu. Findings of the Association for Computational Linguistics ACL 2024. 2024.
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 4421-4434
Open AccessURG: A Unified Ranking and Generation Method for Ensembling Language Models
Bo Lv, Chen Tang, Yanan Zhang, Xin Liu, Ping Luo, Yue Yu. Findings of the Association for Computational Linguistics ACL 2024. 2024.
- 18 March 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (13) , 15718-15733
DPNet: domain-aware prototypical network for interdisciplinary few-shot relation classification
- 18 March 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (13) , 15718-15733
DPNet: domain-aware prototypical network for interdisciplinary few-shot relation classification
- Open Access
- 19 February 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (4) , 2185
Commonsense Knowledge-Aware Prompt Tuning for Few-Shot NOTA Relation Classification
Compared with the traditional few-shot task, the few-shot none-of-the-above (NOTA) relation classification focuses on the realistic scenario of few-shot learning, in which a test instance might not belong to any of the target categories. This undoubtedly increases the task’s difficulty because given only a few support samples, this cannot represent the distribution of NOTA categories in space. The model needs to make full use of the syntactic information and word meaning information learned in the pre-training stage to distinguish the NOTA category and the support sample category in the embedding space. However, previous fine-tuning methods mainly focus on optimizing the extra classifiers (on top of pre-trained language models (PLMs)) and neglect the connection between pre-training objectives and downstream tasks. In this paper, we propose the commonsense knowledge-aware prompt tuning (CKPT) method for a few-shot NOTA relation classification task. First, a simple and effective prompt-learning method is developed by constructing relation-oriented templates, which can further stimulate the rich knowledge distributed in PLMs to better serve downstream tasks. Second, external knowledge is incorporated into the model by a label-extension operation, which forms knowledgeable prompt tuning to improve and stabilize prompt tuning. Third, to distinguish the NOTA pairs and positive pairs in embedding space more accurately, a learned scoring strategy is proposed, which introduces a learned threshold classification function and improves the loss function by adding a new term focused on NOTA identification. Experiments on two widely used benchmarks (FewRel 2.0 and Few-shot TACRED) show that our method is a simple and effective framework, and a new state of the art is established in the few-shot classification field.
- 19 February 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (4) , 2185
Open AccessCommonsense Knowledge-Aware Prompt Tuning for Few-Shot NOTA Relation Classification
Compared with the traditional few-shot task, the few-shot none-of-the-above (NOTA) relation classification focuses on the realistic scenario of few-shot learning, in which a test instance might not belong to any of the target categories. This undoubtedly increases the task’s difficulty because given only a few support samples, this cannot represent the distribution of NOTA categories in space. The model needs to make full use of the syntactic information and word meaning information learned in the pre-training stage to distinguish the NOTA category and the support sample category in the embedding space. However, previous fine-tuning methods mainly focus on optimizing the extra classifiers (on top of pre-trained language models (PLMs)) and neglect the connection between pre-training objectives and downstream tasks. In this paper, we propose the commonsense knowledge-aware prompt tuning (CKPT) method for a few-shot NOTA relation classification task. First, a simple and effective prompt-learning method is developed by constructing relation-oriented templates, which can further stimulate the rich knowledge distributed in PLMs to better serve downstream tasks. Second, external knowledge is incorporated into the model by a label-extension operation, which forms knowledgeable prompt tuning to improve and stabilize prompt tuning. Third, to distinguish the NOTA pairs and positive pairs in embedding space more accurately, a learned scoring strategy is proposed, which introduces a learned threshold classification function and improves the loss function by adding a new term focused on NOTA identification. Experiments on two widely used benchmarks (FewRel 2.0 and Few-shot TACRED) show that our method is a simple and effective framework, and a new state of the art is established in the few-shot classification field.