SOURCE-LINKED INTELLIGENCE

Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport

arXiv · AI, language, vision and robotics · article · Sep 20, 2026 · UTC

Graph prompt learning enables parameter-efficient adaptation of frozen Graph Neural Networks to downstream tasks through lightweight prompt parameters. As routing becomes increasingly node-adaptive, however, independently optimized local decisions can collectively concentrate assignment mass on a small subset of a finite shared prompt bank, even when individual node--prompt matches remain locally meaningful. We propose MINT (Measure-INtegrity Transport), an entropically regularized optimal transport framework that formulates node-to-prompt adaptation as a globally coupled allocation problem. T

Read original source ↗ Open in workspace

recordType

paper

region

Global