Fetching the paper…
Reading the bibliography…
Dropout is a well-known regularization method by sampling a sub-network from a larger deep neural network and training different sub-networks on different subsets of the data.
Y. LeCun, J. S. Denker, and S. A. Solla, “Optimal brain damage,” in Advances in neural information processing systems , 1990, pp. 598–605
1990
Earlier work this paper cites.
S. J. Nowlan and G. E. Hinton, “Simplifying neural networks by soft weight-sharing,” Neural computation , vol. 4, no. 4, pp. 473–493, 1992
1992
Earlier work this paper cites.
J. Lampinen, I. Zelinka et al. , “On stagnation of the differential evolution algorithm,” in Proceedings of MENDEL , 2000, pp. 76–83
2000
Earlier work this paper cites.
R. M. Neal, “Annealed importance sampling,” Statistics and computing , vol. 11, no. 2, pp. 125–139, 2001
2001
Earlier work this paper cites.
Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, and F. Huang, “A tutorial on energy-based learning,” Predicting structured data , vol. 1, no. 0, 2006
2006
Earlier work this paper cites.
M.-E. Nilsback and A. Zisserman, “Automated flower classification over a large number of classes,” in 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing . IEEE, 2008, pp. 722–729
2008
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in 2009 IEEE conference on computer vision and pattern recognition . Ieee, 2009, pp. 248–255
2009
Earlier work this paper cites.
K. P. Murphy, Machine learning: a probabilistic perspective . MIT press, 2012
2012
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in neural information processing systems , 2012, pp. 1097–1105
2012
Earlier work this paper cites.
M. D. Zeiler, “Adadelta: an adaptive learning rate method,” arXiv preprint arXiv:1212.5701 , 2012
2012
Earlier work this paper cites.
J. Ba and B. Frey, “Adaptive dropout for training deep neural networks,” in Advances in Neural Information Processing Systems , 2013, pp. 3084–3092
2013
Earlier work this paper cites.
L. Wan, M. Zeiler, S. Zhang, Y. Le Cun, and R. Fergus, “Regularization of neural networks using dropconnect,” in International conference on machine learning , 2013, pp. 1058–1066
2013
Earlier work this paper cites.
K. V. Price, “Differential evolution,” pp. 187–214, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting,” The Journal of Machine Learning Research , vol. 15, no. 1, pp. 1929–1958, 2014
2014
Cited alongside, same era.
H. Salehinejad, R. Zadeh, R. Liscano, and S. Rahnamayan, “3d localization in large-scale wireless sensor networks: A micro-differential evolution approach,” in 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC) . IEEE, 2014, pp. 1824–1828
2014
Cited alongside, same era.
H. Salehinejad, S. Rahnamayan, and H. R. Tizhoosh, “Type-ii opposition-based differential evolution,” in 2014 IEEE Congress on Evolutionary Computation (CEC) . IEEE, 2014, pp. 1768–1775
2014
Cited alongside, same era.
2015
H. Xiao, K. Rasul, and R. Vollgraf. (2017) Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
2017
Later among the works it cites.
2017
Later among the works it cites.
J.-H. Luo, J. Wu, and W. Lin, “Thinet: A filter level pruning method for deep neural network compression,” in Proceedings of the IEEE international conference on computer vision , 2017, pp. 5058–5066
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
T. Hastie, R. Tibshirani, and M. Wainwright, Statistical learning with sparsity: the lasso and generalizations . CRC press, 2015
2015
Cited alongside, same era.
D. P. Kingma, T. Salimans, and M. Welling, “Variational dropout and the local reparameterization trick,” in Advances in Neural Information Processing Systems , 2015, pp. 2575–2583
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 770–778
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Later among the works it cites.
S. Park, J. Park, S.-J. Shin, and I.-C. Moon, “Adversarial dropout for supervised and semi-supervised learning,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
T. Clanuwat, M. Bober-Irizar, A. Kitamoto, A. Lamb, K. Yamamoto, and D. Ha. (2018) Deep learning for classical japanese literature
2018
Later among the works it cites.
H. Gao, Z. Wang, and S. Ji, “Channelnets: Compact and efficient convolutional neural networks via channel-wise convolutions,” in Advances in neural information processing systems , 2018, pp. 5197–5205
2018
Later among the works it cites.
2019
Later among the works it cites.
H. Salehinejad and S. Valaee, “Ising-dropout: A regularization method for training and compression of deep neural networks,” in ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2019, pp. 3602–3606
2019
Later among the works it cites.
H. Salehinejad, Z. Wang, and S. Valaee, “Ising dropout with node grouping for training and compression of deep neural networks,” in 2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP) . IEEE, 2019, pp. 1–5
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Closest in time.