Self-improvement of a decoder-only transformer yields plans averaging 30% shorter than a source symbolic planner, over 80% optimal where known, with sub-exponential latency scaling.
arXiv preprint arXiv:2508.07743 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Modified OCL search integrates generative rollouts and learned heuristics for efficient inference in planning models across combinatorial domains.
citing papers explorer
-
Self-Improvement for Fast, High-Quality Plan Generation
Self-improvement of a decoder-only transformer yields plans averaging 30% shorter than a source symbolic planner, over 80% optimal where known, with sub-exponential latency scaling.
-
Efficient Test-time Inference for Generative Planning Models with OCL Search
Modified OCL search integrates generative rollouts and learned heuristics for efficient inference in planning models across combinatorial domains.