REVIEW 19 cited by
One for All: Towards Training One Graph Model for All Classification Tasks
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
read the original abstract
Designing a single model to address multiple tasks has been a long-standing objective in artificial intelligence. Recently, large language models have demonstrated exceptional capability in solving different tasks within the language domain. However, a unified model for various graph tasks remains underexplored, primarily due to the challenges unique to the graph learning domain. First, graph data from different areas carry distinct attributes and follow different distributions. Such discrepancy makes it hard to represent graphs in a single representation space. Second, tasks on graphs diversify into node, link, and graph tasks, requiring distinct embedding strategies. Finally, an appropriate graph prompting paradigm for in-context learning is unclear. We propose \textbf{One for All (OFA)}, the first general framework that can use a single graph model to address the above challenges. Specifically, OFA proposes text-attributed graphs to unify different graph data by describing nodes and edges with natural language and uses language models to encode the diverse and possibly cross-domain text attributes to feature vectors in the same embedding space. Furthermore, OFA introduces the concept of nodes-of-interest to standardize different tasks with a single task representation. For in-context learning on graphs, OFA introduces a novel graph prompting paradigm that appends prompting substructures to the input graph, which enables it to address varied tasks without fine-tuning. We train the OFA model using graph data from multiple domains (including citation networks, molecular graphs, knowledge graphs, etc.) simultaneously and evaluate its ability in supervised, few-shot, and zero-shot learning scenarios. OFA performs well across different tasks, making it the first general-purpose across-domains classification model on graphs.
Forward citations
Cited by 19 Pith papers
-
PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning
PromptGNN-sim uses GAT-based semantically aware neighborhood selection and structure-aware LLM prompts with bi-directional contrastive alignment to outperform prior GNN, LLM, and fusion methods on text-attributed grap...
-
GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs
Presents GraphInfer-Bench to demonstrate that no evaluated LLM-based method family closes the performance gap on graph inference tasks requiring multi-node reasoning, with plain GNNs matching or exceeding them.
-
Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models
GraphSSR introduces an adaptive SSR pipeline with SSR-SFT data synthesis and SSR-RL (Authenticity-Reinforced and Denoising-Reinforced stages) to overcome one-size-fits-all subgraph noise in zero-shot LLM graph reasoning.
-
GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning
GraphVec produces transferable fixed-dimensional graph embeddings via spectral features from multi-scale global graphs and a convergent mean-alignment procedure, outperforming baselines on cross-domain few-shot classi...
-
Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models
ProGFM transfers graph knowledge across domains by learning a prototype bank of per-edge, per-dimension propagation strengths and using them to modulate message passing on unseen graphs.
-
Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching
Bidirectional LLM-GNN co-teaching with round-based pseudo-label preference optimization outperforms golden-teacher baselines on few-shot TAG benchmarks by 3-8% absolute gains.
-
Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation
HyRAG improves zero-shot generalization of graph foundation models by indexing and retrieving from tree-structured knowledge in hyperbolic space via multi-granularity retrieval and dual-path fusion.
-
S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs
S2Aligner decouples semantic and structural components in LLM-as-Aligner pre-training for sparse TAGs and uses structure-oriented reconstruction plus domain risk balancing to improve transferability and reduce general...
-
SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory
SAGE is a self-evolving agentic graph-memory engine that dynamically constructs and refines structured memory graphs via writer-reader feedback, yielding performance gains on multi-hop QA, open-domain retrieval, and l...
-
Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs
LG-Plug mines pseudo-OOD exposures from clustered unlabeled nodes via iterative LLM prompting and regularizes topology-driven graph OOD detectors, cutting FPR95 by ≥7% across six TAG benchmarks.
-
UNIT: Unleash Large Language Models Potential for Graph Continual Learning
UNIT reaches SOTA graph continual learning by one-shot LLM instruction tuning plus uncertainty-aware semantic and structural class anchors that jointly set classifier weights.
-
OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation
OpenRTAG is a benchmark that organizes text-attributed-graph data-quality issues into a 3x3 taxonomy (text/structure/label by sparsity/noise/imbalance) and evaluates model robustness across nine datasets and three tasks.
-
GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks
GLIP is a joint GNN-LLM pretraining framework that uses augmentation, multi-token selection, a diffusion projector, and combined contrastive plus semantic losses to boost graph classification and reasoning after fine-...
-
Handling Feature Heterogeneity with Learnable Graph Patches
Learnable graph patches enable domain-agnostic pre-training of graph models by decomposing heterogeneous graphs into transferable semantic units via patch encoders and aggregators.
-
A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation
SPG is a graph foundation model using spectral decomposition via Chebyshev filters and Gromov-Wasserstein prototypes for improved cross-graph transferability.
-
S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs
S2Aligner decouples semantic and structural components in LLM-based graph-text alignment, adds structure-oriented reconstruction with consistency control, and uses sparsity-aware risk balancing to reduce cross-domain ...
-
Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm
A per-graph BERT-style masked random-walk model is repurposed to generate shortest paths and tours, with mixed quality versus classical solvers and no cross-graph transfer evaluation.
-
GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning
GSTBench finds that masked feature reconstruction (GraphMAE) is the only one of five graph self-supervised pretraining objectives that consistently transfers across eight datasets, while contrastive methods often perf...
-
G2LoRA: Gradient Orthogonal Low-Rank Adaptation Framework for Graph Continual Learning on Text-Attributed Graphs
G2LoRA proposes category-aware gradient projection and magnitude modulation within a unified graph-text alignment objective to mitigate interference and promote transfer in continual learning on text-attributed graphs.
Discussion (0). Sign in to comment.