CVaR-RMD: CVaR Selection Pressure for Robust Metaheuristic Discovery

Ruodai Cui, Li Niu


Abstract
Large language models have recently been used to discover heuristics through iterative program search, offering a promising approach to automated algorithm design. However, candidates selected by average performance may degrade across instance families, random seeds, and problem scales because mean-based objectives can obscure rare but severe failures. We propose CVaR-RMD, a risk-sensitive evolutionary framework that uses an LLM to mutate executable heuristic programs and ranks candidates by empirical conditional value-at-risk over heterogeneous evaluation conditions. Across three combinatorial optimization domains, CVaR-based selection improves upper-tail performance and reduces failure rates while maintaining competitive mean performance. These gains persist on larger unseen instances and independently curated within-domain benchmarks. Code is available https://github.com/BeyondHeaven/CVaR-RMD.
Anthology ID:
2026.findings-emnlp.687
Volume:
Findings of the Association for Computational Linguistics: EMNLP 2026
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
Findings
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
14407–14429
Language:
URL:
https://aclanthology.org/2026.findings-emnlp.687/
DOI:
10.18653/2026.findings-emnlp.687
Bibkey:
Cite (ACL):
Ruodai Cui and Li Niu. 2026. CVaR-RMD: CVaR Selection Pressure for Robust Metaheuristic Discovery. In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 14407–14429, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
CVaR-RMD: CVaR Selection Pressure for Robust Metaheuristic Discovery (Cui & Niu, Findings 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.findings-emnlp.687.pdf