acceptodds
Under review as a conference paper at ICLR 2027

Does Random Search Discover Task Experts? Revisiting Neural Thickets

Abstract

Pretrained models are typically viewed as generalists, requiring bespoke post-training to achieve task-specific expertise. Gan & Isola (2026) recently proposed a striking alternative: that pretrained models lie in a dense “neural thicket” of task specialists, which can be surfaced with simple Gaussian weight perturbations. We examine this neural thicket of task-specific experts and identify several key findings. First, we find that the apparent lift of the best-of- selected perturbation decays quickly with the size of the selection set, strongly suggesting overfitting to the selection questions. In fact, for of the model–task pairs we study, a simple null model of pure selection noise predicts more than of the top expert's reward lift above the perturbation-population mean. Second, the top experts' advantage often vanishes on held-out questions, or remains within the run-to-run variability of the unperturbed "anchor" model. Third, we find that majority voting over the top- selected perturbations—coined RandOpt() by Gan & Isola (2026)—is often matched or outperformed by majority voting over samples from the base model. Overall, our results suggest that random weight perturbations may be ineffective at uncovering task experts around pretrained models, and that adapting pre-trained models to downstream tasks may require more sophistication than random search.

open until 14 Dec 2026

est. 32% chance this paper gets accepted at ICLR 2027.

Reject 68%Accept 32%

What do you think this paper will get?

All positions stay anonymous.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.