| Challenge: | Existing methods for rumor tracking depend on a significant amount of labeled data. |
| Approach: | They propose an Active-Transfer Learning strategy to identify rumors with limited amount of annotated data. |
| Outcome: | The proposed approach achieves faster convergence in terms of the F-score while requiring fewer annotated samples (42% of the whole dataset for the best model). |
Similar Papers
Rumor Detection on Social Media: Datasets, Methods and Opportunities (D19-50)
Copied to clipboard
| Challenge: | Social media platforms are used for information gathering, but they also lead to the spreading of rumors and fake news. |
| Approach: | This paper presents a comprehensive list of datasets used for rumor detection . it also reviews the important studies based on what types of information they exploit . |
| Outcome: | This paper presents an overview of the recent studies in the rumor detection field . it provides a comprehensive list of datasets used for rumour detection . |
Reducing Confusion in Active Learning for Part-Of-Speech Tagging (2021.tacl-1)
Copied to clipboard
| Challenge: | Existing algorithms for annotating parts of speech are not optimal for all languages. |
| Approach: | They propose to use a data selection algorithm to select useful training samples to minimize annotation cost. |
| Outcome: | The proposed strategy outperforms existing strategies on six typologically diverse languages. |
Optimizing Annotation Effort Using Active Learning Strategies: A Sentiment Analysis Case Study in Persian (2020.lrec-1)
Copied to clipboard
Seyed Arad Ashrafi Asli, Behnam Sabeti, Zahra Majdabadi, Preni Golazizian, Reza Fahmi, Omid Momenzadeh
| Challenge: | Existing deep learning approaches require huge amounts of data to be trained properly. |
| Approach: | They propose to use Persian as a model to choose the samples for annotation instead of labeling the whole dataset. |
| Outcome: | The proposed models achieve the baseline performance with a significantly lower amount of labeled data. |
Rumor Detection on Twitter Using Multiloss Hierarchical BiLSTM with an Attenuation Factor (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing models to classify rumors have low precision and are time consuming. |
| Approach: | They propose a multiloss hierarchical biLSTM model with an attenuation factor that can extract deep information from limited quantities of text. |
| Outcome: | The proposed model can extract deep information from limited quantities of text. |
Beyond Detection: A Defend-and-Summarize Strategy for Robust and Interpretable Rumor Analysis on Social Media (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing detection models for rumors detection are poor interpretability and lack the textual content to detect rumors. |
| Approach: | They propose a framework that analyzes the textual content and propagation paths of rumors on social media and provides multi-perspective prediction explanations. |
| Outcome: | The proposed framework defends against malicious attacks and provides prediction explanations on three public datasets. |
Active Learning for Sequence Tagging with Deep Pre-trained Models and Bayesian Uncertainty Estimates (2021.eacl-main)
Copied to clipboard
Artem Shelmanov, Dmitri Puzyrev, Lyubov Kupriyanova, Denis Belyakov, Daniil Larionov, Nikita Khromov, Olga Kozlova, Ekaterina Artemova, Dmitry V. Dylov, Alexander Panchenko
| Challenge: | Annotating training data for sequence tagging of texts is usually very time-consuming . active learning can help to reduce the amount of annotation required to train a good model by multiple times . |
| Approach: | They are the first to thoroughly investigate active learning and transfer learning for natural language processing . they propose to combine active learning with active learning to improve model acquisition . |
| Outcome: | The proposed combination of active learning and Bayesian uncertainty estimation improves performance and reduces obstacles for applying it in practice. |
Investigating Multi-source Active Learning for Natural Language Inference (2023.eacl-main)
Copied to clipboard
| Challenge: | Recent studies often assume that training and test data are drawn from the same distribution. |
| Approach: | They propose to apply active learning to unlabelled data pools to test for learning and generalisation. |
| Outcome: | The proposed strategies outperform random selection and outperformed hard-to-learn data on the task of natural language inference. |
On the Limitations of Simulating Active Learning (2023.findings-acl)
Copied to clipboard
| Challenge: | Active learning (AL) is a human-and-model-in-the-loop paradigm that iteratively selects informative unlabeled data for human annotation. |
| Approach: | They propose to simulate active learning by using an already labeled dataset as the pool of unlabeled data. |
| Outcome: | The proposed model-in-the-loop paradigm can be used to perform experiments with human annotations on-the fly. |
Deep Bayesian Active Learning for Natural Language Processing: Results of a Large-Scale Empirical Study (D18-1)
Copied to clipboard
| Challenge: | Existing studies on Active Learning (AL) for natural language processing have limited data requirements. |
| Approach: | They propose a Bayesian active learning approach that reduces deep learning's data dependence by comparing models and acquisition functions. |
| Outcome: | The proposed approach outperforms i.i.d. baselines and is more efficient than other approaches. |
Active2 Learning: Actively reducing redundancies in Active Learning methods for Sequence Tagging and Machine Translation (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to deep learning for NLP require large amounts of labeled data. |
| Approach: | They propose an approach that iteratively selects a small number of examples for expert annotation based on their estimated utility in training the model. |
| Outcome: | The proposed approach reduces the data requirements of state-of-the-art AL strategies by 3-25% on multiple NLP tasks while achieving the same performance with virtually no additional computation overhead. |