The Evolution Strategies Paradox: Better Models from Worse Perturbations
Roberto Dailey, Kajetan Schweighofer, Jamieson Warner, Conor F. Hayes, Elliot Meyerson, Babak Hodjat, Risto Miikkulainen, Xin Qiu
Abstract
How is it possible for perturbation-based methods like Evolution Strategies (ES) to optimize billion-parameter large language models (LLMs)? Classical search methods are highly dependent on finding good candidates within generated populations. However, when using ES to fine-tune LLMs, a phenomenon can occur where all offspring models consistently perform worse than the parent model, yet during training, the parent model consistently improves. This paradox occurs across models, tasks, and even modalities. This paper characterizes the paradox, then examines how the local reward landscape and properties of the ES estimator contribute to it: in high-dimensional spaces, exploration leads to worse performance, yet still highlights good directions; aggregating those directions then allows for making local improvements. The result can be seen as a new optimization paradigm where a principled interaction of noise and curvature produces the paradox as a byproduct of effective optimization. These findings provide guidance for taking advantage of perturbation-based methods in LLM fine-tuning and in high-dimensional optimization in general.
Create a lesson
Related papers
OSGR: Observation-Support Graph Reasoning for Earth Observation Question Answering
Dazhou Yu, Zerong Wang, Riyang Bao et al.
Bidirectional Centered Score Matching for Discrete Diffusion Distillation
Peng Tu, Baoyou Chen, Haoyuan Xia et al.
Harness-S: Learning from Sibling Harnesses for Generalizable Agent Training
Kangning Zhang, Wenxiang Jiao, Bowen Fang et al.
Reliability Stress Testing of RAG Retrieval under Query-Relevant Corpus Poisoning
Janet Sung, Kainan Zhou, Gangzhen Qian et al.
Neologism Inoculation Prompting
David Demitri Africa, Cameron Holmes
AceAction-5M: Hierarchical Goals for Generalist Action Learning Across 3D Game Worlds
Kailing Li, Ruoxuan Zhang, Zheyuan Zhou et al.