REVIEW 14 cited by
Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Graph neural network (GNN) and label propagation algorithm (LPA) are both message passing algorithms, which have achieved superior performance in semi-supervised classification. GNN performs feature propagation by a neural network to make predictions, while LPA uses label propagation across graph adjacency matrix to get results. However, there is still no effective way to directly combine these two kinds of algorithms. To address this issue, we propose a novel Unified Message Passaging Model (UniMP) that can incorporate feature and label propagation at both training and inference time. First, UniMP adopts a Graph Transformer network, taking feature embedding and label embedding as input information for propagation. Second, to train the network without overfitting in self-loop input label information, UniMP introduces a masked label prediction strategy, in which some percentage of input label information are masked at random, and then predicted. UniMP conceptually unifies feature propagation and label propagation and is empirically powerful. It obtains new state-of-the-art semi-supervised classification results in Open Graph Benchmark (OGB).
Forward citations
Cited by 14 Pith papers
-
LAEF: A Lead-Agnostic ECG Foundation Model Towards Point-of-Care Diagnostics
A 7M-parameter graph ECG foundation model pre-trained with random lead dropout matches 12-lead models on full input and beats zero-padded baselines on most datasets with 1-2 leads.
-
Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes
GNNAS-TSP, a GNN-based TSP algorithm selector, improves normalized solution cost over the single best solver at 10s and 60s budgets, with the 10s gain post-hoc significant.
-
Parameter-Free Encoders Remain Viable for RDB Foundation Models
Trainable RDB encoders cannot robustly exploit neighborhood labels as fixed foundation-model features or feature-importance signals, so simple parameter-free encoders stay near-SOTA.
-
KoRe: Compact Knowledge Representations for Large Language Models
KoRe encodes 1-hop knowledge graph subgraphs as compact discrete tokens for injection into LLMs, achieving competitive benchmark performance with up to 10x token reduction.
-
Attention Enhanced Entity Recommendation for Intelligent Monitoring in Cloud Systems
A heterogeneous-graph recommender with multi-head attention, random-walk attention, and an alignment loss recommends cloud-monitor dimensions, beating baseline GNNs on Microsoft's production data and on DBLP/LastFM.
-
Goal-based Trajectory Prediction for improved Cross-Dataset Generalization
A graph neural network with staged lane-then-point goal selection cuts the cross-dataset error drop (e.g., b-minFDE6 relative drop 8% vs 20-30%) when moving from Argoverse2 to NuScenes.
-
Dynamic Domain Adaptation-Driven Physics-Informed Graph Representation Learning for AC-OPF
DDA-PIGCN combines multi-layer physics-informed constraints, dynamic constraint-bound adaptation, and spatial reordering to predict AC-OPF solutions with low reported error on IEEE test cases.
-
Domain-Prior-Regularized Graph Modeling for Anomaly Detection in Cyber-Physical Systems
A forecasting-based anomaly detector whose sensor graph is hard-gated by an LLM-extracted physical-coupling prior and modulated by Pearson correlations outperforms several baselines on SKAB.
-
Distributed Control of Network Systems in the Space of Stabilizing Graph Neural Network Policies
A graph-neural-network policy parameterization guarantees closed-loop stability by construction and transfers from small to large networks without retraining.
-
A Spatio-Temporal Graph Neural Networks Approach for Predicting Silent Data Corruption inducing Circuit-Level Faults
An ST-GCN predicts multi-cycle fault impact probabilities in sequential circuits from graph structure and temporal features, cutting analysis time versus full fault simulation, though the key validation is partly circular.
-
Improving Factuality for Dialogue Response Generation via Graph-Based Knowledge Augmentation
The paper proposes TG-DRG and GA-DRG, two graph-augmented frameworks that combine coreference resolution, knowledge selection, and graph encoding to improve factuality of dialogue responses, evaluated with a newly pro...
-
Enhancing a high resolution data-driven weather prediction model with surface descriptors
Surface descriptors cut 2 m temperature and 10 m wind MAE by 1.9% and 3.0% domain-wide (about 12% for urban temperature) in a stretched-grid data-driven weather model, and glacier removal raises temperature without re...
-
Robust Anomaly Detection with Graph Neural Networks using Controllability
Using average controllability as edge weights or one-hot edge attributes yields small, inconsistent gains for graph anomaly detection across several GNN backbones.
-
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Tri-GFN fuses AE, GCN, and Graph Transformer features with dual self-supervision and reports improved attributed-graph clustering on seven benchmarks.
Discussion (0). Continue with ORCID to comment.