- I emphasize mathematical/conceptual foundations because implementations of ideas(ex. Torch, Tensorflow) will keep evolving but the underlying theory must be sound. Anybody with an interest in deep learning can and should try to understand why things work.
- I include neuroscience as a useful conceptual foundation for two reasons. First, it may provide inspiration for future models and algorithms. Second, the success of deep learning can contribute to useful hypotheses and models for computational neuroscience.
- Information Theory is also a very useful foundation as there's a strong connection between data compression and statistical prediction. In fact, data compressors and machine learning models approximate Kolmogorov Complexity which is the ultimate data compressor.
You might notice that I haven't emphasized the latest benchmark-beating paper. My reason for this is that a good theory ought to be scalable which means that it should be capable of explaining why deep models generalise and we should be able to bootstrap these explanations for more complex models(ex. sequences of deep models(aka RNNs)). This is how all good science is done.
For an excellent historical overview of deep learning, I would recommend reading Deep Learning in Neural Networks as well as R. Salakhutdinov's Deep Learning Tutorials.
- History:
- Optimisation:
- Learning Internal Representations by Error Propagation(D. Rumelhart et al. 1996. MIT Press )
- Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift(S. Ioffe. 2015. ICML.)
- Weight Normalization (Salimans 2016. NIPS.)
- Bayesian Back-Propagation (W. Buntine & A. Weigend 1991.)
- Credit Assignment through Time: Alternatives to Backpropagation (Y. Bengio. 1993. NIPS.)
- Adam: A method for Stochastic Optimization (D. Kingma 2015. ICLR.)
- Understanding Synthetic Gradients and Decoupled Neural Interfaces(W. Czarnecki 2017. CoRR.)
- Regularisation:
- Inference:
- Uncertainty in Deep Learning(Yarin Gal. 2017. University of Cambridge.)
- Mixture Density Networks (Bishop 1994)
- Dropout as a Bayesian Approximation(Yarin Gal 2016. ICML. )
- Markov Chain Monte Carlo and Variational Inference: Bridging the Gap (Salimans. 2015. ICML.)
- Auto-Encoding Variational Bayes (D. Kingma & M. Welling. 2014. ICLR.)
- Variational Dropout and the Local Reparameterization Trick (D. Kingma, T. Salimans & M. Welling. 2015. NIPS.)
- Avoiding pathologies in very deep networks (D. Duvenaud et al. 2014. AISTATS.)
- Stochastic Gradient Hamiltonian Monte Carlo (T. Chen. 2014. ICML.)
- On Sparse Variational Methods and the Kullback-Leibler Divergence between Stochastic Processes(A. Matthews et al. 2016. AISTATS.)
- Representation Learning:
- Representation Learning: A Review and New Perspectives (Y. Bengio et al. 2013. IEEE Transactions on Pattern Analysis and Machine Intelligence.)
- Deep Learning of Representations for Unsupervised and Transfer Learning (Y. Bengio. 2012. ICML.)
- Learning Invariant Feature Hierarchies (Y. Lecun. 2012. ECCV Workshops.)
- Deep Generative Models:
- Continual Learning:
- Hyperparameter Optimization:
-
Optimisation:
- Simple Explanation of the No-Free-Lunch Theorem and Its Implications (Y. Ho. 2002. Journal of optimization theory and applications.)
- The Loss Surfaces of Multilayer Networks(Y LeCun et al. 2015. AISTATS.)
- The loss surface of deep and wide neural networks(Q. Nguyen 2017)
- Qualitatively Characterizing Neural Network Optimization Problems (I. Goodfellow et al. 2015. ICLR.)
- The Physical Systems behind Optimization (L. Yang et al. 2017.)
- A Differential Equation for Modeling Nesterov’s Accelerated Gradient Method(W. Su 2016. Journal of Machine Learning Research.)
- Electron-Proton dynamics in deep learning(Zhang 2017. CoRR.)
- Sharp Minima Can Generalize for Deep Nets (L. Dinh et al. 2017. ICML.)
-
Representation Learning:
-
Learning theory:
- Distribution-Specific Hardness of Learning Neural Networks(Shamir 2017. CoRR.)
- Lessons from the Rademacher Complexity for Deep Learning(Sokolic 2016.ICLR.)
- On the ability of neural nets to express distributions (H. Lee et al. 2017.)
- Empirical Risk Minimization for Learning Theory(Vapnik 1991. NIPS.)
- Dataset Shift(Storkey 2013)
- On the ability of neural nets to express distributions (H. Lee, R. Ge, T. Ma, A. Risteski & S. Arora, 2017)
- Probably Approximately Correct Learning (R. Schapire. COS 511: Foundations of Machine Learning. 2006.)
- Rademacher Complexity (M. Balcan. CS 8803 - Machine Learning Theory. 2011.)
- Shannon Information and Kolmogorov Complexity (Grunwald 2010)
- Discovering Neural Nets with Low Kolmogorov Complexity(Schmidhuber 1997. Neural Networks.)
- Opening the black box of Deep Neural Networks via Information (Schwartz-Ziv 2017.)
- Towards an integration of deep learning and neuroscience(Marblestone 2016. Frontiers in Computational Neuroscience.)
- Equilibrium Propagation(Scellier 2016. Frontiers in Computational Neuroscience.)
- Towards Biologically plausible deep learning(Bengio 2015. CoRR.)
- Random synaptic feedback weights support error backpropagation for deep learning(Lillicrap 2016. Nature communications.)
- Towards deep learning with spiking neurons(Mesnard 2016. NIPS.)
- Towards deep learning with segregated dendrites(Guergiuev 2017)
- Variational learning for recurrent spiking networks(Rezende 2011. NIPS.)
- A view of Neural Networks as dynamical systems(Cessac 2009. I. J. Bifurcation and Chaos)