Ehsan Abbasnejad, Hai-Ming Xu, Lingqiao Liu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Semi-supervised learning is a promising way to reduce the annotation cost for textclassification. Combining with pre-trained language models (PLMs), e.g., BERT, recent semi-supervised learning methods achieved impressive performance. In this work, we further investigate the marriage between semisupervised learning and a pre-trained language model. Unlike existing approaches that utilize PLMs only for model parameter initialization, we explore the inherent topic matching capability inside PLMs for building a more powerful semi-supervised learning approach. Specifically, we propose a joint semi-supervised learning process that can progressively build a standard K-way classifier and a matching network for the input text and the Class Semantic Representation (CSR). The CSR will be initialized from the given labeled sentences and progressively updated through the training process. By means of extensive experiments, we show that our method can not only bring remarkable improvement to baselines, but also overall be more stable, and achieves state-ofthe-art performance in semi-supervised text classification. Code is available at: https: //github.com/HeimingX/PCM.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.10189")
get_code_for_paper("2205.10189")
have("2205.10189")
Connect an agent — have() is free.