{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T01:25:44Z","timestamp":1787621144374,"version":"build-2736575974"},"reference-count":39,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f1481","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"47-57","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing the Optimizer: An Example Showing the Power of LLM Code Generation"],"prefix":"10.15439","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8543-9893","authenticated-orcid":true,"given":"Camilo Chac\u00f3n","family":"Sartori","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1736-3559","authenticated-orcid":true,"given":"Christian","family":"Blum","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA-CSIC) Campus UAB, Bellaterra, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","unstructured":"C. Blum. Construct, Merge, Solve & Adapt: A Hybrid\nMetaheuristic for Combinatorial Optimization. Computational Intelligence Methods and Applications. Springer\nNature Switzerland, 2024. ISBN 9783031601026. URL\nhttps:\/\/books.google.es\/books?id=ENCt0AEACAAJ.","DOI":"10.1007\/978-3-031-60103-3"},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"C. Blum, J. Puchinger, G. R. Raidl, and A. Roli. Hybrid\nmetaheuristics in combinatorial optimization: A survey.\nApplied Soft Computing, 11(6):4135\u20134151, 2011. ISSN\n1568-4946. https:\/\/doi.org\/10.1016\/j.asoc.2011.02.032. URL https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494611000962.","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"C. Blum, P. Pinacho, M. L\u00f3pez-Ib\u00e1\u00f1ez, and J. A.\nLozano. Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Computers & Operations Research, 68:75\u201388, 2016. ISSN\n0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2015.10.014. URL https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054815002452.","DOI":"10.1016\/j.cor.2015.10.014"},{"key":"ref4","unstructured":"C. Chac\u00f3n Sartori. Architectures of error: A philosophical inquiry into ai-generated and human-generated code,\nMay 2025.\n URL https:\/\/ssrn.com\/abstract=5265751.\nAvailable at SSRN."},{"key":"ref5","unstructured":"A. Chen, J. Scheurer, T. Korbak, J. A. Campos, J. S.\nChan, S. R. Bowman, K. Cho, and E. Perez. Improving\ncode generation by training with natural language feedback. arXiv [cs.SE], Mar. 2023."},{"key":"ref6","unstructured":"L. Chen, Q. Guo, H. Jia, Z. Zeng, X. Wang, Y. Xu,\nJ. Wu, Y. Wang, Q. Gao, J. Wang, W. Ye, and S. Zhang.\nA survey on evaluating large language models in code\ngeneration tasks, 2024. URL https:\/\/arxiv.org\/abs\/2408.16498."},{"key":"ref7","unstructured":"M. Chen and et al. Evaluating large language models\ntrained on code, 2021. URL https:\/\/arxiv.org\/abs\/2107.03374."},{"key":"ref8","unstructured":"W. Chen, J. Zhu, Q. Fan, Y. Ma, and A. Zou. Cuda-llm: Llms can write efficient cuda kernels, 2025. URL\nhttps:\/\/arxiv.org\/abs\/2506.09092."},{"key":"ref9","unstructured":"W.-L. Chiang, L. Zheng, Y. Sheng, A. N. Angelopoulos,\nT. Li, D. Li, H. Zhang, B. Zhu, M. Jordan, J. E.\nGonzalez, and I. Stoica. Chatbot arena: An open platform\nfor evaluating llms by human preference, 2024. URL\nhttps:\/\/arxiv.org\/abs\/2403.04132."},{"key":"ref10","unstructured":"C. Cummins, V. Seeker, D. Grubisic, M. Elhoushi,\nY. Liang, B. Roziere, J. Gehring, F. Gloeckle, K. Hazelwood, G. Synnaeve, and H. Leather. Large language\nmodels for compiler optimization. arXiv [cs.PL], Sept.\n2023."},{"key":"ref11","unstructured":"DeepSeek-AI et al. Deepseek-v3 technical report, 2024.\nURL https:\/\/arxiv.org\/abs\/2412.19437."},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"Q. Dong, L. Li, D. Dai, C. Zheng, J. Ma, R. Li, H. Xia,\nJ. Xu, Z. Wu, T. Liu, B. Chang, X. Sun, L. Li, and\nZ. Sui. A survey on in-context learning, 2024. URL\nhttps:\/\/arxiv.org\/abs\/2301.00234.","DOI":"10.18653\/v1\/2024.emnlp-main.64"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"E. Hemberg, S. Moskal, and U.-M. O\u2019Reilly. Evolving\ncode with a large language model, 2024. URL https:\/\/arxiv.org\/abs\/2401.07102.","DOI":"10.1007\/s10710-024-09494-2"},{"key":"ref14","unstructured":"J. Jiang, F. Wang, J. Shen, S. Kim, and S. Kim. A survey\non large language models for code generation. arXiv\n[cs.CL], June 2024."},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"X. Jiang, Y. Dong, L. Wang, Z. Fang, Q. Shang, G. Li,\nZ. Jin, and W. Jiao. Self-planning code generation\nwith large language models. ACM Trans. Softw. Eng.\nMethodol., 33(7):1\u201330, Sept. 2024.","DOI":"10.1145\/3672456"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"S. Joel, J. J. Wu, and F. H. Fard. A survey on llm-based\ncode generation for low-resource and domain-specific\nprogramming languages, 2024. URL https:\/\/arxiv.org\/abs\/2410.03981.","DOI":"10.1145\/3770084"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"S. Joel, J. J. W. Wu, and F. H. Fard. A survey on LLM-based code generation for low-resource and domainspecific programming languages. arXiv [cs.SE], Oct.\n2024.","DOI":"10.1145\/3770084"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"U. Kamath, K. Keenan, G. Somers, and S. Sorenson.\nLarge Language Models: A Deep Dive: Bridging Theory\nand Practice. Springer Nature Switzerland, 2024. ISBN\n9783031656477. URL https:\/\/books.google.es\/books?id=kDobEQAAQBAJ.","DOI":"10.1007\/978-3-031-65647-7"},{"key":"ref19","unstructured":"M.-A. Lachaux, B. Roziere, L. Chanussot, and G. Lample. Unsupervised translation of programming languages.\narXiv [cs.CL], June 2020."},{"key":"ref20","unstructured":"J. Li, G. Li, C. Tao, J. Li, H. Zhang, F. Liu, and Z. Jin.\nLarge language model-aware in-context learning for code\ngeneration. arXiv [cs.SE], Oct. 2023."},{"key":"ref21","unstructured":"F. Liu, R. Zhang, Z. Xie, R. Sun, K. Li, X. Lin, Z. Wang,\nZ. Lu, and Q. Zhang. Llm4ad: A platform for algorithm\ndesign with large language model, 2024. URL https:\/\/arxiv.org\/abs\/2412.17287."},{"key":"ref22","doi-asserted-by":"publisher","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez, J. Dubois-Lacoste, L. P\u00e9rez C\u00e1ceres,\nT. St\u00fctzle, and M. Birattari. The irace package: Iterated\nracing for automatic algorithm configuration. Operations\nResearch Perspectives, 3:43\u201358, 2016. https:\/\/dx.doi.org\/10.1016\/j.orp.2016.09.002.","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref23","unstructured":"S. Mirchandani, F. Xia, P. Florence, B. Ichter, D. Driess,\nM. G. Arenas, K. Rao, D. Sadigh, and A. Zeng. Large\nlanguage models as general pattern machines, 2023. URL\nhttps:\/\/arxiv.org\/abs\/2307.04721."},{"key":"ref24","unstructured":"OpenAI et al. Gpt-4 technical report, 2024. URL https:\/\/arxiv.org\/abs\/2303.08774."},{"key":"ref25","doi-asserted-by":"crossref","unstructured":"R. Pan, A. R. Ibrahimzada, R. Krishna, D. Sankar, L. P.\nWassi, M. Merler, B. Sobolev, R. Pavuluri, S. Sinha, and\nR. Jabbarvand. Lost in translation: A study of bugs\nintroduced by large language models while translating\ncode. arXiv [cs.SE], Aug. 2023.","DOI":"10.1145\/3597503.3639226"},{"key":"ref26","doi-asserted-by":"publisher","unstructured":"M. Pluhacek, A. Kazikova, T. Kadavy, A. Viktorin,\nand R. Senkerik. Leveraging large language models\nfor the generation of novel metaheuristic optimization\nalgorithms. In Proceedings of the Companion Conference\non Genetic and Evolutionary Computation, GECCO \u201923\nCompanion, page 1812\u20131820, New York, NY, USA,\n2023. Association for Computing Machinery. ISBN\n9798400701207. https:\/\/dx.doi.org\/10.1145\/3583133.3596401. URL\nhttps:\/\/doi.org\/10.1145\/3583133.3596401.","DOI":"10.1145\/3583133.3596401"},{"key":"ref27","doi-asserted-by":"crossref","unstructured":"B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. R. Ruiz, J. S.\nEllenberg, P. Wang, O. Fawzi, P. Kohli, A. Fawzi,\nJ. Grochow, A. Lodi, J.-B. Mouret, T. Ringer, and T. Yu.\nMathematical discoveries from program search with large\nlanguage models. Nature, 625:468 \u2013 475, 2023. URL\nhttps:\/\/api.semanticscholar.org\/CorpusID:266223700.","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref28","doi-asserted-by":"publisher","unstructured":"C. C. Sartori, C. Blum, F. Bistaffa, and G. Rodr\u00edguez Corominas. Metaheuristics and large language\nmodels join forces: Toward an integrated optimization\napproach. IEEE Access, 13:2058\u20132079, 2025. https:\/\/dx.doi.org\/10.1109\/ACCESS.2024.3524176.","DOI":"10.1109\/ACCESS.2024.3524176"},{"key":"ref29","doi-asserted-by":"crossref","unstructured":"K. Sim, Q. Renau, and E. Hart. Beyond the hype:\nBenchmarking llm-evolved heuristics for bin packing,\n2025. URL https:\/\/arxiv.org\/abs\/2501.11411.","DOI":"10.1007\/978-3-031-90065-5_24"},{"key":"ref30","doi-asserted-by":"publisher","unstructured":"N. v. Stein and T. B\u00e4ck. LLaMEA: A large language\nmodel evolutionary algorithm for automatically generating metaheuristics. IEEE Transactions on Evolutionary\nComputation, 29(2):331\u2013345, 2025. https:\/\/dx.doi.org\/10.1109\/TEVC.2024.3497793.","DOI":"10.1109\/TEVC.2024.3497793"},{"key":"ref31","unstructured":"A. Team.\n Introducing Claude 3.5 Sonnet \u2014\nanthropic.com.\n https:\/\/www.anthropic.com\/news\/claude-3-5-sonnet, 2024. [Accessed 02-11-2024]."},{"key":"ref32","unstructured":"G. Team and et al. Gemini 1.5: Unlocking multimodal\nunderstanding across millions of tokens of context, 2024.\nURL https:\/\/arxiv.org\/abs\/2403.05530."},{"key":"ref33","unstructured":"M. Team. The llama 3 herd of models, 2024. URL\nhttps:\/\/arxiv.org\/abs\/2407.21783."},{"key":"ref34","doi-asserted-by":"publisher","unstructured":"H. Wang, T. Fu, Y. Du, W. Gao, K. Huang, Z. Liu,\nP. Chandak, S. Liu, P. Katwyk, A. Deac, A. Anandkumar,\nK. Bergen, C. P. Gomes, and Shir. Scientific discovery in\nthe age of artificial intelligence. Nature, 620(7972):47\u201360, August 2023. https:\/\/dx.doi.org\/10.1038\/s41586-023-06221-2. URL\nhttps:\/\/ideas.repec.org\/a\/nat\/nature\/v620y2023i7972d10.1038_s41586-023-06221-2.html.","DOI":"10.1038\/s41586-023-06221-2"},{"key":"ref35","unstructured":"Y. Wen, P. Yin, K. Shi, H. Michalewski, S. Chaudhuri,\nand A. Polozov. Grounding data science code generation\nwith input-output specifications, 2024. URL https:\/\/arxiv.org\/abs\/2402.08073."},{"key":"ref36","doi-asserted-by":"publisher","unstructured":"D. Wolpert and W. Macready. No free lunch theorems for\noptimization. IEEE Transactions on Evolutionary Computation, 1(1):67\u201382, 1997. https:\/\/dx.doi.org\/10.1109\/4235.585893.","DOI":"10.1109\/4235.585893"},{"key":"ref37","doi-asserted-by":"crossref","unstructured":"S. Xiao, Y. Chen, J. Li, L. Chen, L. Sun, and T. Zhou.\nPrototype2code: End-to-end front-end code generation\nfrom ui design prototypes, 2024. URL https:\/\/arxiv.org\/abs\/2405.04975.","DOI":"10.1115\/DETC2024-143139"},{"key":"ref38","doi-asserted-by":"crossref","unstructured":"D. Zan, B. Chen, F. Zhang, D. Lu, B. Wu, B. Guan,\nY. Wang, and J.-G. Lou. Large language models meet\nNL2Code: A survey, 2023. URL https:\/\/arxiv.org\/abs\/2212.09420.","DOI":"10.18653\/v1\/2023.acl-long.411"},{"key":"ref39","unstructured":"Y. Zhou, A. I. Muresanu, Z. Han, K. Paster, S. Pitis,\nH. Chan, and J. Ba. Large language models are human-level prompt engineers, 2023. URL https:\/\/arxiv.org\/abs\/2211.01910."}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:59Z","timestamp":1761119099000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/1481.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":39,"URL":"https:\/\/doi.org\/10.15439\/2025f1481","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}