From Heuristic Selection to Automated Algorithm Design: LLMs Benefit from Strong Priors
cs.LG, cs.NE
Submitted: 2026-03-03
Updated: 2026-11-04
Code: https://github.com/FeiLiu36/EoH4https:
Terminology
Sources
- Discovering heuristics in a complex SAT solver with large language models
- AutoPBO: LLM-powered Optimization for Local Search PBO Solvers
- Benchmarking in Optimization: Best Practice and Open Issues
- Algorithm Evolution Using Large Language Model
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Autonomous Code Evolution Meets NP-Completeness
- Perturbed Masking: Parameter-free Probing for Analyzing and Interpreting BERT
- Sequential Integrated Gradients: a simple but effective method for explaining language models
- CodeBLEU: a Method for Automatic Evaluation of Code Synthesis
- The CMA Evolution Strategy: A Tutorial
Related papers
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis
- (Mis)generalization of Helpful-Only Fine-tuning