| Challenge: | Automatic resolution of rumours is a challenging task that can be broken down into smaller components that make up a pipeline . previous work focused on rumor detection, rumou tracking and stance classification as separate components . |
| Approach: | They propose a multi-task learning approach that allows joint training of main and auxiliary tasks, improving the performance of rumour verification. |
| Outcome: | The proposed approach improves the performance of rumour verification by combining main and auxiliary tasks into one pipeline. |
Similar Papers
Rumor Detection by Exploiting User Credibility Information, Attention and Multi-task Learning (P19-1)
Copied to clipboard
| Challenge: | Social media platforms do not always pose authentic information, and rumors spread fear or hate. |
| Approach: | They propose a new multi-task learning approach for rumor detection and stance classification tasks. |
| Outcome: | The proposed model outperforms the state-of-the-art rumor detection approaches on two datasets. |
Neural Multi-Task Learning for Stance Prediction (D19-66)
Copied to clipboard
| Challenge: | Existing models for fact checking are limited in size due to limited data available . stance detection is a key component of fact checking for journalists and news agencies . |
| Approach: | They propose to use textual information from existing datasets to improve stance prediction. |
| Outcome: | The proposed model outperforms state-of-the-art systems on a public benchmark dataset by 6.0 and 14.4 points in weighting. |
A Multi-Task Learning Framework for Multi-Target Stance Detection (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing models fail to learn target-specific representations and are prone to overfitting. |
| Approach: | They propose a multi-task learning network to train one model on all target pairs . their results show that their proposed model outperforms the best-performing baseline by 12.39% . |
| Outcome: | The proposed model outperforms the best-performing baseline model by 12.39% in macro-averaged F1-score. |
Multi-Task Retrieval for Knowledge-Intensive Tasks (2021.acl-long)
Copied to clipboard
Jean Maillard, Vladimir Karpukhin, Fabio Petroni, Wen-tau Yih, Barlas Oguz, Veselin Stoyanov, Gargi Ghosh
| Challenge: | Knowledge-intensive tasks require large amounts of knowledge about the world . recent neural retrieval models achieve better results by learning directly from task-specific training data. |
| Approach: | They propose a multi-task trained neural retrieval model that can be universally trained on a wide variety of problems. |
| Outcome: | The proposed model outperforms specialised retrievers on a few-shot setting and matches or improves state-of-the-art on multiple benchmarks. |
All-in-One: A Deep Attentive Multi-task Learning Framework for Humour, Sarcasm, Offensive, Motivation, and Sentiment on Memes (2020.aacl-main)
Copied to clipboard
| Challenge: | Empirical results show the efficacy of our proposed multi-task framework over existing state-of-the-art systems. |
| Approach: | They propose a multi-task, multi-modal deep learning framework to solve multiple tasks simultaneously. |
| Outcome: | The proposed framework performs better than existing state-of-the-art systems on a complicated form of information, i.e., memes. |
Re-framing Incremental Deep Language Models for Dialogue Processing with Multi-task Learning (2020.coling-main)
Copied to clipboard
| Challenge: | Using a multi-task learning framework, we train a universal incremental dialogue processing model with four tasks of disfluency detection, language modelling, part-of-speech tagging and utterance segmentation in a simple deep recurrent setting. |
| Approach: | They propose a multi-task learning framework to train a universal incremental dialogue processing model with four tasks of disfluency detection, language modelling, part-of-speech tagging and utterance segmentation in a simple deep recurrent setting. |
| Outcome: | The proposed model outperforms individual tasks and delivers competitive performance. |
A Survey of Multi-task Learning in Natural Language Processing: Regarding Task Relatedness and Training Methods (2023.eacl-main)
Copied to clipboard
| Challenge: | Multi-task learning is a popular approach in natural language processing because of its commonalities and differences. |
| Approach: | They propose to summarize recent advances in multi-task learning methods based on their task relatedness into two general multi-step training methods. |
| Outcome: | The proposed methods summarize the tasks and discuss future directions. |
Killing Four Birds with Two Stones: Multi-Task Learning for Non-Literal Language Detection (C18-1)
Copied to clipboard
| Challenge: | idioms and metaphors are often studied in isolation, challenging the distinction . e.g., metaphorical concept mappings are ubiquitous in everyday life, thus they are ubiquitous . |
| Approach: | They propose to view the detection problem as a generalized non-literal language classification problem. |
| Outcome: | The proposed model improves on four metaphor and idiom detection tasks in two languages, English and German. |
Reinforcement Tuning for Detecting Stances and Debunking Rumors Jointly with Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Social media has become a fertile ground for nurturing rumors and misinformation due to its lack of systematic moderation. |
| Approach: | They propose a framework to enhance the joint predictive capabilities of LLMs for stance detection and rumor verification tasks. |
| Outcome: | The proposed framework outperforms state-of-the-art methods and generalizes to non-LLMs accommodated as task models. |
Different Absorption from the Same Sharing: Sifted Multi-task Learning for Fake News Detection (D19-1)
Copied to clipboard
| Challenge: | Existing methods for detecting fake news use shared features as complementarity features without selection. |
| Approach: | They propose a sifted multi-task learning method with a selected sharing layer for fake news detection. |
| Outcome: | The proposed method boosts the F1-score by more than 0.87%, 1.31% on two public and widely used competition datasets. |