REVIEW 8 cited by
Towards Foundation Models for Knowledge Graph Reasoning
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
Towards Foundation Models for Knowledge Graph Reasoning
read the original abstract
Foundation models in language and vision have the ability to run inference on any textual and visual inputs thanks to the transferable representations such as a vocabulary of tokens in language. Knowledge graphs (KGs) have different entity and relation vocabularies that generally do not overlap. The key challenge of designing foundation models on KGs is to learn such transferable representations that enable inference on any graph with arbitrary entity and relation vocabularies. In this work, we make a step towards such foundation models and present ULTRA, an approach for learning universal and transferable graph representations. ULTRA builds relational representations as a function conditioned on their interactions. Such a conditioning strategy allows a pre-trained ULTRA model to inductively generalize to any unseen KG with any relation vocabulary and to be fine-tuned on any graph. Conducting link prediction experiments on 57 different KGs, we find that the zero-shot inductive inference performance of a single pre-trained ULTRA model on unseen graphs of various sizes is often on par or better than strong baselines trained on specific graphs. Fine-tuning further boosts the performance.
Forward citations
Cited by 8 Pith papers
-
Fully Inductive Cardinality Estimation
An encoder-decoder GNN over a factor-graph view of RDF KGs estimates BGP cardinalities on entirely unseen graphs without retraining, cutting median q-error roughly in half versus the best baseline.
-
Graphlets as Building Blocks for Structural Vocabulary in Knowledge Graph Foundation Models
Graphlets mined as structural tokens improve zero-shot inductive and transductive link prediction in knowledge graph foundation models across 51 diverse graphs.
-
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...
-
DualG-MRAG: Decoupling Macro-Reasoning and Micro-Matching for Multimodal Retrieval-Augmented Generation
Decoupling macro topological routing from micro visual matching, plus query-driven GNN path decoding, improves multimodal multi-hop retrieval and QA over strong MM-RAG baselines.
-
InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs
Combining graph wavelet embeddings with Neural Bellman-Ford message passing reduces the layers needed for inductive logical query answering on large knowledge graphs.
-
KGPFN: Unlocking the Potential of Knowledge Graph Foundation Model via In-Context Learning
KGPFN pretrains on multiple KGs to learn relation patterns, then performs query-specific reasoning by encoding local context with NBFNet and global context via retrieved instances aggregated in a PFN with feature- and...
-
EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval
EHRAG constructs structural hyperedges from sentence co-occurrence and semantic hyperedges from entity embedding clusters, then applies hybrid diffusion plus topic-aware PPR to retrieve top-k documents, outperforming ...
-
Intellectual Property in Graph-Based Machine Learning as a Service: Attacks and Defenses
A systematic review that organizes graph-ML IP protection into model-level and data-level attacks and defenses, and ships a benchmark library, PyGIP.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.