Sparsity-guided holistic explanation for llms with interpretable inference-time intervention

Z Tan, T Chen, Z Zhang, H Liu - … of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
Abstract Large Language Models (LLMs) have achieved unprecedented breakthroughs in
various natural language processing domains. However, the enigmatic``black-box''nature of …

Knowledge distillation guided interpretable brain subgraph neural networks for brain disorder exploration

X Luo, J Wu, J Yang, H Chen, Z Li… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The human brain is a highly complex neurological system that has been the subject of
continuous exploration by scientists. With the help of modern neuroimaging techniques …

Enhancing Distribution and Label Consistency for Graph Out-of-Distribution Generalization

S Wang, X Yang, R Islam, H Chen, M Xu, J Li… - arxiv preprint arxiv …, 2025 - arxiv.org
To deal with distribution shifts in graph data, various graph out-of-distribution (OOD)
generalization techniques have been recently proposed. These methods often employ a two …

Graph augmentation for node-level few-shot learning

Z Wu, P Zhou, J Ma, J Zhang, G Yuan, X Zhu - Knowledge-Based Systems, 2024 - Elsevier
In graph few-shot learning, few-shot node classification (FSNC) at the node-level is a
popular downstream task. Previous FSNC methods primarily rely on meta-learning or metric …

From overfitting to robustness: Quantity, quality, and variety oriented negative sample selection in graph contrastive learning

A Ali, J Li, H Chen, AK Bashir - Applied Soft Computing, 2025 - Elsevier
Graph contrastive learning (GCL) aims to contrast positive–negative counterparts to learn
the node embeddings, whereas graph data augmentation methods are employed to …

Graph Cross Supervised Learning via Generalized Knowledge

X Yuan, Y Tian, C Zhang, Y Ye, NV Chawla… - Proceedings of the 30th …, 2024 - dl.acm.org
The success of GNNs highly relies on the accurate labeling of data. Existing methods of
ensuring accurate labels, such as weakly-supervised learning, mainly focus on the existing …

Budget-Constrained Ego Network Extraction with Maximized Willingness

BY Hsu, CH Lu, MY Chang, CY Tseng… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Many large-scale machine learning approaches and graph algorithms are proposed
recently to address a variety of problems in online social networks (OSNs). To evaluate and …

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport

Y Liu, F Giunchiglia, X Li, L Huang, X Feng… - arxiv preprint arxiv …, 2025 - arxiv.org
Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to
downstream tasks with limited labeled data, sparking considerable interest among …

Virtual Node Generation for Node Classification in Sparsely-Labeled Graphs

H Cui, T Abdelzaher - arxiv preprint arxiv:2409.07712, 2024 - arxiv.org
In the broader machine learning literature, data-generation methods demonstrate promising
results by generating additional informative training examples via augmenting sparse labels …

Few‐Shot Contrastive Learning‐Based Multi‐Round Dialogue Intent Classification Method

F Wei, X Zhang - Expert Systems, 2025 - Wiley Online Library
Traditional text classification models face challenges in handling long texts and
understanding topic transitions in dialogue scenarios, leading to suboptimal performance in …