Call Neighbours Yourself: Graph Walks with Destination-Conditioned On-Policy Self-Distillation

Paper recorded by Signals 4 on 2026-08-30 in cs.AI. Abstract reproduced from arXiv; link to the original below.

Published 2026-08-30 on arXiv · recorded by Signals 4 on 2026-09-01

Category: cs.AI · 人工智能 · first seen 2026-09-01

Abstract

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

Read on arXiv →