Return
MetaPFS: Memory-efficient node classification on text-attributed graphs via meta-guided progressive feature selection
Y
L
Z
X
J
Y
DOI:10.1016/j.ipm.2025.104542.png)
Abstract
En 中文
• Identify feature redundancy as a major bottleneck in TAG node classification with PLMs. • Propose feature-agnostic warm-up training to inject global semantic priors before selection. • Propose progressive feature sharpening for smooth and consistent transition from soft to hard selection. • Propose a virtual-task-regularized meta learning policy to handle dynamic feature perturbations effectively. • Present MetaPFS, achieving competitive performance with minimal memory cost.
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W
