PaSta Improves Node Classification with Noisy Labels

Yujing Liu, Yixin Liu, Yu Zheng, Yue Tan, Alan Wee-Chung Liew, Shirui Pan· August 27, 2026 View original

Key takeaways

  • Noisy node labels are a significant challenge in real-world graph applications.
  • PaSta uses partial label learning to create high-quality labels from noisy data.
  • A self-training strategy iteratively refines labels and enhances model robustness.
  • The framework consistently outperforms existing methods in noisy environments.

Who benefits

Social MediaE-commerceCybersecurityWeb ServicesFinTech

Summary

This paper introduces PaSta, a Partial label-based Self-training framework, designed to address noisy node classification in graph-related web services. It leverages partial label learning and a self-training strategy to overcome overfitting on noisy labels and error accumulation, achieving significant performance improvements across various datasets.

Node classification in real-world graph-based systems often suffers from noisy or unreliable labels, leading to models that overfit or accumulate errors during pseudo-labeling. This new research proposes PaSta, a Partial label-based Self-training framework, to tackle these challenges. PaSta begins by training multiple "annotators" to capture diverse class distributions, then aggregates their predictions to create high-quality partial labels for nodes. The framework then uses these partial labels to guide a classification model, employing two specialized loss functions for both label and representation spaces. To further enhance robustness, PaSta incorporates an iterative self-training loop where the refined partial labels continuously optimize the annotators. Experiments on five datasets demonstrate that PaSta consistently improves classification performance, averaging a 1.1% gain over state-of-the-art methods under various noise conditions.

Why it matters

Professionals working with graph data in web services, social networks, or recommendation systems can use PaSta to build more robust and accurate node classification models, even when dealing with inherently noisy or weakly supervised data.

How to implement this in your domain

  1. 1Evaluate PaSta's partial label learning approach for your graph-based node classification tasks with noisy data.
  2. 2Implement multiple annotators to generate comprehensive class distributions for nodes.
  3. 3Design and integrate partial label-based loss functions into your graph neural network models.
  4. 4Apply the self-training strategy to iteratively refine labels and improve model robustness against noise.

Original post by Yujing Liu, Yixin Liu, Yu Zheng, Yue Tan, Alan Wee-Chung Liew, Shirui Pan

"arXiv:2608.25365v1 Announce Type: new Abstract: Noisy node classification problem is a fundamental yet challenging task for real-world graph-related web services, where node labels are often corrupted or unreliable due to weak supervision or automatic annotation. However, existin…"

View on X

Originally posted by Yujing Liu, Yixin Liu, Yu Zheng, Yue Tan, Alan Wee-Chung Liew, Shirui Pan on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses

More in AI Research

AI Engineering & DevToolsAI Research

Resilient Decentralized Federated Learning for Wireless IoT Networks

This paper introduces QEF-GT-AdamW, a communication-efficient and outage-resilient algorithm for decentralized federated learning over wireless IoT networks. It combines gradient tracking, AdamW optimization, and dual-stream biased quantization with error feedback to improve robustness and convergence under heterogeneous data and unreliable communication.

Nguyen Van Thieu, Ti Ti Nguyen, Ons Aouedi, Vu Nguyen Ha, Symeon ChatzinotasAug 27, 2026
AI Engineering & DevToolsAI Research

FedQoS Predicts QoS Risk for Wireless Access Selection

This paper proposes FedQoS, a federated QoS-risk learning framework that predicts future QoS degradation for reliable access selection in heterogeneous indoor-outdoor wireless environments. It enables access nodes to locally learn from network logs and collaboratively train a global predictor without centralizing user data, significantly reducing QoS failure rates.

Nguyen Van Thieu, Ti Ti Nguyen, Ons Aouedi, Zerihun Huruy, Vu Nguyen Ha, Symeon ChatzinotasAug 27, 2026
AI ResearchAI Engineering & DevTools

Parametric Knowledge Graphs Show Storage-Retrieval Gap

This paper explores compiling knowledge graphs into LoRA adapters for parametric memory, finding that while adapters effectively store factual knowledge, retrieving it via semantic similarity or weight-space geometry is ineffective. This highlights a "storage-retrieval gap" and the need for new query-conditioned composition mechanisms.

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov, Volker TrespAug 27, 2026