RABot: Reinforcement-Guided Graph Augmentation for Imbalanced and Noisy Social Bot Detection

• URL: http://arxiv.org/abs/2602.21749v1
• Date: Wed, 25 Feb 2026 10:02:57 GMT
• Title: RABot: Reinforcement-Guided Graph Augmentation for Imbalanced and Noisy Social Bot Detection
• Authors: Longlong Zhang, Xi Wang, Haotong Du, Yangyi Xu, Zhuo Liu, Yang Liu,
• Abstract summary: Social bot detection is pivotal for safeguarding the integrity of online information ecosystems.<n>Recent graph neural network (GNN) solutions achieve strong results, but they remain hindered by two practical challenges.<n>We propose the Reinforcement-guided graph Augmentation social Bot detector (RABot)<n> RABot employs a neighborhood-aware oversampling strategy that linearly interpolates minority-class embeddings within local subgraphs.
• Score: 16.050137938655364
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Social bot detection is pivotal for safeguarding the integrity of online information ecosystems. Although recent graph neural network (GNN) solutions achieve strong results, they remain hindered by two practical challenges: (i) severe class imbalance arising from the high cost of generating bots, and (ii) topological noise introduced by bots that skillfully mimic human behavior and forge deceptive links. We propose the Reinforcement-guided graph Augmentation social Bot detector (RABot), a multi-granularity graph-augmentation framework that addresses both issues in a unified manner. RABot employs a neighborhood-aware oversampling strategy that linearly interpolates minority-class embeddings within local subgraphs, thereby stabilizing the decision boundary under low-resource regimes. Concurrently, a reinforcement-learning-driven edge-filtering module combines similarity-based edge features with adaptive threshold optimization to excise spurious interactions during message passing, yielding a cleaner topology. Extensive experiments on three real-world benchmarks and four GNN backbones demonstrate that RABot consistently surpasses state-of-the-art baselines. In addition, since its augmentation and filtering modules are orthogonal to the underlying architecture, RABot can be seamlessly integrated into existing GNN pipelines to boost performance with minimal overhead.

Related papers

• Learning to Explore: Policy-Guided Outlier Synthesis for Graph Out-of-Distribution Detection [51.93878677594561]
  In unsupervised graph-level OOD detection, models are typically trained using only in-distribution (ID) data.<n>We propose a Policy-Guided Outlier Synthesis framework that replaces statics with a learned exploration strategy.
  arXiv  Detail & Related papers  (2026-02-28T11:40:18Z)
• Optimal Transport-Guided Adversarial Attacks on Graph Neural Network-Based Bot Detection [15.837407035335653]
  We introduce BOCLOAK to evaluate the robustness of GNN-based social bot detection via both edge editing and node injection adversarial attacks under realistic constraints.<n>BOCLOAK achieves up to 80.13% higher attack success rates while using 99.80% less memory under realistic real-world constraints.<n>Most importantly, BOCLOAK shows that optimal transport provides a principled, principled framework for bridging the gap between adversarial attacks and real-world bot detection.
  arXiv  Detail & Related papers  (2026-01-30T21:13:40Z)
• HW-GNN: Homophily-Aware Gaussian-Window Constrained Graph Spectral Network for Social Network Bot Detection [5.793458146146123]
  Social bots are increasingly polluting online platforms by spreading misinformation and engaging in coordinated manipulation.<n>Graph Neural Networks (GNNs) have become mainstream for social bot detection due to their ability to integrate structural and attribute features.<n>We propose HW-GNN, a novel homophily-aware graph spectral network with Gaussian window constraints.
  arXiv  Detail & Related papers  (2025-11-27T14:29:40Z)
• RoBCtrl: Attacking GNN-Based Social Bot Detectors via Reinforced Manipulation of Bots Control Interaction [51.46634975923564]
  This paper proposes the first adversarial multi-agent Reinforcement learning framework for social Bot control attacks (RoBCtrl)<n> Specifically, we use a diffusion model to generate high-fidelity bot accounts by reconstructing existing account data with minor modifications.<n>We then employ a Multi-Agent Reinforcement Learning (MARL) method to simulate bots adversarial behavior.
  arXiv  Detail & Related papers  (2025-10-16T02:41:49Z)
• Boosting Bot Detection via Heterophily-Aware Representation Learning and Prototype-Guided Cluster Discovery [16.548403922027248]
  BotHP is a generative Graph Self-Supervised Learning framework tailored to boost graph-based bot detectors.<n>It uses a dual-encoder architecture, consisting of a graph-aware encoder to capture node commonality and a graph-agnostic encoder to preserve node uniqueness.<n>It consistently boosts graph-based bot detectors, improving detection performance, alleviating label reliance, and enhancing generalization capability.
  arXiv  Detail & Related papers  (2025-06-01T12:44:53Z)
• Combating Bilateral Edge Noise for Robust Link Prediction [56.43882298843564]
  We propose an information-theory-guided principle, Robust Graph Information Bottleneck (RGIB), to extract reliable supervision signals and avoid representation collapse. Two instantiations, RGIB-SSL and RGIB-REP, are explored to leverage the merits of different methodologies. Experiments on six datasets and three GNNs with diverse noisy scenarios verify the effectiveness of our RGIB instantiations.
  arXiv  Detail & Related papers  (2023-11-02T12:47:49Z)
• Everything Perturbed All at Once: Enabling Differentiable Graph Attacks [61.61327182050706]
  Graph neural networks (GNNs) have been shown to be vulnerable to adversarial attacks. We propose a novel attack method called Differentiable Graph Attack (DGA) to efficiently generate effective attacks. Compared to the state-of-the-art, DGA achieves nearly equivalent attack performance with 6 times less training time and 11 times smaller GPU memory footprint.
  arXiv  Detail & Related papers  (2023-08-29T20:14:42Z)
• Uncertainty-Aware Source-Free Adaptive Image Super-Resolution with Wavelet Augmentation Transformer [60.31021888394358]
  Unsupervised Domain Adaptation (UDA) can effectively address domain gap issues in real-world image Super-Resolution (SR) We propose a SOurce-free Domain Adaptation framework for image SR (SODA-SR) to address this issue, i.e., adapt a source-trained model to a target domain with only unlabeled target data.
  arXiv  Detail & Related papers  (2023-03-31T03:14:44Z)
• Over-Sampling Strategy in Feature Space for Graphs based Class-imbalanced Bot Detection [10.882979272768502]
  A large number of bots in Online Social Networks (OSN) leads to undesirable social effects. We propose an over-sampling strategy for GNNs that generates samples for the minority class without edge synthesis. The framework is evaluated using three real-world bot detection benchmark datasets.
  arXiv  Detail & Related papers  (2023-02-14T08:35:33Z)
• Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization [85.84019017587477]
  Distributionally robust supervised learning is emerging as a key paradigm for building reliable machine learning systems for real-world applications. Existing algorithms for solving Wasserstein DRSL involve solving complex subproblems or fail to make use of gradients. We revisit Wasserstein DRSL through the lens of min-max optimization and derive scalable and efficiently implementable extra-gradient algorithms.
  arXiv  Detail & Related papers  (2021-04-27T16:56:09Z)

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.