Metraipolis › archive › dc_2098ade3ff18
GADAR: Generalizing Across Domains via Action Ranking for Classical Planning — arXiv:2610.34868
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.34868
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-27T07:58:19.479Z
- SHA-256 of the archived text
902ec41f468f4e1a3dad04000c7f31e1c88af3f7e9ad11013101b6317a2ec2d8- Stable URL of this page
https://metraipolis.com/documento/dc_2098ade3ff18
How to cite
GADAR: Generalizing Across Domains via Action Ranking for Classical Planning — arXiv:2610.34868 — arXiv (en), https://arxiv.org/abs/2610.34868 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2098ade3ff18 (Metraipolis archive dc_2098ade3ff18, sha256 902ec41f468f4e1a3dad04000c7f31e1c88af3f7e9ad11013101b6317a2ec2d8)
BibTeX
@misc{dc2098ade3ff18,
title = {GADAR: Generalizing Across Domains via Action Ranking for Classical Planning — arXiv:2610.34868},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.34868},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2098ade3ff18; sha256 902ec41f468f4e1a3dad04000c7f31e1c88af3f7e9ad11013101b6317a2ec2d8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.34868. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Learned policies for classical planning act without search, but each is tied to the domain it was trained on: network modules per action schema, parameters per predicate, or vocabulary-sized encodings mean a trained policy cannot even be executed on a new domain's predicates and action schemas. We present GADAR (Generalizing Across Domains via Action Ranking), a policy that takes the domain description as input, {\pi}(s, G, D), and constructs grounded actions in domains never seen in training, without search. Symbols are described by the roles they play in the domain rather than by their names, in three layers that each extend the previous one: (i) a lifted domain layer embeds D in every state graph through structural signatures; (ii) a binding layer ties each ground action's applicability to the lifted preconditions it instantiates; and (iii) a chain layer states which schema produces what another needs and how far each schema stands from the goal. The same network therefore runs on every domain, seen or unseen. We evaluate zero-shot generalization leave-one-domain-out over eight benchmark domains. A single GADAR policy trained on seven domains solves 58.3% of their test instances, one point below the 59.3% of dedicated single-domain GADAR models, so one policy serves many domains at no cost in coverage; a multi-task control that keeps symbol identity in its weights, while strong on some of the domains it trains on, transfers to none of the held-out ones. Zero-shot, GADAR executes on every held-out domain and exceeds random choice under the same executor on the large test instances of all eight: it solves 22.6% of them on average, against 3.3% for random choice and 0.6% for the same representation without the chain layer, and reaches 68% on held-out Visitall. Zero-shot coverage nonetheless remains well below in-domain coverage on most domains, and we analyze where it is weakest.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.34868 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-27T07:55:30.721Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).