Skip to main content

Greedy Training

  • Chapter
  • First Online:
Book cover Deep Belief Nets in C++ and CUDA C: Volume 1
  • 2027 Accesses

Abstract

The algorithm for stacking RBMs is surprisingly simple. Roughly stated, you train the bottom-most RBM, the one whose input is the training data. Once that’s trained, you run the training cases through this model and use its hidden-layer activations as inputs to the next RBM, which you then train. When it is trained, you run the training data through the first and second RBMs and use the second’s hidden activation as inputs for the third, which is then trained, and so on.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Timothy Masters

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Masters, T. (2018). Greedy Training. In: Deep Belief Nets in C++ and CUDA C: Volume 1. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3591-1_4

Download citation

Publish with us

Policies and ethics