I worked on this collaborative study through the Neuromatch Impact Scholars Program, where we investigated whether connectivity patterns inspired by biological neural circuits could help a small reinforcement-learning model perform as well as larger networks.
Authors: Muratore, P., Moradimanesh, Z., Shaikh, R.A., Zargarnezhad, N., Meek, A., Kuzovkin, I.
Affiliation: Neuromatch Academy, Neuromatch, Inc., USA
This page is a portfolio account of our shared work; the original report is available on Zenodo.
The problem we studied
- Larger neural networks can improve performance, but they also increase computational requirements, so we wanted to examine whether choosing a useful connectivity pattern could reduce the number of trainable parameters needed for a task.
- We used Neural Circuit Architectural Priors (NCAP), whose controller is based on neural circuits from C. elegans, and compared it with multilayer perceptrons (MLPs) trained from scratch or through knowledge distillation.
- The task was swimming in MuJoCo, controlling six joints across five links without a designated target. NCAP uses only four trainable parameters, while a naive MLP in our experiments needed at least 100 parameters to achieve comparable performance.
How we designed the comparison
We ran 250 experimental trials with randomly generated MLP architectures, so we could examine connectivity alongside parameter count rather than comparing NCAP with only one alternative network.
| Design choice | Range or method |
|---|---|
| Network depth | 1 to 4 layers |
| Layer width | 1 to 64 neurons per layer |
| Sparsity coefficient | 0 to 1, with zero indicating a fully connected layer |
| Architecture sampling | Depth, width, and sparsity sampled uniformly over the chosen ranges |
| Training from scratch | Proximal Policy Optimization (PPO) |
| Knowledge distillation | Supervised learning from a high-reward teacher’s actions |
- For training from scratch, we used PPO because its stability and relative insensitivity to hyperparameters helped us concentrate on architectural differences. SAC and DDPG were alternatives, but sensitivity to training instability in sparse or noisy reward settings was a concern in our setup.
- For distillation, we ran the highest-reward model from previous runs as a teacher, recorded its observations and actions, and trained each student to predict those actions with a mean squared error loss before evaluating the student in the environment.
- We recorded maximum reward and reward standard deviation, ranked models by parameter count, and bootstrapped the maximum-reward distributions with 1000 samples per model, using NCAP’s Z-score within those distributions for comparison.
What the experiments showed

The figure compares the reward achieved by each model with its parameter count, while separating the four network depths, so we can see whether a larger model consistently produces a better controller.
- NCAP achieved comparable performance with substantially fewer parameters, placing within the top 1% among models with up to 39 parameters (p < 0.01), the top 5% with up to 45 parameters (p < 0.05), and the top 10% with up to 74 parameters (p < 0.1). It remained within the top 31% of all evaluated models.
- Some smaller, better-connected MLPs outperformed networks that were orders of magnitude larger but poorly connected, which showed why parameter count alone was insufficient to explain the results.
- As depth increased from one to four layers, the minimum number of parameters needed to reach maximal reward also increased, suggesting that greater depth made this particular task harder to learn.
- Distillation helped models reach good performance within the available training budget of 5 million iterations for training and 2.5 million for distillation. At depth four, only distilled networks reached maximum performance, apart from one model trained from scratch whose reward was close to 1000.
Interpreting the result
The comparison supports using task-relevant connectivity priors when designing small controllers, because networks with similar parameter counts could perform differently depending on how they were connected. However, this was a swimming-task study, so it does not establish that a smaller or biologically inspired network will be better in every setting.
- Learning-rate schedules, initialisation, and random-seed effects remain relevant to the robustness of the comparison, even though the study controlled these factors.
- NCAP remained distinct from the randomly sampled configurations, so the experiments did not show that pruning or distillation alone reproduced its efficiency.
- The useful next question is how much of this advantage transfers to other control tasks and architectures, rather than treating the result as a general argument against larger networks.
Tools and methods
| Area | Tools and methods |
|---|---|
| Simulation | MuJoCo swimming environment |
| Architectures | NCAP, randomly configured MLPs, sparse connectivity |
| Training | PPO, pruning, knowledge distillation, MSE loss |
| Evaluation | Parameter-count comparisons, maximum reward, reward variability, bootstrapping, Z-scores |
Acknowledgements
The Impact Scholars Program supported this work, which originated in the Neuromatch Academy NeuroAI course in July 2024. Kaitlyn Hoesterey and Ravikrishnan Jayakumar were members of the original team and contributed to its initial conceptualisation.
References
Bhattasali, N. X., Zador, A. M., & Engel, T. A. (2022). Neural circuit architectural priors for embodied control. arXiv. https://doi.org/10.48550/arXiv.2201.05242
Bhattasali, N. X., Pattabiraman, V., Pinto, L., & Lindsay, G. W. (2024). Neural circuit architectural priors for quadruped locomotion. arXiv. https://doi.org/10.48550/arXiv.2410.07174
Elsken, T., Metzen, J. H., & Hutter, F. (2019). Neural architecture search: A survey. Journal of Machine Learning Research, 20(55), 1–21.
Friston, K. (2008). Hierarchical models in the brain. PLoS Computational Biology, 4(11), e1000211. https://doi.org/10.1371/journal.pcbi.1000211
Garwicz, M., Christensson, M., & Psouni, E. (2009). A unifying model for timing of walking onset in humans and other mammals. Proceedings of the National Academy of Sciences, 106(51), 21889–21893. https://doi.org/10.1073/pnas.0905777106
Gou, J., Yu, B., Maybank, S. J., & Tao, D. (2021). Knowledge distillation: A survey. International Journal of Computer Vision, 129(6), 1789–1819. https://doi.org/10.1007/s11263-021-01453-z
Kaplan, J., McCandlish, S., Henighan, T., Brown, T. B., Chess, B., Child, R., Gray, S., Radford, A., Wu, J., & Amodei, D. (2020). Scaling laws for neural language models. arXiv. https://doi.org/10.48550/arXiv.2001.08361
Marinó, G. C., Petrini, A., Malchiodi, D., & Frasca, M. (2023). Deep neural networks compression: A comparative survey and choice recommendations. Neurocomputing, 520, 152–170. https://doi.org/10.1016/j.neucom.2022.11.072
Meng, G. (2023). Leveraging Knowledge Distillation for Efficient Deep Reinforcement Learning in Resource-Constrained Environments. In 2023 International Conference on Image Processing, Computer Vision and Machine Learning (ICICML) (pp. 811-814). IEEE. http://dx.doi.org/10.1109/ICICML60161.2023.10424815
Neumann, O., & Gros, C. (2023). Scaling laws for a multi-agent reinforcement learning model. arXiv. https://doi.org/10.48550/arXiv.2210.00849
Pearce, T., Rashid, T., Bignell, D., Georgescu, R., Devlin, S., & Hofmann, K. (2024). Scaling laws for pre-training agents and world models. arXiv. https://doi.org/10.48550/arXiv.2411.04434
Schrimpf, M., Kubilius, J., Hong, H., Majaj, N. J., Rajalingham, R., Issa, E. B., Kar, K., Bashivan, P., Prescott-Roy, J., Geiger, F., Schmidt, K., Yamins, D. L. K., & DiCarlo, J. J. (2018). Brain-score: Which artificial neural network for object recognition is most brain-like? bioRxiv. https://doi.org/10.1101/407007
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017). Proximal policy optimization algorithms. arXiv. https://doi.org/10.48550/arXiv.1707.06347
Todorov, E., Erez, T., & Tassa, Y. (2012). MuJoCo: A physics engine for model-based control. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, 5026–5033. https://doi.org/10.1109/IROS.2012.6386109