VerifyMatch: A Semi-Supervised Learning Paradigm for Natural Language Inference with Confidence-Aware MixUp
- Authors
- 박서연
- Issue Date
- Nov-2024
- Publisher
- Association for Computational Linguistics
- Citation
- Empirical Methods in Natural Language Processing, pp 19319 - 19335
- Pages
- 17
- Indexed
- SCOPUS
- Journal Title
- Empirical Methods in Natural Language Processing
- Start Page
- 19319
- End Page
- 19335
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/125531
- DOI
- 10.18653/v1/2024.emnlp-main.1076
- Abstract
- While natural language inference (NLI) has emerged as a prominent task for evaluating a model's capability to perform natural language understanding, creating large benchmarks for training deep learning models imposes a significant challenge since it requires extensive human annotations.To overcome this, we propose to construct pseudo-generated samples (premise-hypothesis pairs) using class-specific fine-tuned large language models (LLMs) thereby reducing the human effort and the costs in annotating large amounts of data.However, despite the impressive performance of LLMs, it is necessary to verify that the pseudo-generated labels are actually correct.Towards this goal, in this paper, we propose VerifyMatch, a semi-supervised learning (SSL) approach in which the LLM pseudo-labels guide the training of the SSL model and, at the same time, the SSL model acts as a verifier of the LLM-generated data.In our approach, we retain all pseudo-labeled samples, but to ensure unlabeled data quality, we further propose to use MixUp whenever the verifier does not agree with the LLM-generated label or when they both agree on the label but the verifier has a low confidence-lower than an adaptive confidence threshold.We achieve competitive accuracy compared to strong baselines for NLI datasets in low-resource settings. © 2024 Association for Computational Linguistics.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - COLLEGE OF COMPUTING > ERICA 컴퓨터학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.