| Challenge: | Unsupervised representation learning algorithms such as word2vec and ELMo only learn from task-specific labeled data during the main training phase. |
| Approach: | They propose a semi-supervised learning algorithm that improves the representations of a Bi-LSTM sentence encoder using a mix of labeled and unlabeled data. |
| Outcome: | The proposed algorithm improves the representations of a Bi-LSTM sentence encoder using a mix of labeled and unlabeled data. |
Similar Papers
Semi-Supervised Semantic Role Labeling with Cross-View Training (D19-1)
Copied to clipboard
| Challenge: | Recent approaches rely on expensive annotations and are unavailable in low resource scenarios (e.g., rare languages or domains). |
| Approach: | They propose an end-to-end SRL model which leverages unlabeled data and propose to reduce the annotation effort involved via semi-supervised learning. |
| Outcome: | The proposed model outperforms the state-of-the-art in English and consistently improves performance in other languages, including Chinese, German, and Spanish. |
Combining Deep Generative Models and Multi-lingual Pretraining for Semi-supervised Document Classification (2021.eacl-main)
Copied to clipboard
| Challenge: | Semi-supervised learning and multilingual pretraining have been shown to be effective for task-specific labelled data shortages. |
| Approach: | They propose to combine semi-supervised deep generative models and multi-lingual pretraining to form a pipeline for document classification task. |
| Outcome: | The proposed method outperforms state-of-the-art models in low-resource settings across several languages and outperformed existing models in English. |
Improving Code-Switching Dependency Parsing with Semi-Supervised Auxiliary Tasks (2022.findings-naacl)
Copied to clipboard
| Challenge: | Code-switching dependency parsing is a challenging task due to the scarcity of necessary resources and structural difficulties embedded in code-switch languages. |
| Approach: | They propose to use sequence labeling models as auxiliary tasks for code-switched dependency parsing in a semi-supervised scheme and acquire state-of-the-art scores on all studied languages. |
| Outcome: | The proposed model outperforms the previous model by 7.4 LAS points on average on all of the studied languages. |
Learning Word Representations with Cross-Sentence Dependency for End-to-End Co-reference Resolution (D18-1)
Copied to clipboard
| Challenge: | Existing word embedding models generate word representations by running long short-term memory recurrent neural networks on each sentence of an input article or conversation separately. |
| Approach: | They propose a word embedding model that learns cross-sentence dependency . they use linear sentence linking and attentional sentence linking to learn cross-entry dependency based on context sentences . |
| Outcome: | The proposed model improves end-to-end co-reference resolution by taking knowledge from context sentences and the entire document. |
A Cross-Sentence Latent Variable Model for Semi-Supervised Text Sequence Matching (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to text matching consider each sequence separately . a proposed model uses both sequences to generate a given relationship with a source sequence . |
| Approach: | They propose a latent variable model for predicting the relationship between a pair of text sequences by generating a sequence that has a given relationship with a source sequence. |
| Outcome: | The proposed model achieves state-of-the-art on natural language inference and paraphrase identification. |
Semi-Supervised Learning for Video Captioning (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing video captioning algorithms are heavily dependent on supervised training data. |
| Approach: | They propose to train the video captioning model on labeled and unlabeled data jointly in a semi-supervised learning manner. |
| Outcome: | The proposed model outperforms state-of-the-art semi-supervised learning approaches on VATEX, MSR-VTT and MSVD datasets. |
To BERT or Not to BERT: Comparing Task-specific and Task-agnostic Semi-Supervised Approaches for Sequence Tagging (2020.emnlp-main)
Copied to clipboard
Kasturi Bhattacharjee, Miguel Ballesteros, Rishita Anubhai, Smaranda Muresan, Jie Ma, Faisal Ladhak, Yaser Al-Onaizan
| Challenge: | Using large amounts of unlabeled data to improve performance has become the foundation for many natural language processing tasks. |
| Approach: | They propose a task-specific semi-supervised approach that uses unlabeled data in a more task-agnostic manner. |
| Outcome: | The proposed approach achieves similar performance to BERT on a set of sequence tagging tasks with less financial and environmental impact. |
Cross-Thought for Sentence Encoder Pre-training (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models to pretrain sentence encoders with large unlabeled corpus are lacking in linguistic information retrieval. |
| Approach: | They propose a novel approach to pre-training sequence encoder using transformers . they propose to train a Transformer-based sequence encoded over a large set of short sequences based on a set of masked words . |
| Outcome: | The proposed approach outperforms state-of-the-art encoders on hotpotQA by improving intermediate information retrieval performance. |
Generate, Discriminate and Contrast: A Semi-Supervised Sentence Representation Learning Framework (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing supervised sentence embedding techniques rely on expensive human-annotated sentence pairs as the supervised signals. |
| Approach: | They propose a semi-supervised sentence embedding framework that leverages large-scale unlabeled data. |
| Outcome: | The proposed framework surpasses state-of-the-art methods on four domain adaptation tasks. |
Sequence Labeling Parsing by Learning across Representations (P19-1)
Copied to clipboard
| Challenge: | Constituency and dependency parsing are the main abstractions for representing syntactic structure of sentences . constituency parsers are considered disjointed tasks, and their improvements have been obtained separately. |
| Approach: | They propose to add auxiliary loss to constituency parsing paradigms and explore a model that parses both paradigms at no cost. |
| Outcome: | The proposed model outperforms single-task models by 1.05 F1 points and 0.62 UAS points for constituency parsing and dependency parsers. |