mlsanityData to 14 Oct 2026

LLM-Meta-SR: In-Context Learning for Evolving Selection Operators in Symbolic Regression

arXiv 2505.18602 ↗First posted 24 May 2025cs.NE cs.AI cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have revolutionized algorithm development, yet their application in symbolic regression, where algorithms automatically discover symbolic expressions from data, remains limited. In this paper, we propose a meta-learning framework that enables LLMs to automatically design selection operators for evolutionary symbolic regression algorithms. We first identify two key limitations in existing LLM-based algorithm evolution techniques: lack of semantic guidance and code bloat. The absence of semantic awareness can lead to ineffective exchange of useful code components, while bloat results in unnecessarily complex components; both can hinder evolutionary learning progress or reduce the interpretability of the designed algorithm. To address these issues, we enhance the LLM-based evolution framework for meta-symbolic regression with two key innovations: a complementary, semantics-aware selection operator and bloat control. Additionally, we embed domain knowledge into the prompt, enabling the LLM to generate more effective and contextually relevant selection operators. Our experimental results on symbolic regression benchmarks show that LLMs can devise selection operators that outperform nine expert-designed baselines, achieving state-of-the-art performance. Moreover, the evolved operator can further improve a state-of-the-art symbolic regression algorithm, achieving the best performance among 28 symbolic regression and other machine learning algorithms across 116 regression datasets. This demonstrates that LLMs can exceed expert-level algorithm design for symbolic regression.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 33 of its 74 references that are in the map. First posted on arXiv 24 May 2025.

Builds on

33 of 74 references.

References · 33

  1. 2020CodeBLEU: a Method for Automatic Evaluation of Code Synthesiscited by 479
  2. 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
  3. 2021Contemporary Symbolic Regression Methods and their Relative Performancecited by 215
  4. 2022End-to-end symbolic regression with transformerscited by 203
  5. 2021Neural Symbolic Regression that Scalescited by 192
  6. 2020AutoML-Zero: Evolving Machine Learning Algorithms From Scratchcited by 143
  7. 2023Large Language Models as Evolutionary Optimizerscited by 124
  8. 2023Language Model Crossover: Variation through Few-Shot Promptingcited by 122
  9. 2024LLMOPT: Learning to Define and Solve General Optimization Problems from Scratchcited by 102
  10. 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 97
  11. 2024Symbolic Regression with a Learned Concept Librarycited by 83
  12. 2023Transformer-based Planning for Symbolic Regressioncited by 79
21 more
  1. 2024HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMscited by 73
  2. 2025Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learningcited by 46
  3. 2018Learning concise representations for regression by evolving networks of treescited by 33
  4. 2024Evolutionary Large Language Model for Automated Feature Transformationcited by 29
  5. 2025CALM: Co-evolution of Algorithms and Language Model for Automatic Heuristic Designcited by 29
  6. 2021Shape-constrained Symbolic Regression -- Improving Extrapolation with Prior Knowledgecited by 27
  7. 2024AlphaForge: A Framework to Mine and Dynamically Combine Formulaic Alpha Factorscited by 27
  8. 2024Symbol: Generating Flexible Black-Box Optimizers through Symbolic Equation Learningcited by 22
  9. 2024Customizing Language Model Responses with Contrastive In-Context Learningcited by 19
  10. 2024Symbolic regression via MDLformer-guided search: from minimizing prediction error to minimizing description lengthcited by 17
  11. 2021Automated Configuration of Genetic Algorithms by Tuning for Anytime Performancecited by 9
  12. 2023Symbolic Cognitive Diagnosis via Hybrid Optimization for Intelligent Education Systemscited by 7
  13. 2025Decision Tree Induction Through LLMs via Semantically-Aware Evolutioncited by 6
  14. 2023Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solvingcited by 5
  15. 2024QUBE: Enhancing Automatic Heuristic Design via Quality-Uncertainty Balanced Evolutioncited by 5
  16. 2023Racing Control Variable Genetic Programming for Symbolic Regressioncited by 4
  17. 2018Solving the Exponential Growth of Symbolic Regression Trees in Geometric Semantic Genetic Programmingcited by 3
  18. 2021Evolving Continuous Optimisers from Scratchcited by 3
  19. 2024DALex: Lexicase-like Selection via Diverse Aggregationcited by 3
  20. 2025From Understanding to Excelling: Template-Free Algorithm Design through Structural-Functional Co-Evolutioncited by 2
  21. 2024Minimum variance threshold for epsilon-lexicase selectioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 6.

6 papers.