HAT4RD: Hierarchical Adversarial Training for Rumor Detection on Social Media

• URL: http://arxiv.org/abs/2110.00425v2
• Date: Mon, 29 Aug 2022 14:45:20 GMT
• Title: HAT4RD: Hierarchical Adversarial Training for Rumor Detection on Social Media
• Authors: Shiwen Ni, Jiawen Li and Hung-Yu Kao
• Abstract summary: Natural language is high-dimensional and sparse, and the same rumor may be expressed in hundreds of ways on social media. We propose a novel textbfhierarchical textbfadversarial textbftraining method for textbfrumor textbfdetection (HAT4RD) on social media.
• Score: 16.522234471615214
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the development of social media, social communication has changed. While this facilitates people's communication and access to information, it also provides an ideal platform for spreading rumors. In normal or critical situations, rumors will affect people's judgment and even endanger social security. However, natural language is high-dimensional and sparse, and the same rumor may be expressed in hundreds of ways on social media. As such, the robustness and generalization of the current rumor detection model are put into question. We proposed a novel \textbf{h}ierarchical \textbf{a}dversarial \textbf{t}raining method for \textbf{r}umor \textbf{d}etection (HAT4RD) on social media. Specifically, HAT4RD is based on gradient ascent by adding adversarial perturbations to the embedding layers of post-level and event-level modules to deceive the detector. At the same time, the detector uses stochastic gradient descent to minimize the adversarial risk to learn a more robust model. In this way, the post-level and event-level sample spaces are enhanced, and we have verified the robustness of our model under a variety of adversarial attacks. Moreover, visual experiments indicate that the proposed model drifts into an area with a flat loss landscape, leading to better generalization. We evaluate our proposed method on three public rumors datasets from two commonly used social platforms (Twitter and Weibo). Experiment results demonstrate that our model achieves better results than state-of-the-art methods.

Related papers

• Rumor Detection with a novel graph neural network approach [12.42658463552019]
  We propose a new detection model, that jointly learns the representations of user correlation and information propagation to detect rumors on social media. Specifically, we leverage graph neural networks to learn the representations of user correlation from a bipartite graph. We show that it requires a high cost for attackers to subvert user correlation pattern, demonstrating the importance of considering user correlation for rumor detection.
  arXiv  Detail & Related papers  (2024-03-24T15:59:47Z)
• Segue: Side-information Guided Generative Unlearnable Examples for Facial Privacy Protection in Real World [64.4289385463226]
  We propose Segue: Side-information guided generative unlearnable examples. To improve transferability, we introduce side information such as true labels and pseudo labels. It can resist JPEG compression, adversarial training, and some standard data augmentations.
  arXiv  Detail & Related papers  (2023-10-24T06:22:37Z)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• Prompt-and-Align: Prompt-Based Social Alignment for Few-Shot Fake News Detection [50.07850264495737]
  "Prompt-and-Align" (P&A) is a novel prompt-based paradigm for few-shot fake news detection. We show that P&A sets new states-of-the-art for few-shot fake news detection performance by significant margins.
  arXiv  Detail & Related papers  (2023-09-28T13:19:43Z)
• A Unified Contrastive Transfer Framework with Propagation Structure for Boosting Low-Resource Rumor Detection [11.201348902221257]
  existing rumor detection algorithms show promising performance on yesterday's news. Due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events. We propose a unified contrastive transfer framework to detect rumors by adapting the features learned from well-resourced rumor data to that of the low-resourced with only few-shot annotations.
  arXiv  Detail & Related papers  (2023-04-04T03:13:03Z)
• Enhancing Multiple Reliability Measures via Nuisance-extended Information Bottleneck [77.37409441129995]
  In practical scenarios where training data is limited, many predictive signals in the data can be rather from some biases in data acquisition. We consider an adversarial threat model under a mutual information constraint to cover a wider class of perturbations in training. We propose an autoencoder-based training to implement the objective, as well as practical encoder designs to facilitate the proposed hybrid discriminative-generative training.
  arXiv  Detail & Related papers  (2023-03-24T16:03:21Z)
• Verifying the Robustness of Automatic Credibility Assessment [50.55687778699995]
  We show that meaning-preserving changes in input text can mislead the models. We also introduce BODEGA: a benchmark for testing both victim models and attack methods on misinformation detection tasks. Our experimental results show that modern large language models are often more vulnerable to attacks than previous, smaller solutions.
  arXiv  Detail & Related papers  (2023-03-14T16:11:47Z)
• Zero-Shot Rumor Detection with Propagation Structure via Prompt Learning [24.72097408129496]
  Previous studies reveal that due to the lack of annotated resources, rumors presented in minority languages are hard to be detected. We propose a novel framework based on prompt learning to detect rumors falling in different domains or presented in different languages. Our proposed model achieves much better performance than state-of-the-art methods and exhibits a superior capacity for detecting rumors at early stages.
  arXiv  Detail & Related papers  (2022-12-02T12:04:48Z)
• Rumor Detection with Self-supervised Learning on Texts and Social Graph [101.94546286960642]
  We propose contrastive self-supervised learning on heterogeneous information sources, so as to reveal their relations and characterize rumors better. We term this framework as Self-supervised Rumor Detection (SRD) Extensive experiments on three real-world datasets validate the effectiveness of SRD for automatic rumor detection on social media.
  arXiv  Detail & Related papers  (2022-04-19T12:10:03Z)
• SRLF: A Stance-aware Reinforcement Learning Framework for Content-based Rumor Detection on Social Media [15.985224010346593]
  Early content-based methods focused on finding clues from text and user profiles for rumor detection. Recent studies combine the stances of users' comments with news content to capture the difference between true and false rumors. We propose a novel Stance-aware Reinforcement Learning Framework (SRLF) to select high-quality labeled stance data for model training and rumor detection.
  arXiv  Detail & Related papers  (2021-05-10T03:58:34Z)
• RP-DNN: A Tweet level propagation context based deep neural networks for early rumor detection in Social Media [3.253418861583211]
  Early rumor detection (ERD) on social media platform is very challenging when limited, incomplete and noisy information is available. We present a novel hybrid neural network architecture, which combines a character-based bidirectional language model and stacked Long Short-Term Memory (LSTM) networks. Our models achieve state-of-the-art(SoA) performance for detecting unseen rumors on large augmented data which covers more than 12 events and 2,967 rumors.
  arXiv  Detail & Related papers  (2020-02-28T12:44:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.