Random Cloud: Finding Minimal Neural Architectures Without Training
Not on the map. Why?
Abstract (arXiv)
I propose the Random Cloud method, a training-free approach to neural architecture search that discovers minimal feedforward network topologies through stochastic exploration and progressive structural reduction. Unlike post-training pruning methods that require a full train-prune-retrain cycle, this method evaluates randomly initialized networks without backpropagation, progressively reduces their topology, and only trains the best minimal candidate at the end. I evaluate on 7 classification benchmarks against magnitude pruning and random pruning baselines. The Random Cloud matches or outperforms both baselines in 6 of 7 datasets, achieving statistically significant improvements on Sonar (+4.9pp accuracy, p=0.017 vs magnitude pruning) with 87% parameter reduction. Crucially, the method is faster than both pruning baselines in 4 of 5 datasets (0.67--0.94× the cost of full training), since it avoids training the full-size network entirely.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 9 references that are in the map. First posted on arXiv 29 Apr 2026.
Builds on
8 of 9 references.
References · 8
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2020Neural Architecture Search without Trainingcited by 241
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
Built on by
Not cited yet.