pith. sign in

arxiv: 2508.07743 · v2 · pith:BVVYDGRBnew · submitted 2025-08-11 · 💻 cs.AI · cs.LG

Symmetry-Aware Transformer Training for Automated Planning

classification 💻 cs.AI cs.LG
keywords planningtransformersefficientlysymmetry-awareautomatedplangpttrainingtransformer
0
0 comments X
read the original abstract

While transformers excel in many settings, their application in the field of automated planning is limited. Prior work like PlanGPT, a state-of-the-art decoder-only transformer, struggles with extrapolation from easy to hard planning problems. This in turn stems from problem symmetries: planning tasks can be represented with arbitrary variable names that carry no meaning beyond being identifiers. This causes a combinatorial explosion of equivalent representations that pure transformers cannot efficiently learn from. We propose a novel contrastive learning objective to make transformers symmetry-aware and thereby compensate for their lack of inductive bias. Combining this with architectural improvements, we show that transformers can be efficiently trained for either plan-generation or heuristic-prediction. Our results across multiple planning domains demonstrate that our symmetry-aware training effectively and efficiently addresses the limitations of PlanGPT.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Self-Improvement for Fast, High-Quality Plan Generation

    cs.AI 2026-05 unverdicted novelty 7.0

    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.

  2. Efficient Test-time Inference for Generative Planning Models with OCL Search

    cs.AI 2026-05 unverdicted novelty 4.0

    Modified OCL search integrates generative rollouts and learned heuristics for efficient inference in planning models across combinatorial domains.