Small language models adapted for closed-loop graph algorithm execution achieve reliable policies for traversal and coloring but show high sensitivity to error accumulation in weighted procedures, demonstrating that step accuracy does not ensure rollout reliability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Closed-Loop Graph Algorithm Execution with Small Language Models: Step Accuracy and Rollout Reliability
Small language models adapted for closed-loop graph algorithm execution achieve reliable policies for traversal and coloring but show high sensitivity to error accumulation in weighted procedures, demonstrating that step accuracy does not ensure rollout reliability.