← Search

Yongqi Huang

7 accepted papers

2026

CHoE: Cross-Domain Heterogeneous Graph Prompt Learning via Structure-Conditioned Experts

IJCAI 2026

Heterogeneous Graph Prompt Learning (HGPL) has emerged as a promising paradigm for bridging the gap between the objectives of pre-training foundation models and their downstream applications in heterogeneous graph settings. However, existing HGPL methods are primarily designed for in-domain scenario

Cited by 0Scholar
2026

GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks

ICML 2026poster

Graph Prompt Learning (GPL) has recently emerged as a promising paradigm for downstream adaptation of pre-trained graph models, mitigating the misalignment between pre-training objectives and downstream tasks. Recently, the focus of GPL has shifted from in-domain to cross-domain scenarios, which is …

Cited by 0SourceScholar
2026

MUG: Meta-path-aware Universal Heterogeneous Graph Pre-Training

AAAI 2026technical

Universal graph pre-training has emerged as a key paradigm in graph representation learning, offering a promising way to train encoders to learn transferable representations from unlabeled graphs and to effectively generalize across a wide range of downstream tasks. However, recent explorations in u

Cited by 0SourcePDFScholar
2025

DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Models

CVPR 2025poster

Upcycled Mixture-of-Experts (MoE) models have shown great potential in various tasks by converting the original Feed-Forward Network (FFN) layers in pre-trained dense models into MoE layers. However, these models still suffer from significant parameter inefficiency due to the introduction of multipl…

Cited by 1SourcePDFScholar
2025

Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Sampling

AAAI 2025technical

Graph Contrastive Learning (GCL) aims to self-supervised learn low-dimensional graph representations, primarily through instance discrimination, which involves manually mining positive and negative pairs from graphs, increasing the similarity of positive pairs while decreasing negative pairs. Drawin…

2025

One Prompt Fits All: Universal Graph Adaptation for Pretrained Models

NeurIPS 2025poster

Graph Prompt Learning (GPL) has emerged as a promising paradigm that bridges graph pretraining models and downstream scenarios, mitigating label dependency and the misalignment between upstream pretraining and downstream tasks. Although existing GPL studies explore various prompt strategies, their e…

Cited by 0SourceScholar
2024

A New Mechanism for Eliminating Implicit Conflict in Graph Contrastive Learning

AAAI 2024technical

Graph contrastive learning (GCL) has attracted considerable attention because it can self-supervisedly extract low-dimensional representation of graph data. InfoNCE-based loss function is widely used in graph contrastive learning, which pulls the representations of positive pairs close to each other…