Skip to main content
Search

# Simulated Annealing

2 related articles

Subscribe to updates
  1. arXiv

    Reasoning-model RL training stops tuning only execution: RPEG also searches pipeline structure, up to 2x faster than ReaL on 256 GH200 GPUs

    Reinforcement-learning training of reasoning language models chains generation, assessment and training across several large models each step, and existing systems usually optimize only part of that design space. RPEG places pipeline structure, including bounded asynchrony and actor–critic sharing, and execution choices such as stage fusion, fine-grained scheduling and multi-dimensional parallelism into one graph searched jointly, backed by a hardware-calibrated analytical performance model. On up to 256 GH200 GPUs its runtime is up to 2x faster end to end than ReaL, cuts step latency by up to 2.48x versus verl, and raises hardware utilization by up to 30%.

  2. arXiv

    Dynamic Adaptation of the LLM Context for Generating Routines with Coupled Semantics

    The work proposes dynamic context adaptation: a validation-generation loop in which a validation agent extracts structured diagnostic feedback from execution traces, a generation agent proposes multiple candidates per iteration, a knowledge graph supplies semantic constraints, and simulated annealing performs non-greedy selection, targeting the LLM code-generation limitation the authors call static binding; across eight problems the method outperforms zero-shot, Reflexion, and OpenEvolve on seven of eight problems at both 300 and 600 evaluations (p < 0.01), achieves the best score at 1000 evaluations on the primary motivating problem of cross-coupled optimization (0.694 vs. 0.681, p = 0.019, d = 0.52), and ablations identify structured execution feedback as the primary driver.

You’re all caught up