Uncertainty-Aware Graph Self-Training with Expectation-Maximization Regularization
In this paper, we propose a novel \emph{uncertainty-aware graph self-training} approach for semi-supervised node classification. Our method introduces an Expectation-Maximization (EM) regularization scheme to incorporate an uncertainty mechanism during pseudo-label generation and model retraining. Unlike conventional graph self-training pipelines that rely on fixed pseudo-labels, our approach iteratively refines label confidences with an EM-inspired uncertainty measure. This ensures that the predictive model focuses on reliable graph regions while gradually incorporating ambiguous nodes. Inspired by prior work on uncertainty-aware self-training techniques~\cite{wang2024uncertainty}, our framework is designed to handle noisy graph structures and feature spaces more effectively. Through extensive experiments on several benchmark graph datasets, we demonstrate that our method outperforms strong baselines by a margin of up to 2.5\% in accuracy while maintaining lower variance in performance across multiple runs.
Code (0)
등록된 구현이 없습니다.
Tasks
Node ClassificationPseudo LabelSimilar Papers 제목 키워드 기반
Graph-Based Uncertainty-Aware Self-Training with Stochastic Node Labeling
Self-training has become a popular semi-supervised learning technique for leveraging unlabeled data. However, the over-confidence of pseudo-labels remains a key challenge. In this paper, we propose a novel \emph{graph-ba…
Node ClassificationPseudo LabelUncertainty-aware self-training with expectation maximization basis transformation
Self-training is a powerful approach to deep learning. The key process is to find a pseudo-label for modeling. However, previous self-training algorithms suffer from the over-confidence issue brought by the hard labels, …
image-classificationImage ClassificationPseudo LabelSemantic SegmentationTwo Birds with One Stone: Enhancing Uncertainty Quantification and Interpretability with Graph Functional Neural Process
Graph neural networks (GNNs) are powerful tools on graph data. However, their predictions are mis-calibrated and lack interpretability, limiting their adoption in critical applications. To address this issue, we propose …
Graph ClassificationUncertainty Propagation in the Fast Fourier Transform
We address the problem of uncertainty propagation in the discrete Fourier transform by modeling the fast Fourier transform as a factor graph. Building on this representation, we propose an efficient framework for approxi…
Bayesian InferenceEnhancing Uncertainty Estimation in LLMs with Expectation of Aggregated Internal Belief
Large Language Models (LLMs) have achieved remarkable success across a wide range of natural language tasks, but often exhibit overconfidence and generate plausible yet incorrect answers. This overconfidence, especially …
Reinforcement Learning