Metraipolis › archive › dc_ccd89679ab10
Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport — arXiv:2609.23547
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23547
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:07:15.659Z
- SHA-256 of the archived text
e99bc89501722bff6140a33fe801f8bb8da064a2245ab3619231b6e389cd8e03- Stable URL of this page
https://metraipolis.com/documento/dc_ccd89679ab10
How to cite
Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport — arXiv:2609.23547 — arXiv (en), https://arxiv.org/abs/2609.23547 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccd89679ab10 (Metraipolis archive dc_ccd89679ab10, sha256 e99bc89501722bff6140a33fe801f8bb8da064a2245ab3619231b6e389cd8e03)
BibTeX
@misc{dcccd89679ab10,
title = {Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport — arXiv:2609.23547},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23547},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccd89679ab10; sha256 e99bc89501722bff6140a33fe801f8bb8da064a2245ab3619231b6e389cd8e03},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23547. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. The transport cost favors local geometric compatibility, while a prescribed prompt-side marginal explicitly controls graph-wide prompt utilization. We further derive an exact variance decomposition that separates prompt-side geometric variance into retained prompt-update variation and within-node barycentric dispersion, together with a conditional stability bound for the frozen-encoder forward map. Across standard citation networks and additional heterophilic graphs, MINT remains competitive in few-shot adaptation. Controlled and end-to-end experiments further distinguish the roles of routing and topology: fixed-marginal routing controls graph-wide prompt utilization and has measurable end-to-end effects on citation networks, while topology augmentation provides a complementary, graph-dependent mechanism for addressing structural mismatch. Code is available at this https URL . Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.23547 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T06:58:09.311Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).