Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Python Deep Learning
  • Toc
  • feedback
Python Deep Learning

Python Deep Learning

By : Zocca, Spacagna, Daniel Slater, Roelants
4.1 (10)
close
Python Deep Learning

Python Deep Learning

4.1 (10)
By: Zocca, Spacagna, Daniel Slater, Roelants

Overview of this book

With an increasing interest in AI around the world, deep learning has attracted a great deal of public attention. Every day, deep learning algorithms are used broadly across different industries. The book will give you all the practical information available on the subject, including the best practices, using real-world use cases. You will learn to recognize and extract information to increase predictive accuracy and optimize results. Starting with a quick recap of important machine learning concepts, the book will delve straight into deep learning principles using Sci-kit learn. Moving ahead, you will learn to use the latest open source libraries such as Theano, Keras, Google's TensorFlow, and H20. Use this guide to uncover the difficulties of pattern recognition, scaling data with greater accuracy and discussing deep learning algorithms and techniques. Whether you want to dive deeper into Deep Learning, or want to investigate how to get more out of this powerful technology, you’ll find everything inside.
Table of Contents (12 chapters)
close
close
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Conventions
Reader feedback
Customer support
Errata
Free Chapter
1
1. Machine Learning – An Introduction
1. Machine Learning – An Introduction
What is machine learning?
Different machine learning approaches
Summary
2
2. Neural Networks
2. Neural Networks
Why neural networks?
Fundamentals
Summary
3
3. Deep Learning Fundamentals
3. Deep Learning Fundamentals
What is deep learning?
Deep learning applications
GPU versus CPU
Popular open source libraries – an introduction
Summary
4
4. Unsupervised Feature Learning
4. Unsupervised Feature Learning
Autoencoders
Restricted Boltzmann machines
Summary
5
5. Image Recognition
5. Image Recognition
Similarities between artificial and biological models
Intuition and justification
Convolutional layers
Pooling layers
Dropout
Convolutional layers in deep learning
Convolutional layers in Theano
A convolutional layer example with Keras to recognize digits
A convolutional layer example with Keras for cifar10
Pre-training
Summary
6
6. Recurrent Neural Networks and Language Models
6. Recurrent Neural Networks and Language Models
Recurrent neural networks
Language modeling
Speech recognition
Summary
Bibliography
7
7. Deep Learning for Board Games
chevron up
7. Deep Learning for Board Games
Early game playing AI
Using the min-max algorithm to value game states
Implementing a Python Tic-Tac-Toe game
Learning a value function
Training AI to master Go
Upper confidence bounds applied to trees
Deep learning in Monte Carlo Tree Search
Quick recap on reinforcement learning
Policy gradients for learning policy functions
Policy gradients in AlphaGo
Summary
8
8. Deep Learning for Computer Games
8. Deep Learning for Computer Games
A supervised learning approach to games
Applying genetic algorithms to playing games
Q-Learning
Q-learning in action
Dynamic games
Atari Breakout
Actor-critic methods
Asynchronous methods
Model-based approaches
Summary
9
9. Anomaly Detection
9. Anomaly Detection
What is anomaly and outlier detection?
Real-world applications of anomaly detection
Popular shallow machine learning techniques
Anomaly detection using deep auto-encoders
H2O
Examples
Summary
10
10. Building a Production-Ready Intrusion Detection System
10. Building a Production-Ready Intrusion Detection System
What is a data product?
Training
Testing
Model validation
Hyper-parameters tuning
End-to-end evaluation
Deployment
Summary
11
Index
Index

Learning a value function

Let's get a bit more details on exactly how much computation the min max algorithm has to do. If we have a game of breadth b and depth d, then evaluating a complete game with min-max would require the construction of a tree with eventual d b leaves. If we use a max depth of n with an evaluation function, it would reduce our tree size to n b. But this is an exponential equation, and even though n is as small as 4 and b as 20, you still have 1,099,511,627,776 possibilities to evaluate. The tradeoff here is that as n gets lower, our evaluation function is called at a shallower level, where it may be a lot less good than the estimated quality of the position. Again, think of chess where our evaluation function is simply counting the number of pieces left on the board. Stopping at a shallow point may miss the fact that the last move put the queen in a position where it could be taken in the following move. Greater depth always equals greater accuracy of evaluation.

End of Section 6
Next Section
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