Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.14162 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908410589478912 |
|---|---|
| author | Rajabpour, Amirhossein Aghakasiri, Kiarash Zilles, Sandra Lelis, Levi H. S. |
| author_facet | Rajabpour, Amirhossein Aghakasiri, Kiarash Zilles, Sandra Lelis, Levi H. S. |
| contents | Algorithms for learning programmatic representations for sequential decision-making problems are often evaluated on out-of-distribution (OOD) problems, with the common conclusion that programmatic policies generalize better than neural policies on OOD problems. In this position paper, we argue that commonly used benchmarks undervalue the generalization capabilities of programmatic representations. We analyze the experiments of four papers from the literature and show that neural policies, which were shown not to generalize, can generalize as effectively as programmatic policies on OOD problems. This is achieved with simple changes in the neural policies training pipeline. Namely, we show that simpler neural architectures with the same type of sparse observation used with programmatic policies can help attain OOD generalization. Another modification we have shown to be effective is the use of reward functions that allow for safer policies (e.g., agents that drive slowly can generalize better). Also, we argue for creating benchmark problems highlighting concepts needed for OOD generalization that may challenge neural policies but align with programmatic representations, such as tasks requiring algorithmic constructs like stacks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_14162 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Common Benchmarks Undervalue the Generalization Power of Programmatic Policies Rajabpour, Amirhossein Aghakasiri, Kiarash Zilles, Sandra Lelis, Levi H. S. Machine Learning Algorithms for learning programmatic representations for sequential decision-making problems are often evaluated on out-of-distribution (OOD) problems, with the common conclusion that programmatic policies generalize better than neural policies on OOD problems. In this position paper, we argue that commonly used benchmarks undervalue the generalization capabilities of programmatic representations. We analyze the experiments of four papers from the literature and show that neural policies, which were shown not to generalize, can generalize as effectively as programmatic policies on OOD problems. This is achieved with simple changes in the neural policies training pipeline. Namely, we show that simpler neural architectures with the same type of sparse observation used with programmatic policies can help attain OOD generalization. Another modification we have shown to be effective is the use of reward functions that allow for safer policies (e.g., agents that drive slowly can generalize better). Also, we argue for creating benchmark problems highlighting concepts needed for OOD generalization that may challenge neural policies but align with programmatic representations, such as tasks requiring algorithmic constructs like stacks. |
| title | Common Benchmarks Undervalue the Generalization Power of Programmatic Policies |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2506.14162 |