paper-with-me

홈 › Papers

Instance-Aware Graph Prompt Learning

2024-11-26 · Jiazheng Li, Jundong Li, Chuxu Zhang

Graph neural networks stand as the predominant technique for graph representation learning owing to their strong expressive power, yet the performance highly depends on the availability of high-quality labels in an end-to-end manner. Thus the pretraining and fine-tuning paradigm has been proposed to mitigate the label cost issue. Subsequently, the gap between the pretext tasks and downstream tasks has spurred the development of graph prompt learning which inserts a set of graph prompts into the original graph data with minimal parameters while preserving competitive performance. However, the current exploratory works are still limited since they all concentrate on learning fixed task-specific prompts which may not generalize well across the diverse instances that the task comprises. To tackle this challenge, we introduce Instance-Aware Graph Prompt Learning (IA-GPL) in this paper, aiming to generate distinct prompts tailored to different input instances. The process involves generating intermediate prompts for each instance using a lightweight architecture, quantizing these prompts through trainable codebook vectors, and employing the exponential moving average technique to ensure stable training. Extensive experiments conducted on multiple datasets and settings showcase the superior performance of IA-GPL compared to state-of-the-art baselines.

📄 PDF Abstract BibTeX arXiv:2411.17676

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Representation LearningPrompt LearningRepresentation Learning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Instance-aware Prompt Learning for Language Understanding and Generation

2022-01-18 · Feihu Jin, Jinliang Lu, Jiajun Zhang, Chengqing Zong

Recently, prompt learning has become a new paradigm to utilize pre-trained language models (PLMs) and achieves promising results in downstream tasks with a negligible increase of parameters. The current usage of discrete…

Few-Shot LearningPrompt Learning

All You Need is One: Capsule Prompt Tuning with a Single Vector

2025-10-19 · Yiyang Liu, James C. Liang, Heng Fan, Wenhao Yang 외 arxiv

Prompt-based learning has emerged as a parameter-efficient finetuning (PEFT) approach to facilitate Large Language Model (LLM) adaptation to downstream tasks by conditioning generation with task-aware guidance. Despite i…

Visual Instance-aware Prompt Tuning

2025-07-10 · Xi Xiao, Yunbei Zhang, Xingjian Li, Tianyang Wang 외 arxiv

Visual Prompt Tuning (VPT) has emerged as a parameter-efficient fine-tuning paradigm for vision transformers, with conventional approaches utilizing dataset-level prompts that remain the same across all input instances. …

parameter-efficient fine-tuningVisual Prompt Tuning

IAP: Improving Continual Learning of Vision-Language Models via Instance-Aware Prompting

2025-03-26 · Hao Fu, Hanbin Zhao, Jiahua Dong, Chao Zhang 외

Recent pre-trained vision-language models (PT-VLMs) often face a Multi-Domain Class-Incremental Learning (MCIL) scenario in practice, where several classes and domains of multi-modal tasks are incrementally arrived. With…

class-incremental learningClass Incremental LearningContinual LearningIncremental Learning+1

Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction

2022-10-19 · Yunzhi Yao, Shengyu Mao, Ningyu Zhang, Xiang Chen 외

With the development of pre-trained language models, many prompt-based approaches to data-efficient knowledge graph construction have been proposed and achieved impressive performance. However, existing prompt-based lear…

Event Extractiongraph constructionRepresentation LearningRetrieval