Fully Inductive Node Representation Learning via Graph View Transformation

Dooho Lee, Myeong Kong, Minho Jeong, Jaemin Yoo
12/12/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Generalizing a pretrained model to unseen datasets without retraining is an essential step toward a foundation model. However, achieving such cross-dataset, fully inductive inference is difficult in graph-structured data where feature spaces vary widely in both dimensionality and semantics. Any transformation in the feature space can easily violate the inductive applicability to unseen datasets, strictly limiting the design space of a graph model. In this work, we introduce the view space, a novel representational axis in which arbitrary graphs can be naturally encoded in a unified manner. We then propose Graph View Transformation (GVT), a node- and feature-permutation-equivariant mapping in the view space. GVT serves as the building block for Recurrent GVT, a fully inductive model for node representation learning. Pretrained on OGBN-Arxiv and evaluated on 27 node-classification benchmarks, Recurrent GVT outperforms GraphAny, the prior fully inductive graph model, by +8.93% and surpasses 12 individually tuned GNNs by at least +3.30%. These results establish the view space as a principled and effective ground for fully inductive node representation learning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lee2025fully,
  title  = {Fully Inductive Node Representation Learning via Graph View Transformation},
  author = {Dooho Lee and Myeong Kong and Minho Jeong and Jaemin Yoo},
  year   = {2025},
  eprint = {2512.11561},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.11561v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.11561.svg)](https://codeofpaper.com/paper/2512.11561)

Discussion