The Blessing of Dimensionality in LLM Fine-tuning: A Variance-Curvature Perspective
Qiyao Liang, Jinyeop Song, Yizhou Liu, Jeff Gore, Ila Fiete, Risto Miikkulainen, Xin Qiu
TL;DR
This work tackles why zeroth-order ES can fine-tune billion-parameter LLMs with small populations and why stochastic fine-tuning displays rise-then-decay under fixed noise. It introduces a variance-curvature framework in which a small set of high-curvature directions dominates improvement, and uses ES as a geometric probe with Gaussian smoothing to reveal coarse-grained landscape structure. The authors provide a tractable toy model showing how heterogeneous curvature and fixed stochasticity yield non-monotonic trajectories, and they empirically validate that improving perturbations remain accessible across model scales (0.5B–7B) with modest $N$ (around 30–40). They also formalize concepts of accessibility and degeneracy, demonstrating that population requirements do not scale with model size and that a curvature-active subspace governs improvement, suggesting broader algorithmic opportunities beyond the traditional curse-of-dimensionality mindset. Overall, the work reframes fine-tuning as a low-dimensional, geometry-driven process where diversity of improving perturbations can sustain scalable, stable optimization in high dimensions.
Abstract
Weight-perturbation evolution strategies (ES) can fine-tune billion-parameter language models with surprisingly small populations (e.g., $N\!\approx\!30$), contradicting classical zeroth-order curse-of-dimensionality intuition. We also observe a second seemingly separate phenomenon: under fixed hyperparameters, the stochastic fine-tuning reward often rises, peaks, and then degrades in both ES and GRPO. We argue that both effects reflect a shared geometric property of fine-tuning landscapes: they are low-dimensional in curvature. A small set of high-curvature dimensions dominates improvement, producing (i) heterogeneous time scales that yield rise-then-decay under fixed stochasticity, as captured by a minimal quadratic stochastic-ascent model, and (ii) degenerate improving updates, where many random perturbations share similar components along these directions. Using ES as a geometric probe on fine-tuning reward landscapes of GSM8K, ARC-C, and WinoGrande across Qwen2.5-Instruct models (0.5B--7B), we show that reward-improving perturbations remain empirically accessible with small populations across scales. Together, these results reconcile ES scalability with non-monotonic training dynamics and suggest that high-dimensional fine-tuning may admit a broader class of viable optimization methods than worst-case theory implies.
