Call Neighbours Yourself: Graph Walks with Destination-Conditioned On-Policy Self-Distillation
Reasoning over text-attributed graphs (TAGs) requires large language models (LLMs) to combine a node's text with evidence distributed across its neighbourhood. Existing methods fix the set of accessible neighbours before generation, forcing reasoning to operate over a static context and preventing the model from acquiring missing evidence during inference. We argue that neighbour selection should…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
