Understand
While gradient descent has proven highly successful in learning connection weights for neural networks, the actual structure of these networks is usually determined by hand, or by other optimization algorithms.
- Here we describe a simple method to make network structure differentiable, and therefore accessible to gradient descent.
- We test this method on recurrent neural networks applied to simple sequence prediction problems.
- Starting with initial networks containing only one node, the method automatically builds networks that successfully solve the tasks.
Built on
“Emergence of simple-cell receptive field properties by learning a sparse code for natural images”
Bruno˜A Olshausen and David˜J Field · 1996
Earlier work this paper cites.
“Evolving neural networks through augmenting topologies”
Kenneth˜O Stanley and Risto Miikkulainen · 2002
Earlier work this paper cites.
Similar
“Performance-optimized hierarchical models predict neural responses in higher visual cortex”
Daniel L˜K Yamins et al · 2014
Cited alongside, same era.
Then
“Deep Residual Learning for Image Recognition”, 2015
Kaiming He, Xiangyu Zhang, Shaoqing Ren and Jian Sun · 2015
Later among the works it cites.
Beyond the bibliography
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…