Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport
* Equal contribution
IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI)Major Revision2026
Graph prompting often makes locally plausible routing decisions that nevertheless collapse onto a small prompt bank globally. MINT uses fixed-marginal optimal transport to control prompt capacity while preserving semantic compatibility; a variance decomposition clarifies the resulting geometry, and complementary topology adaptation supports gains across homophilic and heterophilic benchmarks.