Qing Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qing Yu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Chenliang Li
Wuhan University
2 shared publications - Chuan Zhou
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
2 shared publications Lixin Zou
School of Cyber Science and Engineering, Wuhan University, Wuhan, China
2 shared publications- Xixun Lin
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
2 shared publications - Dawei Yin
Baidu Inc., Beijing, China
1 shared publication Fengzhao Shi
Institute of Information Engineering, Chinese Academy of Sciences, China; School of Cyber Security, University of Chinese Academy of Sciences, China
1 shared publication
Latest Publications
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (1) , 1029-1044
Generative Causality-Driven Network for Graph Multi-Task Learning
Multi-task learning (MTL) is a standard learning paradigm in machine learning. The central idea of MTL is to capture the shared knowledge among multiple tasks for mitigating the problem of data sparsity where the annotated samples for each task are quite limited. Recent studies indicate that graph multi-task learning (GMTL) yields the promising improvement over previous MTL methods. GMTL represents tasks on a task relation graph, and further leverages graph neural networks (GNNs) to learn complex task relationships. Although GMTL achieves the better performance, the construction of task relation graph heavily depends on simple heuristic tricks, which results in the existence of spurious task correlations and the absence of true edges between tasks with strong connections. This problem largely limits the effectiveness of GMTL. To this end, we propose the Generative Causality-driven Network (GCNet), a novel framework that progressively learns the causal structure between tasks to discover which tasks are beneficial to be jointly trained for improving generalization ability and model robustness. To be specific, in the feature space, GCNet first introduces a feature-level generator to generate the structure prior for reducing learning difficulty. Afterwards, GCNet develops a output-level generator which is parameterized as a new causal energy-based model (EBM) to refine the learned structure prior in the output space driven by causality. Benefiting from our proposed causal framework, we theoretically derive an intervention contrastive estimation for training this causal EBM efficiently. Experiments are conducted on multiple synthetic and real-world datasets. Extensive empirical results and model analyses demonstrate the superior performance of GCNet over several competitive MTL baselines.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (1) , 1029-1044
Generative Causality-Driven Network for Graph Multi-Task Learning
Multi-task learning (MTL) is a standard learning paradigm in machine learning. The central idea of MTL is to capture the shared knowledge among multiple tasks for mitigating the problem of data sparsity where the annotated samples for each task are quite limited. Recent studies indicate that graph multi-task learning (GMTL) yields the promising improvement over previous MTL methods. GMTL represents tasks on a task relation graph, and further leverages graph neural networks (GNNs) to learn complex task relationships. Although GMTL achieves the better performance, the construction of task relation graph heavily depends on simple heuristic tricks, which results in the existence of spurious task correlations and the absence of true edges between tasks with strong connections. This problem largely limits the effectiveness of GMTL. To this end, we propose the Generative Causality-driven Network (GCNet), a novel framework that progressively learns the causal structure between tasks to discover which tasks are beneficial to be jointly trained for improving generalization ability and model robustness. To be specific, in the feature space, GCNet first introduces a feature-level generator to generate the structure prior for reducing learning difficulty. Afterwards, GCNet develops a output-level generator which is parameterized as a new causal energy-based model (EBM) to refine the learned structure prior in the output space driven by causality. Benefiting from our proposed causal framework, we theoretically derive an intervention contrastive estimation for training this causal EBM efficiently. Experiments are conducted on multiple synthetic and real-world datasets. Extensive empirical results and model analyses demonstrate the superior performance of GCNet over several competitive MTL baselines.
- Open Access
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (4) , 1-26
Uniform Graph Pre-training and Prompting for Transferable Recommendation
Recently, the paradigm of pre-training and fine-tuning has achieved impressive performance owing to their ability to transfer general knowledge from pre-trained domain to target domain. Meanwhile, graph neural networks (GNNs) have gained prominence in recommender systems. However, there is a lack of unified pre-training and fine-tuning paradigms in graph-based recommendation systems. Applying pre-training and fine-tuning in graph-based recommendation is challenging due to the unique characteristics of recommendation data, including the non-uniform representation, negative transfer effects, and skewed data distributions. To overcome these challenges, we introduce pre-training and prompting recommendation ( ProRec ) , a novel model that synergizes uniform graph pre-training with prompt-tuning for recommendation systems. Specifically, to address the challenge of inconsistent features across different recommendation datasets, ProRec constructs unified input features at the subgraph level and uses a graph auto-encoder for pre-training, laying the foundation for uniform knowledge transfer from the pre-trained domain to the downstream domain. Additionally, ProRec employs prompt-tuning during the fine-tuning phase, which, in a parameter-efficient manner, enhances the generalization of pre-trained knowledge to downstream tasks thereby reducing negative transfer effects. Furthermore, a cross-layer contrastive learning strategy is adopted to eliminate uneven data distribution, promoting more evenly distributed and informative representations. Finally, extensive benchmark comparisons have demonstrated that ProRec outperforms the latest state-of-the-art methods. The source code necessary for replication is available at https://github.com/Code2Q/ProRec .
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (4) , 1-26
Open AccessUniform Graph Pre-training and Prompting for Transferable Recommendation
Recently, the paradigm of pre-training and fine-tuning has achieved impressive performance owing to their ability to transfer general knowledge from pre-trained domain to target domain. Meanwhile, graph neural networks (GNNs) have gained prominence in recommender systems. However, there is a lack of unified pre-training and fine-tuning paradigms in graph-based recommendation systems. Applying pre-training and fine-tuning in graph-based recommendation is challenging due to the unique characteristics of recommendation data, including the non-uniform representation, negative transfer effects, and skewed data distributions. To overcome these challenges, we introduce pre-training and prompting recommendation ( ProRec ) , a novel model that synergizes uniform graph pre-training with prompt-tuning for recommendation systems. Specifically, to address the challenge of inconsistent features across different recommendation datasets, ProRec constructs unified input features at the subgraph level and uses a graph auto-encoder for pre-training, laying the foundation for uniform knowledge transfer from the pre-trained domain to the downstream domain. Additionally, ProRec employs prompt-tuning during the fine-tuning phase, which, in a parameter-efficient manner, enhances the generalization of pre-trained knowledge to downstream tasks thereby reducing negative transfer effects. Furthermore, a cross-layer contrastive learning strategy is adopted to eliminate uneven data distribution, promoting more evenly distributed and informative representations. Finally, extensive benchmark comparisons have demonstrated that ProRec outperforms the latest state-of-the-art methods. The source code necessary for replication is available at https://github.com/Code2Q/ProRec .
- 26 March 2025
- Published by Elsevier in Neural Networks
- Vol. 188, 107381
IBPL: Information Bottleneck-based Prompt Learning for graph out-of-distribution detection
- 26 March 2025
- Published by Elsevier in Neural Networks
- Vol. 188, 107381
IBPL: Information Bottleneck-based Prompt Learning for graph out-of-distribution detection