Metraipolis › archive › dc_8698a38be124
Semantic Synthesis over Brute-Force Search: LLM-Guided Transformation Design for Efficient Learning — arXiv:2611.10940
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.10940
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-10T18:42:56.252Z
- SHA-256 of the archived text
f3bc432a4e5da284457fa694b14d61523a22bc46418d1db719cb8615f7e046c0- Stable URL of this page
https://metraipolis.com/documento/dc_8698a38be124
How to cite
Semantic Synthesis over Brute-Force Search: LLM-Guided Transformation Design for Efficient Learning — arXiv:2611.10940 — arXiv (en), https://arxiv.org/abs/2611.10940 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8698a38be124 (Metraipolis archive dc_8698a38be124, sha256 f3bc432a4e5da284457fa694b14d61523a22bc46418d1db719cb8615f7e046c0)
BibTeX
@misc{dc8698a38be124,
title = {Semantic Synthesis over Brute-Force Search: LLM-Guided Transformation Design for Efficient Learning — arXiv:2611.10940},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.10940},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8698a38be124; sha256 f3bc432a4e5da284457fa694b14d61523a22bc46418d1db719cb8615f7e046c0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.10940. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Data transformation pipelines shape the training distribution in computer vision, but designing them is a computationally expensive problem. We investigate whether large language models can enable efficient discovery by synthesizing executable transformation programs outside predefined augmentation spaces. We compare nine strategies under a unified training protocol, including standard augmentation policies, brute-force search, direct code generation with two LLMs, and performance-guided generation using LLMs fine-tuned on accuracy-ordered transformation pairs. When the best candidates are retrained for 20 epochs, LLM-generated transformation programs lead on every dataset, reaching 0.8877 accuracy on CIFAR-10, 0.5825 on CIFAR-100, and 0.9588 on SVHN, surpassing brute-force search over 6,000 candidates. The best transform on CIFAR-10 and SVHN comes from a fine-tuned generator using 270 candidates, while the best on CIFAR-100 comes from an off-the-shelf generator using only 10. This needs 22x fewer candidate evaluations in the generation step and 600x fewer for off-the-shelf generations, relative to brute-force search. Beyond transformation discovery, we analyze the reliability of the reduced-budget evaluation commonly used for augmentation search. Correlating one-epoch selection scores with 20-epoch outcomes reveals strong, weak, and absent predictive relationships depending on the dataset and architecture, with correlations ranging from 0.756 to near zero. A positive control indicates that range restriction alone is unlikely to explain the low correlations. Our results indicate that semantic synthesis with code LLMs provides an efficient alternative to search-based transformation discovery and highlight the importance of validating evaluation fidelity when optimizing data transformations. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2611.10940 — 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-11-10T18:37:37.615Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).