Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.16063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916917330051072 |
|---|---|
| author | Krogmeier, Paul Madhusudan, P. |
| author_facet | Krogmeier, Paul Madhusudan, P. |
| contents | We study the problem of synthesizing domain-specific languages (DSLs) for few-shot learning in symbolic domains. Given a base language and instances of few-shot learning problems, where each instance is split into training and testing samples, the DSL synthesis problem asks for a grammar over the base language that guarantees that small expressions solving training samples also solve corresponding testing samples. We prove that the problem is decidable for a class of languages whose semantics over fixed structures can be evaluated by tree automata and when expression size corresponds to parse tree depth in the grammar, and, furthermore, the grammars solving the problem correspond to a regular set of trees. We also prove decidability results for variants of the problem where DSLs are only required to express solutions for input learning problems and where DSLs are defined using macro grammars. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_16063 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Synthesizing DSLs for Few-Shot Learning Krogmeier, Paul Madhusudan, P. Programming Languages Formal Languages and Automata Theory We study the problem of synthesizing domain-specific languages (DSLs) for few-shot learning in symbolic domains. Given a base language and instances of few-shot learning problems, where each instance is split into training and testing samples, the DSL synthesis problem asks for a grammar over the base language that guarantees that small expressions solving training samples also solve corresponding testing samples. We prove that the problem is decidable for a class of languages whose semantics over fixed structures can be evaluated by tree automata and when expression size corresponds to parse tree depth in the grammar, and, furthermore, the grammars solving the problem correspond to a regular set of trees. We also prove decidability results for variants of the problem where DSLs are only required to express solutions for input learning problems and where DSLs are defined using macro grammars. |
| title | Synthesizing DSLs for Few-Shot Learning |
| topic | Programming Languages Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2508.16063 |