Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Neural Networks with Keras Cookbook
  • Toc
  • feedback
Neural Networks with Keras Cookbook

Neural Networks with Keras Cookbook

By : V Kishore Ayyadevara
3.3 (8)
close
Neural Networks with Keras Cookbook

Neural Networks with Keras Cookbook

3.3 (8)
By: V Kishore Ayyadevara

Overview of this book

This book will take you from the basics of neural networks to advanced implementations of architectures using a recipe-based approach. We will learn about how neural networks work and the impact of various hyper parameters on a network's accuracy along with leveraging neural networks for structured and unstructured data. Later, we will learn how to classify and detect objects in images. We will also learn to use transfer learning for multiple applications, including a self-driving car using Convolutional Neural Networks. We will generate images while leveraging GANs and also by performing image encoding. Additionally, we will perform text analysis using word vector based techniques. Later, we will use Recurrent Neural Networks and LSTM to implement chatbot and Machine Translation systems. Finally, you will learn about transcribing images, audio, and generating captions and also use Deep Q-learning to build an agent that plays Space Invaders game. By the end of this book, you will have developed the skills to choose and customize multiple neural network architectures for various deep learning problems you might encounter.
Table of Contents (18 chapters)
close

The optimal action to take in a state in a simulated game

In the previous scenario, we considered a simplistic case where there is a reward when the objective is achieved. In this scenario, we will complicate game by having negative rewards too. However, the objective remains the same: maximizing the reward in the given problem setting where the environment has both positive and negative rewards.

Getting ready

The environment we are working on is as follows:

We start at the cell with S in it and our objective is to reach the cell where the reward is +1. In order to maximize the chances of achieving the reward, we will be using Bellman's equation, which calculates the value of each cell in the preceding grid as follows...

bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete