Modality-free Graph In-context Alignment

• URL: http://arxiv.org/abs/2603.13434v1
• Date: Fri, 13 Mar 2026 07:45:34 GMT
• Title: Modality-free Graph In-context Alignment
• Abstract summary: Modality-Free Graph In-context Alignment (MF-GIA) is a framework that makes a pretrained graph encoder promptable for few-shot prediction across heterogeneous domains.<n>MF-GIA captures domain characteristics through gradient fingerprints, which parameterize lightweight transformations.<n>Experiments demonstrate that MF-GIA achieves superior few-shot performance across diverse graph domains.
• Score: 14.497854061852292
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In-context learning (ICL) converts static encoders into task-conditioned reasoners, enabling adaptation to new data from just a few examples without updating pretrained parameters. This capability is essential for graph foundation models (GFMs) to approach LLM-level generality. Yet current GFMs struggle with cross-domain alignment, typically relying on modality-specific encoders that fail when graphs are pre-vectorized or raw data is inaccessible. In this paper, we introduce Modality-Free Graph In-context Alignment (MF-GIA), a framework that makes a pretrained graph encoder promptable for few-shot prediction across heterogeneous domains without modality assumptions. MF-GIA captures domain characteristics through gradient fingerprints, which parameterize lightweight transformations that align pre-encoded features and indexed labels into unified semantic spaces. During pretraining, a dual prompt-aware attention mechanism with episodic objective learns to match queries against aligned support examples to establish prompt-based reasoning capabilities. At inference, MF-GIA performs parameter-update-free adaptation using only a few-shot support set to trigger cross-domain alignment and enable immediate prediction on unseen domains. Experiments demonstrate that MF-GIA achieves superior few-shot performance across diverse graph domains and strong generalization to unseen domains.

Related papers

• Domain-Agnostic Neural Topic Modeling with Contextual Token-Level Semantic Graph Representation [5.677982677132719]
  DARTopic is a framework that constructs token-level semantic graphs from frozen PLM embeddings and jointly trains a GNN encoder with topic inference.<n>We show DARTopic consistently outperforms strong baselines in topic coherence and document clus- tering without any encoder fine-tuning.
  arXiv  Detail & Related papers  (2026-08-17T08:43:32Z)
• DOME: Learning Transferable Domain Variables from Sparse Supervision for Test-Time Adaptation [61.70497741321102]
  Test-time adaptation aims to align a model to shifting test domains using only unlabeled streaming data.<n>Most existing methods implicitly infer a single global domain distribution, ignoring the multidimensional and sample-specific nature of real-world domain shifts.<n>We propose DOME, an effective domain encoder that explicitly models each sample's domain in a zero-shot manner.
  arXiv  Detail & Related papers  (2026-06-02T03:24:03Z)
• GFMate: Empowering Graph Foundation Models with Test-time Prompt Tuning [41.859993506122194]
  Recent research has extended graph prompts to improve Graph Foundation Models (GFMs)<n>Most existing methods embed source-domain information into prompts, which serve either as input to GFMs or encoded during model pre-training.<n>Motivated by these insights, this paper aims to empower GFMs with pre-training-agnostic test-time graph prompt tuning, named GFMate.
  arXiv  Detail & Related papers  (2026-05-14T13:22:33Z)
• Decoupled and Divergence-Conditioned Prompt for Multi-domain Dynamic Graph Foundation Models [59.8742208800447]
  We propose DyGFM, a Dynamic Graph Foundation Model over multiple domains based on decoupled and divergence-conditioned prompting.<n>We show that DyGFM consistently outperforms 12 state-of-the-art baselines on both node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2026-05-13T13:50:03Z)
• STAGE: Tackling Semantic Drift in Multimodal Federated Graph Learning [48.96526409527749]
  Federated graph learning (FGL) enables collaborative training on graph data across multiple clients.<n>The key challenge is that clients from different modality domains may not share a common semantic space.<n>We propose textbfSTAGE, a protocol-first framework for MM-FGL.
  arXiv  Detail & Related papers  (2026-05-12T10:35:43Z)
• GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning [50.40400074353263]
  Graph Neural Networks (GNNs) are powerful tools for precessing relational data but often struggle to generalize to unseen graphs.<n>We introduce textbfGraph textbfIn-context textbfL textbfTransformer (GILT), a framework built on an LLM-free and tuning-free architecture.
  arXiv  Detail & Related papers  (2025-10-06T08:09:15Z)
• Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement [9.87623531653534]
  Graph foundation models (GFM) offer strong domain generalization but are usually trained on single machines.<n>We propose FedGFM, a novel decentralized GFM training paradigm.<n>Key challenge is knowledge entanglement, where multi-domain knowledge merges into indistinguishable representations.<n>We present FedGFM+, an enhanced framework with two core modules to reduce knowledge entanglement.
  arXiv  Detail & Related papers  (2025-05-19T04:06:32Z)
• Gradual Domain Adaptation for Graph Learning [15.648578809740414]
  We present a graph gradual domain adaptation (GGDA) framework, which constructs a compact domain sequence that minimizes information loss during adaptation.<n>Our framework provides implementable upper and lower bounds for the intractable inter-domain Wasserstein distance, $W_p(mu_t,mu_t+1)$, enabling its flexible adjustment for optimal domain formation.
  arXiv  Detail & Related papers  (2025-01-29T06:48:59Z)
• Degree-Conscious Spiking Graph for Cross-Domain Adaptation [51.58506501415558]
  Spiking Graph Networks (SGNs) have demonstrated significant potential in graph classification.<n>We introduce a novel framework named Degree-Consicious Spiking Graph for Cross-Domain Adaptation (DeSGraDA)<n>DeSGraDA enhances generalization across domains with three key components.
  arXiv  Detail & Related papers  (2024-10-09T13:45:54Z)
• A Pure Transformer Pretraining Framework on Text-attributed Graphs [50.833130854272774]
  We introduce a feature-centric pretraining perspective by treating graph structure as a prior. Our framework, Graph Sequence Pretraining with Transformer (GSPT), samples node contexts through random walks. GSPT can be easily adapted to both node classification and link prediction, demonstrating promising empirical success on various datasets.
  arXiv  Detail & Related papers  (2024-06-19T22:30:08Z)
• Learning Domain-invariant Graph for Adaptive Semi-supervised Domain Adaptation with Few Labeled Source Samples [65.55521019202557]
  Domain adaptation aims to generalize a model from a source domain to tackle tasks in a related but different target domain. Traditional domain adaptation algorithms assume that enough labeled data, which are treated as the prior knowledge are available in the source domain. We propose a Domain-invariant Graph Learning (DGL) approach for domain adaptation with only a few labeled source samples.
  arXiv  Detail & Related papers  (2020-08-21T08:13:25Z)
• Cross-domain Detection via Graph-induced Prototype Alignment [114.8952035552862]
  We propose a Graph-induced Prototype Alignment (GPA) framework to seek for category-level domain alignment. In addition, in order to alleviate the negative effect of class-imbalance on domain adaptation, we design a Class-reweighted Contrastive Loss. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-03-28T17:46:55Z)
• Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
  Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them. We propose a generic framework based on graph embedding. We show that the proposed approach leads to a powerful Domain Adaptation framework.
  arXiv  Detail & Related papers  (2020-03-09T12:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.