Scaling GraphLLM with Bilevel-Optimized Sparse Querying 事件

Scaling GraphLLM with Bilevel-Optimized Sparse Querying arXiv:2602.09038v2 Announce Type: replace-cross Abstract: LLMs have recently shown strong potential in enhancing node-level tasks on text-attributed graphs (TAGs) by providing explanation features. However, their practical use is severely limited by the high computational and monetary cost of repeated LLM queries. To illustrate, naively generating explanations for all nodes on a medium-sized benchmark like Photo (48k nodes) using a represe