Rishi Hazra, Parag Dutta, Shubham Gupta, Mohammed Abdul Qaathir, Ambedkar Dukkipati
{"title":"Active2学习:主动减少序列标注和机器翻译学习的主动学习方法中的冗余:主动减少序列标注和机器翻译的主动学习方法中的冗余","authors":"Rishi Hazra, Parag Dutta, Shubham Gupta, Mohammed Abdul Qaathir, Ambedkar Dukkipati","doi":"10.18653/V1/2021.NAACL-MAIN.159","DOIUrl":null,"url":null,"abstract":"While deep learning is a powerful tool for natural language processing (NLP) problems, successful solutions to these problems rely heavily on large amounts of annotated samples. However, manually annotating data is expensive and time-consuming. Active Learning (AL) strategies reduce the need for huge volumes of labeled data by iteratively selecting a small number of examples for manual annotation based on their estimated utility in training the given model. In this paper, we argue that since AL strategies choose examples independently, they may potentially select similar examples, all of which may not contribute significantly to the learning process. Our proposed approach, Active\\mathbf{^2} Learning (A\\mathbf{^2}L), actively adapts to the deep learning model being trained to eliminate such redundant examples chosen by an AL strategy. We show that A\\mathbf{^2}L is widely applicable by using it in conjunction with several different AL strategies and NLP tasks. We empirically demonstrate that the proposed approach is further able to reduce the data requirements of state-of-the-art AL strategies by ≈ \\mathbf{3-25\\%} on an absolute scale on multiple NLP tasks while achieving the same performance with virtually no additional computation overhead.","PeriodicalId":251110,"journal":{"name":"Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","volume":"04 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Active2 Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation\",\"authors\":\"Rishi Hazra, Parag Dutta, Shubham Gupta, Mohammed Abdul Qaathir, Ambedkar Dukkipati\",\"doi\":\"10.18653/V1/2021.NAACL-MAIN.159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While deep learning is a powerful tool for natural language processing (NLP) problems, successful solutions to these problems rely heavily on large amounts of annotated samples. However, manually annotating data is expensive and time-consuming. Active Learning (AL) strategies reduce the need for huge volumes of labeled data by iteratively selecting a small number of examples for manual annotation based on their estimated utility in training the given model. In this paper, we argue that since AL strategies choose examples independently, they may potentially select similar examples, all of which may not contribute significantly to the learning process. Our proposed approach, Active\\\\mathbf{^2} Learning (A\\\\mathbf{^2}L), actively adapts to the deep learning model being trained to eliminate such redundant examples chosen by an AL strategy. We show that A\\\\mathbf{^2}L is widely applicable by using it in conjunction with several different AL strategies and NLP tasks. We empirically demonstrate that the proposed approach is further able to reduce the data requirements of state-of-the-art AL strategies by ≈ \\\\mathbf{3-25\\\\%} on an absolute scale on multiple NLP tasks while achieving the same performance with virtually no additional computation overhead.\",\"PeriodicalId\":251110,\"journal\":{\"name\":\"Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies\",\"volume\":\"04 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18653/V1/2021.NAACL-MAIN.159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/V1/2021.NAACL-MAIN.159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Active2 Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation
While deep learning is a powerful tool for natural language processing (NLP) problems, successful solutions to these problems rely heavily on large amounts of annotated samples. However, manually annotating data is expensive and time-consuming. Active Learning (AL) strategies reduce the need for huge volumes of labeled data by iteratively selecting a small number of examples for manual annotation based on their estimated utility in training the given model. In this paper, we argue that since AL strategies choose examples independently, they may potentially select similar examples, all of which may not contribute significantly to the learning process. Our proposed approach, Active\mathbf{^2} Learning (A\mathbf{^2}L), actively adapts to the deep learning model being trained to eliminate such redundant examples chosen by an AL strategy. We show that A\mathbf{^2}L is widely applicable by using it in conjunction with several different AL strategies and NLP tasks. We empirically demonstrate that the proposed approach is further able to reduce the data requirements of state-of-the-art AL strategies by ≈ \mathbf{3-25\%} on an absolute scale on multiple NLP tasks while achieving the same performance with virtually no additional computation overhead.