Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Neural Networks with TensorFlow 2.0

You're reading from   Hands-On Neural Networks with TensorFlow 2.0 Understand TensorFlow, from static graph to eager execution, and design neural networks

Arrow left icon
Product type Paperback
Published in Sep 2019
Publisher Packt
ISBN-13 9781789615555
Length 358 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Paolo Galeone Paolo Galeone
Author Profile Icon Paolo Galeone
Paolo Galeone
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Section 1: Neural Network Fundamentals FREE CHAPTER
2. What is Machine Learning? 3. Neural Networks and Deep Learning 4. Section 2: TensorFlow Fundamentals
5. TensorFlow Graph Architecture 6. TensorFlow 2.0 Architecture 7. Efficient Data Input Pipelines and Estimator API 8. Section 3: The Application of Neural Networks
9. Image Classification Using TensorFlow Hub 10. Introduction to Object Detection 11. Semantic Segmentation and Custom Dataset Builder 12. Generative Adversarial Networks 13. Bringing a Model to Production 14. Other Books You May Enjoy

Dataflow graphs

In order to be a highly efficient, flexible, and production-ready library, TensorFlow uses dataflow graphs to represent computation in terms of the relationships between individual operations. Dataflow is a programming model widely used in parallel computing and, in a dataflow graph, the nodes represent units of computation while the edges represent the data consumed or produced by a computation unit.

As seen in the previous chapter, Chapter 2, Neural Networks and Deep Learning, representing computation using graphs comes with the advantage of being able to run the forward and backward passes required to train a parametric machine learning model via gradient descent, applying the chain rule to compute the gradient as a local process to every node; however, this is not the only advantage of using graphs.

Reducing the abstraction level and thinking about the implementation...

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 $19.99/month. Cancel anytime
Banner background image