arXiv Computation and Language By Shanglin Yang, Zhan Shi

Lineage Is Memory: Parent Inheritance and Feedback Disclosure in Short-Budget LLM-Guided Optimization

Read the original on arXiv Computation and Language →

The paper investigates how iterative language‑model optimizers improve prompts and programs by evaluating candidates, exposing failing cases to a proposer model, and retaining revisions that enhance performance. By conducting 1,750 pre‑registered experiments across nine benchmarks, the authors disentangle the effects of parent inheritance (keeping a surviving parent) from feedback disclosure (providing failure summaries) under equal computational budgets. They find that greedy parent inheritance alone drives most optimization gains, outperforming seed‑reset strategies even when the latter receive comprehensive failure summaries or larger proposer models, and that the cost of proposer reflection is minimal compared to validation and minibatch gating.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 11

Janus: An Algorithm-Evaluator Co-Evolution Framework for LLM-Driven Discovery under Expensive Evaluation Budgets

arXiv:2608. 08189v1 Announce Type: new Abstract: LLM-driven program discovery relies on rapid evaluator feedback, but many scientific and engineering tasks require high-fidelity simulations, hardware execution, or physical experiments, making each evaluation expensive.

By Ximeng Liu, Qianlong Wang, Yingming Mao, Annan Li, Yatao Li, Shizhen Zhao, Jianmin Wu, Dawei Yin, Dou Shen
arXiv Computation and Language
Oct 21

Explore More, Validate Less: Efficient Reflective Prompt Optimization

The paper introduces a two‑stage framework for reflective prompt optimization that separates candidate generation from validation. In the construction stage, multiple parents are sampled and their training responses reused across parallel reflection branches, with each revision screened on a small minibatch to allow locally improved candidates to propagate without full validation. In the exploration stage, a fixed full‑validation budget is used to select the best prompt from a frozen candidate pool, enabling independent control of pool size and validation effort. Experiments on five benchmarks with Qwen3.5‑9B and Llama‑3.1‑8B‑Instruct show that retaining 100 candidates and performing 20 full validations can improve performance by up to 11.22 percentage points over the initial solver, and learned selection consistently outperforms the initial solver across all comparisons.

By Xiaofan Zhou, Lu Cheng