mlsanityData to 14 Oct 2026

Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior

arXiv 2505.00439 ↗First posted 1 May 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Recent work has shown that successful per-domain generalizing action policies can be learned. Scaling behavior, from small training instances to large test instances, is the key objective; and the use of validation instances larger than training instances is one key to achieve it. Prior work has used fixed validation sets. Here, we introduce a method generating the validation set dynamically, on the fly, increasing instance size so long as informative and feasible.We also introduce refined methodology for evaluating scaling behavior, generating test instances systematically to guarantee a given confidence in coverage performance for each instance size. In experiments, dynamic validation improves scaling behavior of GNN policies in all 9 domains used.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 7 of its 16 references that are in the map. First posted on arXiv 1 May 2025.

Builds on

7 of 16 references.

References · 7

  1. 2019ASNets: Deep Learning for Generalised Planningcited by 42
  2. 2017Learning Generalized Reactive Policies using Deep Neural Networkscited by 39
  3. 2021Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limitscited by 38
  4. 2020Generalized Planning With Deep Reinforcement Learningcited by 35
  5. 2017Action Schema Networks: Generalised Policies with Deep Learningcited by 32
  6. 2022Learning Generalized Policies Without Supervision Using GNNscited by 22
  7. 2019Size Independent Neural Transfer for RDDL Planningcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.