Hanyu Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hanyu Wang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Bo Ni
Vanderbilt University, Nashville, TN, USA
1 shared publication - Jiawei Yang
Renmin University of China, Beijing, China
1 shared publication - Leyao Wang
Yale University
1 shared publication - Mengwei Wang
Renmin University of China, Beijing, China
1 shared publication - Sensen Zhang
China Jiliang University College of Modern Science and Technology, Yiwu, China
1 shared publication - Shichao Song
Renmin University of China, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4975-4986
Semantic Association vs. Position: Which Information Do Attention Heads Prefer?
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4975-4986
Open AccessSemantic Association vs. Position: Which Information Do Attention Heads Prefer?
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1447-1458
SaVe-TAG: LLM-based Interpolation for Long-Tailed Text-Attributed Graphs
Real-world graph data often follows long-tailed distributions, making it difficult for Graph Neural Networks (GNNs) to generalize well across both head and tail classes. Recent advances in Vicinal Risk Minimization (VRM) have shown promise in mitigating class imbalance with numeric interpolation; however, existing approaches largely rely on embedding-space arithmetic, which fails to capture the rich semantics inherent in text-attributed graphs. In this work, we propose our method, SaVe-TAG (Semantic-aware Vicinal Risk Minimization for Long-Tailed Text-Attributed Graphs), a novel VRM framework that leverages Large Language Models (LLMs) to perform text-level interpolation, generating on-manifold, boundary-enriching synthetic samples for minority classes. To mitigate the risk of noisy generation, we introduce a confidence-based edge assignment mechanism that uses graph topology as a natural filter to ensure structural consistency. We provide theoretical justification for our method and conduct extensive experiments on benchmark datasets, showing that our approach consistently outperforms both numeric interpolation and prior long-tailed node classification baselines. Our results highlight the importance of integrating semantic and structural signals for balanced and effective learning on text-attributed graphs. The source code is publicly available at: https://github.com/LWang-Laura/SaVe-TAG.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1447-1458
Open AccessSaVe-TAG: LLM-based Interpolation for Long-Tailed Text-Attributed Graphs
Real-world graph data often follows long-tailed distributions, making it difficult for Graph Neural Networks (GNNs) to generalize well across both head and tail classes. Recent advances in Vicinal Risk Minimization (VRM) have shown promise in mitigating class imbalance with numeric interpolation; however, existing approaches largely rely on embedding-space arithmetic, which fails to capture the rich semantics inherent in text-attributed graphs. In this work, we propose our method, SaVe-TAG (Semantic-aware Vicinal Risk Minimization for Long-Tailed Text-Attributed Graphs), a novel VRM framework that leverages Large Language Models (LLMs) to perform text-level interpolation, generating on-manifold, boundary-enriching synthetic samples for minority classes. To mitigate the risk of noisy generation, we introduce a confidence-based edge assignment mechanism that uses graph topology as a natural filter to ensure structural consistency. We provide theoretical justification for our method and conduct extensive experiments on benchmark datasets, showing that our approach consistently outperforms both numeric interpolation and prior long-tailed node classification baselines. Our results highlight the importance of integrating semantic and structural signals for balanced and effective learning on text-attributed graphs. The source code is publicly available at: https://github.com/LWang-Laura/SaVe-TAG.