Fetching the paper…
Reading the bibliography…
This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation.
The strength of weak learnability
R. E. Schapire · 1990
Earlier work this paper cites.
Experiments with a new boosting algorithm
R. E. Schapire and Y Freund · 1996
Earlier work this paper cites.
An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization
Thomas G Dietterich · 2000
Earlier work this paper cites.
Learning multiple layers of features from tiny images, 2009
Alex Krizhevsky and Geoffrey Hinton · 2009
Earlier work this paper cites.
Deep learning of representations for unsupervised and transfer learning
Yoshua Bengio · 2012
Cited alongside, same era.
Min Lin, Qiang Chen, and Shuicheng Yan · 2013
Cited alongside, same era.
Regularization of neural networks using dropconnect
Li Wan, Matthew Zeiler, Sixin Zhang, Yann L Cun, and Rob Fergus · 2013
Cited alongside, same era.
Do deep nets really need to be deep?
Lei Jimmy Ba and Rich Caurana · 2014
Cited alongside, same era.
The MNIST database of handwritten digits
Yann Lecun and Corinna Cortes
Cited in the paper.
Benjamin Graham · 2014
Later among the works it cites.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2014
Later among the works it cites.
Striving for simplicity: The all convolutional net
Jost Tobias Springenberg, Alexey Dosovitskiy, Thomas Brox, and Martin Riedmiller · 2014
Later among the works it cites.
How transferable are features in deep neural networks?
Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…