Sequence labeling via reinforcement learning with aggregate labels

被引:0
作者
Geromel, Marcel [1 ]
Cimiano, Philipp [1 ]
机构
[1] Bielefeld Univ, Ctr Cognit Interact Technol, Bielefeld, Germany
来源
FRONTIERS IN ARTIFICIAL INTELLIGENCE | 2024年 / 7卷
关键词
reinforcement learning; reward functions; annotations; sequence labeling; information extraction;
D O I
10.3389/frai.2024.1463164
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sequence labeling is pervasive in natural language processing, encompassing tasks such as Named Entity Recognition, Question Answering, and Information Extraction. Traditionally, these tasks are addressed via supervised machine learning approaches. However, despite their success, these approaches are constrained by two key limitations: a common mismatch between the training and evaluation objective, and the resource-intensive acquisition of ground-truth token-level annotations. In this work, we introduce a novel reinforcement learning approach to sequence labeling that leverages aggregate annotations by counting entity mentions to generate feedback for training, thereby addressing the aforementioned limitations. We conduct experiments using various combinations of aggregate feedback and reward functions for comparison, focusing on Named Entity Recognition to validate our approach. The results suggest that sequence labeling can be learned from purely count-based labels, even at the sequence-level. Overall, this count-based method has the potential to significantly reduce annotation costs and variances, as counting entity mentions is more straightforward than determining exact boundaries.
引用
收藏
页数:13
相关论文
共 54 条
[1]  
Akalin N, 2021, SENSORS-BASEL, V21, DOI 10.3390/s21041292
[2]  
Amin S., 2021, arXiv
[3]  
[Anonymous], 2018, P 27 INT C COMP LING
[4]  
Hamrick JB, 2021, Arxiv, DOI [arXiv:2011.04021, 10.48550/arXiv.2011.04021]
[5]  
Berner Christopher, 2019, arXiv
[6]  
Buck C, 2018, Arxiv, DOI arXiv:1705.07830
[7]  
Chen J, 2020, PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), P1241
[8]   Coarse-to-Fine Question Answering for Long Documents [J].
Choi, Eunsol ;
Hewlett, Daniel ;
Uszkoreit, Jakob ;
Polosukhin, Illia ;
Lacoste, Alexandre ;
Berant, Jonathan .
PROCEEDINGS OF THE 55TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2017), VOL 1, 2017, :209-220
[9]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[10]  
EICK SG, 1988, ANN STAT, V16, P254, DOI 10.1214/aos/1176350703