Pith. sign in

REVIEW 2 cited by

GraphCLIP: Enhancing Transferability in Graph Foundation Models for Text-Attributed Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.10329 v4 pith:WVKZH3F3 submitted 2024-10-14 cs.LG cs.AI

classification cs.LGcs.AI
keywords graphgraphclipmodelstransferabilityfew-shotfoundationlearningcross-domain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, research on Text-Attributed Graphs (TAGs) has gained significant attention due to the prevalence of free-text node features in real-world applications and the advancements in Large Language Models (LLMs) that bolster TAG methodologies. However, current TAG approaches face two primary challenges: (i) Heavy reliance on label information and (ii) Limited cross-domain zero/few-shot transferability. These issues constrain the scaling of both data and model size, owing to high labor costs and scaling laws, complicating the development of graph foundation models with strong transferability. In this work, we propose the GraphCLIP framework to address these challenges by learning graph foundation models with strong cross-domain zero/few-shot transferability through a self-supervised contrastive graph-summary pretraining method. Specifically, we generate and curate large-scale graph-summary pair data with the assistance of LLMs, and introduce a novel graph-summary pretraining method, combined with invariant learning, to enhance graph foundation models with strong cross-domain zero-shot transferability. For few-shot learning, we propose a novel graph prompt tuning technique aligned with our pretraining objective to mitigate catastrophic forgetting and minimize learning costs. Extensive experiments show the superiority of GraphCLIP in both zero-shot and few-shot settings, while evaluations across various downstream tasks confirm the versatility of GraphCLIP. Our code is available at: https://github.com/ZhuYun97/GraphCLIP

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When Does Explicit View Routing Work? A Controlled Study of Multi-View Graph-Text Alignment

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Explicit label and property view routing is content-dependent on BBBP and BACE, while topology does not consistently specialize.

  2. Transferable and Forecastable User Targeting Foundation Model

    cs.LG 2024-12 reject novelty 5.0 of 10

    FOUND aligns user history embeddings with text descriptions of future behavior, enabling zero-shot and few-shot user targeting from a single sentence on Alipay.

Pith tools