Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 117 of the 122 references it cites were found in a registry or an index.

Practical Recommendations for Gradient-Based Training of Deep Architectures

Open access
Bengio, Yoshua · 2012 · Lecture Notes in Computer Science

Abstract

Learning algorithms related to artificial neural networks and in particular for Deep Learning may seem to involve many bells and whistles, called hyper-parameters. This chapter is meant as a practical guide with recommendations for some of the most commonly used hyperparameters, in particular in the context of learning algorithms based on back-propagated gradient and gradient-based optimization. It also discusses how to deal with the fact that more interesting results can be obtained when allowing one to adjust many hyper-parameters. Overall, it describes elements of the practice used to successfully and efficiently train and debug large-scale and often deep multi-layer neural networks. It closes with open questions about the training difficulties observed with deeper architectures.

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-642-35289-8_26

Cites

117 of 117 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

  • Gradient-based learning applied to document recognition

    Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805 · cited 9×

    “LeCun et al. (1998a) also propose a simple method in order to estimate the largest eigenvalue of the Hessian (which would be the optimal learning rate).”
    BackgroundMethodInfluentialSelf-citation
  • Untitled work

    (2008) · Journal of Machine Learning Research · Cited by 33,051

  • Learning representations by back-propagating errors

    Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892 · cited 1×

    “This chapter assumes that the reader already un-derstands the standard algorithms for training supervised multi-layer neural networks, with the loss gradient computed thanks to the back-propagation algorithm (Rumelhart et al. , 1986).”
    Method
  • A fast learning algorithm for deep belief nets

    Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336 · cited 13×

    “Note that some learning algorithms (in particular unsupervised learning algorithms such as algorithms for training RBMs by approximate maximum likelihood) are problematic in this respect because we cannot directly measure the quantity that is to be optimized (e.g. the likelihood) because it is intractable.”
    BackgroundMethodInfluential
  • Bagging predictors

    Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 1×

    “Another way to exploit computing power to push performance a bit is model averaging, as in Bagging (Breiman, 1994) and Bayesian methods.”
    Method
  • Untitled work

    (2010) · Cited by 14,134

    Self-citation
  • Untitled work

    (2010) · International Conference on Machine Learning · Cited by 13,995

  • A Global Geometric Framework for Nonlinear Dimensionality Reduction

    Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585 · cited 2×

    “D) representation, e.g., with the t-SNE (van der Maaten and Hinton, 2008) or Isomap (Tenenbaum et al. , 2000) algorithms, and then plot the evolution of this function during training, or the population of such trajectories for different initializations.”
    BackgroundMethod
  • Indexing by latent semantic analysis

    Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751

  • Backpropagation Applied to Handwritten Zip Code Recognition

    LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., & Jackel, L. D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.541 · Cited by 11,891 · cited 1×

    “There are also many architectural choices that are relevant in the case of convolutional architectures (e.g. for modeling images, time-series or sound) (LeCun et al. , 1989, 1998b; Le et al. , 2010) in which hidden units have local receptive fields.”
    Background

Show all 122 references

Research works printed but not linked: 10

  1. Bach, F., Moulines, E.: Non-asymptotic analysis of stochastic approximation algorithms. In: NIPS 2011 (2011)
  2. Bengio, Y., Ducharme, R., Vincent, P., Jauvin, C.: A neural probabilistic language model. JMLR 3, 1137–1155 (2003)
  3. Bottou, L., LeCun, Y.: Large-scale on-line learning. In: NIPS 2003 (2004)
  4. Caruana, R.: Multitask connectionist learning. In: Proceedings of the 1993 Connectionist Models Summer School, pp. 372–379 (1993)
  5. Collobert, R., Bengio, S.: Links between perceptrons, MLPs and SVMs. In: International Conference on Machine Learning, ICML (2004b) · DOI · Paper page
  6. Dauphin, Y., Glorot, X., Bengio, Y.: Sampled reconstruction for large-scale learning of embeddings. In: Proc. ICML 2011 (2011)
  7. Le Roux, N., Manzagol, P.-A., Bengio, Y.: Topmoumoute online natural gradient algorithm. In: NIPS 2007 (2008)
  8. LeCun, Y.: Modèles connexionistes de l’apprentissage. Ph.D. thesis, Université de Paris VI (1987)
  9. Mesnil, G., Dauphin, Y., Glorot, X., Rifai, S., Bengio, Y., Goodfellow, I., Lavoie, E., Muller, X., Desjardins, G., Warde-Farley, D., Vincent, P., Courville, A., Bergstra, J.: Unsupervised and transfer learning challenge: a deep learning approach. In: Proc. Unsupervised and Transfer Learning, JMLR W&CP, vol. 7 (2011)
  10. Ranzato, M., Boureau, Y.-L., LeCun, Y.: Sparse feature learning for deep belief networks. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems (NIPS 2007), vol. 20, pp. 1185–1192. MIT Press, Cambridge (2008a)

Cited by

See all 2,259

Metadata

Authors
Bengio, Y.
Affiliations
Université de Montréal (CA)
Corresponding author
Bengio, Yoshua
Venue
Lecture Notes in Computer Science
Published
2012
Pages
437-478
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1806891645
Cited by
2,259
References
122
Citations by year
2026: 95 · 2025: 186 · 2024: 184 · 2023: 195 · 2022: 253 · 2021: 273 · 2020: 278 · 2019: 231 · 2018: 200 · 2017: 158 · 2016: 105 · 2015: 55 · 2014: 26 · 2013: 13 · 2012: 7
FWCI
24.71
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Canadian Institute for Advanced Research
  • Canada Research Chairs
  • Fonds Québécois de la Recherche sur la Nature et les Technologies
  • Natural Sciences and Engineering Research Council of Canada
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
hyperparameter optimization, gradient-based optimization, backpropagation, deep neural network, training recommendations, multilayer neural networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Practical Recommendations for Gradient-Based Training of Deep Architectures. https://app.cochat.ai/papers/10.1007/978-3-642-35289-8_26
The paper
Bengio, Y. (2012). Practical Recommendations for Gradient-Based Training of Deep Architectures. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-35289-8_26

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.