mlsanityData to 7 Oct 2026

From Search to Signal: Online Post-Training in Automatic Heuristic Design

arXiv 2609.39383 ↗First posted 30 Sep 2026cs.LG cs.AI cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

Large language model (LLM)-based automatic heuristic design (AHD) iteratively proposes and refines heuristics, pairing design rationales with executable code. Task-specific evaluators assess programs; execution outcomes and performance scores guide search. Many AHD systems keep the generator frozen; EvoTune and Co-Evolution of Algorithms and Language Model (CALM) instead update it from evaluated candidates. When such outcomes drive reinforcement learning with verifiable rewards (RLVR), they create a search-coupled loop: the evaluated candidate stream supplies both search-state updates and training signals for the model that generates future candidates. Yet validity and performance do not uniquely determine useful model updates; converting them into learning signals must account for the prompt and evolving search state that produced each candidate. We formulate online post-training of small open-weight LLMs in AHD as context-dependent signal construction and develop alternative mappings from program validity, task performance, and generation context to update signals. Using shared evaluated rollouts and matched update budgets, controlled experiments across AHD tasks and model families compare these mappings with online post-training baselines, testing their effects on validity, performance among valid proposals, and the yield of valid proposals that improve under contextual comparisons. Complementary checkpoint, frozen-search, and live-system evaluations assess whether proposal-level gains appear in updated checkpoint behavior and subsequent search, rather than arising solely from accumulated search state. A resource-matched comparison under pre-specified cost accounting tests whether online updating adds value beyond additional search with a frozen generator. Together, this design avoids treating end-to-end search gains alone as evidence of stronger heuristic-design capabilities.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 27 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

18 of 27 references.

References · 18

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  4. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 763
  5. 2023Reinforced Self-Training (ReST) for Language Modelingcited by 486
  6. 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 266
  7. 2026GDPO: Group reward-Decoupled Normalization Policy Optimization for Multi-reward RL Optimizationcited by 175
  8. 2023RLTF: Reinforcement Learning from Unit Test Feedbackcited by 110
  9. 2026Learning to Discover at Test Timecited by 94
  10. 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 92
  11. 2025ThetaEvolve: Test-time Learning on Open Problemscited by 52
  12. 2025Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learningcited by 39
6 more
  1. 2025CALM: Co-evolution of Algorithms and Language Model for Automatic Heuristic Designcited by 28
  2. 2025HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challengescited by 19
  3. 2025Fine-tuning Large Language Model for Automated Algorithm Designcited by 6
  4. 2026Evolution Fine-Tuning: Learning to Discover Across 371 Optimization Taskscited by 4
  5. 2026PACEvolve++: Improving Test-time Learning for Evolutionary Search Agentscited by 3
  6. 2026AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Designcited by 3

Built on by

Not cited yet.