mlsanityData to 7 Oct 2026

Toward Robust Signed Graph Learning through Joint Input-Target Denoising

arXiv 2510.22513 ↗First posted 26 Oct 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Signed Graph Neural Networks (SGNNs) are widely adopted to analyze complex patterns in signed graphs with both positive and negative links. Given the noisy nature of real-world connections, the robustness of SGNN has also emerged as a pivotal research area. Under the supervision of empirical properties, graph structure learning has shown its robustness on signed graph representation learning, however, there remains a paucity of research investigating a robust SGNN with theoretical guidance. Inspired by the success of graph information bottleneck (GIB) in information extraction, we propose RIDGE, a novel framework for Robust sI gned graph learning through joint Denoising of Graph inputs and supervision targEts. Different from the basic GIB, we extend the GIB theory with the capability of target space denoising as the co-existence of noise in both input and target spaces. In instantiation, RIDGE effectively cleanses input data and supervision targets via a tractable objective function produced by reparameterization mechanism and variational approximation. We extensively validate our method on four prevalent signed graph datasets, and the results show that RIDGE clearly improves the robustness of popular SGNN models under various levels of noise.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 54 references that are in the map. First posted on arXiv 26 Oct 2025.

Builds on

25 of 54 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Graph Attention Networkscited by 8,854
  3. 2013Auto-Encoding Variational Bayescited by 3,980
  4. 2016Deep Variational Information Bottleneckcited by 915
  5. 2020Graph Structure Learning for Robust Graph Neural Networkscited by 368
  6. 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
  7. 2019Learning Discrete Structures for Graph Neural Networkscited by 228
  8. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  9. 2020Graph Information Bottleneckcited by 168
  10. 2020Graph Information Bottleneck for Subgraph Recognitioncited by 119
  11. 2019Signed Graph Attention Networkscited by 62
  12. 2021SDGNN: Learning Node Representation for Signed Directed Networkscited by 44
13 more
  1. 2022MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplaciancited by 28
  2. 2019SPONGE: A generalized eigenproblem for clustering signed networkscited by 24
  3. 2017Distributed Representations of Signed Networkscited by 17
  4. 2024HILL: Hierarchy-aware Information Lossless Contrastive Learning for Hierarchical Text Classificationcited by 13
  5. 2017Clustering Signed Networks with the Geometric Mean of Laplacianscited by 11
  6. 2025Robust Deep Signed Graph Clustering via Weak Balance Theorycited by 5
  7. 2015Measuring Partial Balance in Signed Networkscited by 4
  8. 2024NC-NCD: Novel Class Discovery for Node Classificationcited by 4
  9. 2023Black-Box Attacks against Signed Graph Analysis via Balance Poisoningcited by 3
  10. 2024Rumor Detection on Social Media with Temporal Propagation Structure Optimizationcited by 3
  11. 2025Molecular Graph Contrastive Learning with Line Graphcited by 3
  12. 2025Structural Entropy Guided Unsupervised Graph Out-Of-Distribution Detectioncited by 3
  13. 2024Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balancecited by 1

Built on by

Not cited yet.