Signals 4 · free daily AI digest

Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise

Paper recorded by Signals 4 on 2026-09-18 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-18 on arXiv · recorded by Signals 4 on 2026-09-21

Category: cs.LG · 机器学习 · first seen 2026-09-21

Abstract

Graph Convolutional Networks (GCNs) are highly sensitive to label noise, since corrupted supervision can propagate through the graph and degrade learned node representations. This work proposes PCC+GCN, a hybrid framework that uses Particle Competition and Cooperation (PCC) as a graph-based label-refinement stage before GCN training. PCC identifies suspicious labeled nodes through particle dominat

Read on arXiv →

#4 most recent of 235 cs.LG papers we have recorded · ↑ newer: Benchmarking World Models for Continual Learning on Compositional Task · ↓ older: Available Guardrails: Certifying Selective Prediction across ML System
Cite this page: Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise: the #4 most recent of 235 cs.LG papers we have recorded (as of 2026-09-18). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/particle-competition-and-cooperation-for-robust-graph-convolutional-network-lear.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions