Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering TensorFlow 1.x

You're reading from   Mastering TensorFlow 1.x Advanced machine learning and deep learning concepts using TensorFlow 1.x and Keras

Arrow left icon
Product type Paperback
Published in Jan 2018
Publisher Packt
ISBN-13 9781788292061
Length 474 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Toc

Table of Contents (21) Chapters Close

Preface 1. TensorFlow 101 2. High-Level Libraries for TensorFlow FREE CHAPTER 3. Keras 101 4. Classical Machine Learning with TensorFlow 5. Neural Networks and MLP with TensorFlow and Keras 6. RNN with TensorFlow and Keras 7. RNN for Time Series Data with TensorFlow and Keras 8. RNN for Text Data with TensorFlow and Keras 9. CNN with TensorFlow and Keras 10. Autoencoder with TensorFlow and Keras 11. TensorFlow Models in Production with TF Serving 12. Transfer Learning and Pre-Trained Models 13. Deep Reinforcement Learning 14. Generative Adversarial Networks 15. Distributed Models with TensorFlow Clusters 16. TensorFlow Models on Mobile and Embedded Platforms 17. TensorFlow and Keras in R 18. Debugging TensorFlow Models 19. Tensor Processing Units
20. Other Books You May Enjoy

GRU network

LSTM Network is computationally expensive, hence, researchers found an almost equally effective configuration of RNNs, known as Gated Recurrent Unit (GRU) architecture.

In GRU, instead of a working and a long-term memory, only one kind of memory is used, indicated with h (hidden state). The GRU cell adds information to this state memory or removes information from this state memory through reset and update gates.

Following diagram depicts the GRU cell (explanation follows the diagram):

The GRU Cell

The internal flow through the gates in the GRU cell is as follows:

  1. Update gate u( ): The input and flows to the u( ) gate as per the following equation:
  2. Reset Gate r( ): The input and flows to the r( ) gate as per the following equation:

  1. Candidate State Memory: The candidate long-term memory is computed from the output of the r( ) gate, , and , as per the following...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at ÂŁ16.99/month. Cancel anytime