Information Dropout: Learning Optimal Representations Through Noisy Computation

G. E. Hinton and D. Van Camp, “Keeping the neural networks simple by minimizing the description length of the weights,” in Proceedings of the 6th annual conference on Computational learning theory . ACM, 1993, pp. 5–13

1993

Earlier work this paper cites.

N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in The 37th annual Allerton Conference on Communication, Control, and Computing , 1999, pp. 368–377

1999

Earlier work this paper cites.

G. Sundaramoorthi, P. Petersen, V. S. Varadarajan, and S. Soatto, “On the set of images modulo viewpoint and contrast changes,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , June 2009

2009

Earlier work this paper cites.

A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” Technical report, University of Toronto , 2009

2009

Earlier work this paper cites.

J. Bruna and S. Mallat, “Classification with scattering operators,” in Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition , ser. CVPR ’11, 2011, pp. 1561–1566

2011

Earlier work this paper cites.

D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” in Proceedings of the 2nd International Conference on Learning Representations (ICLR) , no. 2014, 2013

2013

Earlier work this paper cites.

S. Wang and C. Manning, “Fast dropout training,” in Proceedings of the 30th International Conference on Machine Learning (ICML) , 2013, pp. 118–126

2013

Cited alongside, same era.

N. Srivastava, G. E. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting.” Journal of Machine Learning Research , vol. 15, no. 1, pp. 1929–1958, 2014

2014

Cited alongside, same era.

V. Mnih, N. Heess, A. Graves et al. , “Recurrent models of visual attention,” in Advances in Neural Information Processing Systems , 2014, pp. 2204–2212

2014

Cited alongside, same era.

J. T. Springenberg, A. Dosovitskiy, T. Brox, and M. Riedmiller, “Striving for simplicity: The all convolutional net,” arXiv preprint arXiv:1412.6806 , 2014

Original

2014

Cited alongside, same era.

Y. Gal and Z. Ghahramani, “Bayesian convolutional neural networks with bernoulli approximate variational inference,” arXiv preprint arXiv:1506.02158 , 2015

Original

2015

Later among the works it cites.

M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, S. Ghemawat, I. Goodfellow, A. Harp, G. Irving, M. Isard, Y. Jia, R. Jozefowicz, L. Kaiser, M. Kudlur, J. Levenberg, D. Mané, R. Monga, S. Moore, D. Murray, C. Olah, M. Schuster, J. Shlens, B. Steiner, I. Sutskever, K. Talwar, P. Tucker, V. Vanhoucke, V. Vasudevan, F. Viégas, O. Vinyals, P. Warden, M. Wattenberg, M. Wicke, Y. Yu, and X. Zheng, “TensorFlow: Large-scale machine learning on heterogeneous systems,” 2015, software available from tensorflow.org. [Online]. Available: http://tensorflow.org/

2015

Later among the works it cites.

S. Soatto and A. Chiuso, “Visual representations: Defining properties and deep approximations,” Proceedings of the International Conference on Learning Representations (ICLR); ArXiv: 1411.7676 , May 2016

2016

Closest in time.