SECOND EDITION Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow Concepts, Tools, and Techniques to Build Intelligent Systems Aurélien Géron Beijing Boston Farnham Sebastopol Tokyo Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow by Aurélien Géron Copyright © 2019 Aurélien Géron All rights reserved Printed in the United States of America Published by O’Reilly Media, Inc., 1005 Gravenstein Highway North, Sebastopol, CA 95472 O’Reilly books may be purchased for educational, business, or sales promotional use Online editions are also available for most titles (http://oreilly.com) For more information, contact our corporate/institutional sales department: 800-998-9938 or corporate@oreilly.com Editor: Nicole Tache Interior Designer: David Futato June 2019: Cover Designer: Karen Montgomery Illustrator: Rebecca Demarest Second Edition Revision History for the Early Release 2018-11-05: First Release 2019-01-24: Second Release 2019-03-07: Third Release 2019-03-29: Fourth Release 2019-04-22: Fifth Release See http://oreilly.com/catalog/errata.csp?isbn=9781492032649 for release details The O’Reilly logo is a registered trademark of O’Reilly Media, Inc Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow, the cover image, and related trade dress are trademarks of O’Reilly Media, Inc While the publisher and the author have used good faith efforts to ensure that the information and instructions contained in this work are accurate, the publisher and the author disclaim all responsibility for errors or omissions, including without limitation responsibility for damages resulting from the use of or reliance on this work Use of the information and instructions contained in this work is at your own risk If any code samples or other technology this work contains or describes is subject to open source licenses or the intellectual property rights of others, it is your responsibility to ensure that your use thereof complies with such licenses and/or rights 978-1-492-03264-9 [LSI] Table of Contents Preface xi Part I The Fundamentals of Machine Learning The Machine Learning Landscape What Is Machine Learning? Why Use Machine Learning? Types of Machine Learning Systems Supervised/Unsupervised Learning Batch and Online Learning Instance-Based Versus Model-Based Learning Main Challenges of Machine Learning Insufficient Quantity of Training Data Nonrepresentative Training Data Poor-Quality Data Irrelevant Features Overfitting the Training Data Underfitting the Training Data Stepping Back Testing and Validating Hyperparameter Tuning and Model Selection Data Mismatch Exercises 4 8 15 18 24 24 26 27 27 28 30 30 31 32 33 34 End-to-End Machine Learning Project 37 Working with Real Data Look at the Big Picture 38 39 iii Frame the Problem Select a Performance Measure Check the Assumptions Get the Data Create the Workspace Download the Data Take a Quick Look at the Data Structure Create a Test Set Discover and Visualize the Data to Gain Insights Visualizing Geographical Data Looking for Correlations Experimenting with Attribute Combinations Prepare the Data for Machine Learning Algorithms Data Cleaning Handling Text and Categorical Attributes Custom Transformers Feature Scaling Transformation Pipelines Select and Train a Model Training and Evaluating on the Training Set Better Evaluation Using Cross-Validation Fine-Tune Your Model Grid Search Randomized Search Ensemble Methods Analyze the Best Models and Their Errors Evaluate Your System on the Test Set Launch, Monitor, and Maintain Your System Try It Out! Exercises 39 42 45 45 45 49 50 54 58 59 62 65 66 67 69 71 72 73 75 75 76 79 79 81 82 82 83 84 85 85 Classification 87 MNIST Training a Binary Classifier Performance Measures Measuring Accuracy Using Cross-Validation Confusion Matrix Precision and Recall Precision/Recall Tradeoff The ROC Curve Multiclass Classification Error Analysis iv | Table of Contents 87 90 90 91 92 94 95 99 102 104 Multilabel Classification Multioutput Classification Exercises 108 109 110 Training Models 113 Linear Regression The Normal Equation Computational Complexity Gradient Descent Batch Gradient Descent Stochastic Gradient Descent Mini-batch Gradient Descent Polynomial Regression Learning Curves Regularized Linear Models Ridge Regression Lasso Regression Elastic Net Early Stopping Logistic Regression Estimating Probabilities Training and Cost Function Decision Boundaries Softmax Regression Exercises 114 116 119 119 123 126 129 130 132 136 137 139 142 142 144 144 145 146 149 153 Support Vector Machines 155 Linear SVM Classification Soft Margin Classification Nonlinear SVM Classification Polynomial Kernel Adding Similarity Features Gaussian RBF Kernel Computational Complexity SVM Regression Under the Hood Decision Function and Predictions Training Objective Quadratic Programming The Dual Problem Kernelized SVM Online SVMs 155 156 159 160 161 162 163 164 166 166 167 169 170 171 174 Table of Contents | v Exercises 175 Decision Trees 177 Training and Visualizing a Decision Tree Making Predictions Estimating Class Probabilities The CART Training Algorithm Computational Complexity Gini Impurity or Entropy? Regularization Hyperparameters Regression Instability Exercises 177 179 181 182 183 183 184 185 188 189 Ensemble Learning and Random Forests 191 Voting Classifiers Bagging and Pasting Bagging and Pasting in Scikit-Learn Out-of-Bag Evaluation Random Patches and Random Subspaces Random Forests Extra-Trees Feature Importance Boosting AdaBoost Gradient Boosting Stacking Exercises 192 195 196 197 198 199 200 200 201 202 205 210 213 Dimensionality Reduction 215 The Curse of Dimensionality Main Approaches for Dimensionality Reduction Projection Manifold Learning PCA Preserving the Variance Principal Components Projecting Down to d Dimensions Using Scikit-Learn Explained Variance Ratio Choosing the Right Number of Dimensions PCA for Compression vi | Table of Contents 216 218 218 220 222 222 223 224 224 225 225 226 Randomized PCA Incremental PCA Kernel PCA Selecting a Kernel and Tuning Hyperparameters LLE Other Dimensionality Reduction Techniques Exercises 227 227 228 229 232 234 235 Unsupervised Learning Techniques 237 Clustering K-Means Limits of K-Means Using clustering for image segmentation Using Clustering for Preprocessing Using Clustering for Semi-Supervised Learning DBSCAN Other Clustering Algorithms Gaussian Mixtures Anomaly Detection using Gaussian Mixtures Selecting the Number of Clusters Bayesian Gaussian Mixture Models Other Anomaly Detection and Novelty Detection Algorithms 238 240 250 251 252 254 256 259 260 266 267 270 274 Part II Neural Networks and Deep Learning 10 Introduction to Artificial Neural Networks with Keras 277 From Biological to Artificial Neurons Biological Neurons Logical Computations with Neurons The Perceptron Multi-Layer Perceptron and Backpropagation Regression MLPs Classification MLPs Implementing MLPs with Keras Installing TensorFlow Building an Image Classifier Using the Sequential API Building a Regression MLP Using the Sequential API Building Complex Models Using the Functional API Building Dynamic Models Using the Subclassing API Saving and Restoring a Model Using Callbacks 278 279 281 281 286 289 290 292 293 294 303 304 309 311 311 Table of Contents | vii Visualization Using TensorBoard Fine-Tuning Neural Network Hyperparameters Number of Hidden Layers Number of Neurons per Hidden Layer Learning Rate, Batch Size and Other Hyperparameters Exercises 313 315 319 320 320 322 11 Training Deep Neural Networks 325 Vanishing/Exploding Gradients Problems Glorot and He Initialization Nonsaturating Activation Functions Batch Normalization Gradient Clipping Reusing Pretrained Layers Transfer Learning With Keras Unsupervised Pretraining Pretraining on an Auxiliary Task Faster Optimizers Momentum Optimization Nesterov Accelerated Gradient AdaGrad RMSProp Adam and Nadam Optimization Learning Rate Scheduling Avoiding Overfitting Through Regularization ℓ1 and ℓ2 Regularization Dropout Monte-Carlo (MC) Dropout Max-Norm Regularization Summary and Practical Guidelines Exercises 326 327 329 333 338 339 341 343 344 344 345 346 347 349 349 352 356 356 357 360 362 363 364 12 Custom Models and Training with TensorFlow 367 A Quick Tour of TensorFlow Using TensorFlow like NumPy Tensors and Operations Tensors and NumPy Type Conversions Variables Other Data Structures Customizing Models and Training Algorithms Custom Loss Functions viii | Table of Contents 368 371 371 373 374 374 375 376 376 loc_output = keras.layers.Dense(4)(avg) model = keras.models.Model(inputs=base_model.input, outputs=[class_output, loc_output]) model.compile(loss=["sparse_categorical_crossentropy", "mse"], loss_weights=[0.8, 0.2], # depends on what you care most about optimizer=optimizer, metrics=["accuracy"]) But now we have a problem: the flowers dataset does not have bounding boxes around the flowers So we need to add them ourselves This is often one of the hard‐ est and most costly part of a Machine Learning project: getting the labels It’s a good idea to spend time looking for the right tools To annotate images with bounding boxes, you may want to use an open source image labeling tool like VGG Image Annotator, LabelImg, OpenLabeler or ImgLab, or perhaps a commercial tool like LabelBox or Supervisely You may also want to consider crowdsourcing platforms such as Amazon Mechanical Turk or CrowdFlower if you have a very large number of images to annotate However, it is quite a lot of work to setup a crowdsourcing plat‐ form, prepare the form to be sent to the workers, to supervise them and ensure the quality of the bounding boxes they produce is good, so make sure it is worth the effort: if there are just a few thousand images to label, and you don’t plan to this frequently, it may be preferable to it yourself Adriana Kovashka et al wrote a very practical paper22 about crowdsourcing in Computer Vision, I recommend you check it out, even if you not plan to use crowdsourcing So let’s suppose you obtained the bounding boxes for every image in the flowers data‐ set (for now we will assume there is a single bounding box per image), you then need to create a dataset whose items will be batches of preprocessed images along with their class labels and their bounding boxes Each item should be a tuple of the form: (images, (class_labels, bounding_boxes)) Then you are ready to train your model! The bounding boxes should be normalized so that the horizontal and vertical coordinates, as well as the height and width all range from to Also, it is common to predict the square root of the height and width rather than the height and width directly: this way, a 10 pixel error for a large bounding box will not be penalized as much as a 10 pixel error for a small bounding box The MSE often works fairly well as a cost function to train the model, but it is not a great metric to evaluate how well the model can predict bounding boxes The most common metric for this is the Intersection over Union (IoU): it is the area of overlap between the predicted bounding box and the target bounding box, divided by the 22 “Crowdsourcing in Computer Vision,” A Kovashka et al (2016) 470 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks area of their union (see Figure 14-23) In tf.keras, it is implemented by the tf.keras.metrics.MeanIoU class Figure 14-23 Intersection over Union (IoU) Metric for Bounding Boxes Classifying and localizing a single object is nice, but what if the images contain multi‐ ple objects (as is often the case in the flowers dataset)? Object Detection The task of classifying and localizing multiple objects in an image is called object detection Until a few years ago, a common approach was to take a CNN that was trained to classify and locate a single object, then slide it across the image, as shown in Figure 14-24 In this example, the image was chopped into a × grid, and we show a CNN (the thick black rectangle) sliding across all × regions When the CNN was looking at the top left of the image, it detected part of the left-most rose, and then it detected that same rose again when it was first shifted one step to the right At the next step, it started detecting part of the top-most rose, and then it detec‐ ted it again once it was shifted one more step to the right You would then continue to slide the CNN through the whole image, looking at all × regions Moreover, since objects can have varying sizes, you would also slide the CNN across regions of differ‐ ent sizes For example, once you are done with the × regions, you might want to slide the CNN across all × regions as well Object Detection | 471 Figure 14-24 Detecting Multiple Objects by Sliding a CNN Across the Image This technique is fairly straightforward, but as you can see it will detect the same object multiple times, at slightly different positions Some post-processing will then be needed to get rid of all the unnecessary bounding boxes A common approach for this is called non-max suppression: • First, you need to add an extra objectness output to your CNN, to estimate the probability that a flower is indeed present in the image (alternatively, you could add a “no-flower” class, but this usually does not work as well) It must use the sigmoid activation function and you can train it using the "binary_crossen tropy" loss Then just get rid of all the bounding boxes for which the objectness score is below some threshold: this will drop all the bounding boxes that don’t actually contain a flower • Second, find the bounding box with the highest objectness score, and get rid of all the other bounding boxes that overlap a lot with it (e.g., with an IoU greater than 60%) For example, in Figure 14-24, the bounding box with the max object‐ ness score is the thick bounding box over the top-most rose (the objectness score is represented by the thickness of the bounding boxes) The other bounding box over that same rose overlaps a lot with the max bounding box, so we will get rid of it 472 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks • Third, repeat step two until there are no more bounding boxes to get rid of This simple approach to object detection works pretty well, but it requires running the CNN many times, so it is quite slow Fortunately, there is a much faster way to slide a CNN across an image: using a Fully Convolutional Network Fully Convolutional Networks (FCNs) The idea of FCNs was first introduced in a 2015 paper23 by Jonathan Long et al., for semantic segmentation (the task of classifying every pixel in an image according to the class of the object it belongs to) They pointed out that you could replace the dense layers at the top of a CNN by convolutional layers To understand this, let’s look at an example: suppose a dense layer with 200 neurons sits on top of a convolutional layer that outputs 100 feature maps, each of size × (this is the feature map size, not the kernel size) Each neuron will compute a weighted sum of all 100 × × activa‐ tions from the convolutional layer (plus a bias term) Now let’s see what happens if we replace the dense layer with a convolution layer using 200 filters, each × 7, and with VALID padding This layer will output 200 feature maps, each × (since the kernel is exactly the size of the input feature maps and we are using VALID padding) In other words, it will output 200 numbers, just like the dense layer did, and if you look closely at the computations performed by a convolutional layer, you will notice that these numbers will be precisely the same as the dense layer produced The only differ‐ ence is that the dense layer’s output was a tensor of shape [batch size, 200] while the convolutional layer will output a tensor of shape [batch size, 1, 1, 200] To convert a dense layer to a convolutional layer, the number of fil‐ ters in the convolutional layer must be equal to the number of units in the dense layer, the filter size must be equal to the size of the input feature maps, and you must use VALID padding The stride may be set to or more, as we will see shortly Why is this important? Well, while a dense layer expects a specific input size (since it has one weight per input feature), a convolutional layer will happily process images of any size24 (however, it does expect its inputs to have a specific number of channels, since each kernel contains a different set of weights for each input channel) Since an FCN contains only convolutional layers (and pooling layers, which have the same property), it can be trained and executed on images of any size! 23 “Fully Convolutional Networks for Semantic Segmentation,” J Long, E Shelhamer, T Darrell (2015) 24 There is one small exception: a convolutional layer using VALID padding will complain if the input size is smaller than the kernel size Object Detection | 473 For example, suppose we already trained a CNN for flower classification and localiza‐ tion It was trained on 224 × 224 images and it outputs 10 numbers: outputs to are sent through the softmax activation function, and this gives the class probabilities (one per class); output is sent through the logistic activation function, and this gives the objectness score; outputs to not use any activation function, and they rep‐ resent the bounding box’s center coordinates, and its height and width We can now convert its dense layers to convolutional layers In fact, we don’t even need to retrain it, we can just copy the weights from the dense layers to the convolutional layers! Alternatively, we could have converted the CNN into an FCN before training Now suppose the last convolutional layer before the output layer (also called the bot‐ tleneck layer) outputs × feature maps when the network is fed a 224 × 224 image (see the left side of Figure 14-25) If we feed the FCN a 448 × 448 image (see the right side of Figure 14-25), the bottleneck layer will now output 14 × 14 feature maps.25 Since the dense output layer was replaced by a convolutional layer using 10 filters of size × 7, VALID padding and stride 1, the output will be composed of 10 features maps, each of size × (since 14 - + = 8) In other words, the FCN will process the whole image only once and it will output an × grid where each cell contains 10 numbers (5 class probabilities, objectness score and bounding box coordinates) It’s exactly like taking the original CNN and sliding it across the image using steps per row and steps per column: to visualize this, imagine chopping the original image into a 14 × 14 grid, then sliding a × window across this grid: there will be × = 64 possible locations for the window, hence × predictions However, the FCN approach is much more efficient, since the network only looks at the image once In fact, You Only Look Once (YOLO) is the name of a very popular object detec‐ tion architecture! 25 This assumes we used only SAME padding in the network: indeed, VALID padding would reduce the size of the feature maps Moreover, 448 can be neatly divided by several times until we reach 7, without any round‐ ing error If any layer uses a different stride than or 2, then there may be some rounding error, so again the feature maps may end up being smaller 474 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks Figure 14-25 A Fully Convolutional Network Processing a Small Image (left) and a Large One (right) You Only Look Once (YOLO) YOLO is an extremely fast and accurate object detection architecture proposed by Joseph Redmon et al in a 2015 paper26, and subsequently improved in 201627 (YOLOv2) and in 2018 28 (YOLOv3) It is so fast that it can run in realtime on a video (check out this nice demo) YOLOv3’s architecture is quite similar to the one we just discussed, but with a few important differences: 26 “You Only Look Once: Unified, Real-Time Object Detection,” J Redmon, S Divvala, R Girshick, A Farhadi (2015) 27 “YOLO9000: Better, Faster, Stronger,” J Redmon, A Farhadi (2016) 28 “YOLOv3: An Incremental Improvement,” J Redmon, A Farhadi (2018) Object Detection | 475 • First, it outputs bounding boxes for each grid cell (instead of just 1), and each bounding box comes with an objectness score It also outputs 20 class probabili‐ ties per grid cell, as it was trained on the PASCAL VOC dataset, which contains 20 classes That’s a total of 45 numbers per grid cell (5 * bounding box coordi‐ nates, plus objectness scores, plus 20 class probabilities) • Second, instead of predicting the absolute coordinates of the bounding box cen‐ ters, YOLOv3 predicts an offset relative to the coordinates of the grid cell, where (0, 0) means the top left of that cell, and (1, 1) means the bottom right For each grid cell, YOLOv3 is trained to predict only bounding boxes whose center lies in that cell (but the bounding box itself generally extends well beyond the grid cell) YOLOv3 applies the logistic activation function to the bounding box coordinates to ensure they remain in the to range • Third, before training the neural net, YOLOv3 finds representative bounding box dimensions, called anchor boxes (or bounding box priors): it does this by applying the K-Means algorithm (see ???) to the height and width of the training set bounding boxes For example, if the training images contain many pedes‐ trians, then one of the anchor boxes will likely have the dimensions of a typical pedestrian Then when the neural net predicts bounding boxes per grid cell, it actually predicts how much to rescale each of the anchor boxes For example, suppose one anchor box is 100 pixels tall and 50 pixels wide, and the network predicts, say, a vertical rescaling factor of 1.5 and a horizontal rescaling of 0.9 (for one of the grid cells), this will result in a predicted bounding box of size 150 × 45 pixels To be more precise, for each grid cell and each anchor box, the network predicts the log of the vertical and horizontal rescaling factors Having these pri‐ ors makes the network more likely to predict bounding boxes of the appropriate dimensions, and it also speeds up training since it will more quickly learn what reasonable bounding boxes look like • Fourth, the network is trained using images of different scales: every few batches during training, the network randomly chooses a new image dimension (from 330 × 330 to 608 × 608 pixels) This allows the network to learn to detect objects at different scales Moreover, it makes it possible to use YOLOv3 at different scales: the smaller scale will be less accurate but faster than the larger scale, so you can choose the right tradeoff for your use case There are a few more innovations you might be interested in, such as the use of skip connections to recover some of the spatial resolution that is lost in the CNN (we will discuss this shortly when we look at semantic segmentation) Moreover, in the 2016 paper, the authors introduce the YOLO9000 model that uses hierarchical classifica‐ tion: the model predicts a probability for each node in a visual hierarchy called Word‐ Tree This makes it possible for the network to predict with high confidence that an image represents, say, a dog, even though it is unsure what specific type of dog it is 476 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks So I encourage you to go ahead and read all three papers: they are quite pleasant to read, and it is an excellent example of how Deep Learning systems can be incremen‐ tally improved Mean Average Precision (mAP) A very common metric used in object detection tasks is the mean Average Precision (mAP) “Mean Average” sounds a bit redundant, doesn’t it? To understand this met‐ ric, let’s go back to two classification metrics we discussed in Chapter 3: precision and recall Remember the tradeoff: the higher the recall, the lower the precision You can visualize this in a Precision/Recall curve (see Figure 3-5) To summarize this curve into a single number, we could compute its Area Under the Curve (AUC) But note that the Precision/Recall curve may contain a few sections where precision actually goes up when recall increases, especially at low recall values (you can see this at the top left of Figure 3-5) This is one of the motivations for the mAP metric Suppose the classifier has a 90% precision at 10% recall, but a 96% precision at 20% recall: there’s really no tradeoff here: it simply makes more sense to use the classifier at 20% recall rather than at 10% recall, as you will get both higher recall and higher precision So instead of looking at the precision at 10% recall, we should really be looking at the maximum precision that the classifier can offer with at least 10% recall It would be 96%, not 90% So one way to get a fair idea of the model’s performance is to compute the maximum precision you can get with at least 0% recall, then 10% recall, 20%, and so on up to 100%, and then calculate the mean of these maximum precisions This is called the Average Precision (AP) metric Now when there are more than classes, we can compute the AP for each class, and then compute the mean AP (mAP) That’s it! However, in an object detection systems, there is an additional level of complexity: what if the system detected the correct class, but at the wrong location (i.e., the bounding box is completely off)? Surely we should not count this as a positive predic‐ tion So one approach is to define an IOU threshold: for example, we may consider that a prediction is correct only if the IOU is greater than, say, 0.5, and the predicted class is correct The corresponding mAP is generally noted mAP@0.5 (or mAP@50%, or sometimes just AP50) In some competitions (such as the Pascal VOC challenge), this is what is done In others (such as the COCO competition), the mAP is computed for different IOU thresholds (0.50, 0.55, 0.60, …, 0.95), and the final metric is the mean of all these mAPs (noted AP@[.50:.95] or AP@[.50:0.05:.95]) Yes, that’s a mean mean average Several YOLO implementations built using TensorFlow are available on github, some with pretrained weights At the time of writing, they are based on TensorFlow 1, but by the time you read this, TF implementations will certainly be available Moreover, other object detection models are available in the TensorFlow Models project, many Object Detection | 477 with pretrained weights, and some have even been ported to TF Hub, making them extremely easy to use, such as SSD29 and Faster-RCNN.30, which are both quite popu‐ lar SSD is also a “single shot” detection model, quite similar to YOLO, while Faster RCNN is more complex: the image first goes through a CNN, and the output is passed to a Region Proposal Network (RPN) which proposes bounding boxes that are most likely to contain an object, and a classifier is run for each bounding box, based on the cropped output of the CNN The choice of detection system depends on many factors: speed, accuracy, available pretrained models, training time, complexity, etc The papers contain tables of met‐ rics, but there is quite a lot of variability in the testing environments, and the technol‐ ogies evolve so fast that it is difficulty to make a fair comparison that will be useful for most people and remain valid for more than a few months Great! So we can locate objects by drawing bounding boxes around them But per‐ haps you might want to be a bit more precise Let’s see how to go down to the pixel level Semantic Segmentation In semantic segmentation, each pixel is classified according to the class of the object it belongs to (e.g., road, car, pedestrian, building, etc.), as shown in Figure 14-26 Note that different objects of the same class are not distinguished For example, all the bicy‐ cles on the right side of the segmented image end up as one big lump of pixels The main difficulty in this task is that when images go through a regular CNN, they grad‐ ually lose their spatial resolution (due to the layers with strides greater than 1): so a regular CNN may end up knowing that there’s a person in the image, somewhere in the bottom left of the image, but it will not be much more precise than that 29 “SSD: Single Shot MultiBox Detector,” Wei Liu et al (2015) 30 “Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks,” Shaoqing Ren et al (2015) 478 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks Figure 14-26 Semantic segmentation Just like for object detection, there are many different approaches to tackle this prob‐ lem, some quite complex However, a fairly simple solution was proposed in the 2015 paper by Jonathan Long et al we discussed earlier They start by taking a pretrained CNN and turning into an FCN, as discussed earlier The CNN applies a stride of 32 to the input image overall (i.e., if you add up all the strides greater than 1), meaning the last layer outputs feature maps that are 32 times smaller than the input image This is clearly too coarse, so they add a single upsampling layer that multiplies the resolution by 32 There are several solutions available for upsampling (increasing the size of an image), such as bilinear interpolation, but it only works reasonably well up to ×4 or ×8 Instead, they used a transposed convolutional layer:31 it is equivalent to first stretching the image by inserting empty rows and columns (full of zeros), then per‐ forming a regular convolution (see Figure 14-27) Alternatively, some people prefer to think of it as a regular convolutional layer that uses fractional strides (e.g., 1/2 in Figure 14-27) The transposed convolutional layer can be initialized to perform some‐ thing close to linear interpolation, but since it is a trainable layer, it will learn to better during training 31 This type of layer is sometimes referred to as a deconvolution layer, but it does not perform what mathemati‐ cians call a deconvolution, so this name should be avoided Semantic Segmentation | 479 Figure 14-27 Upsampling Using a Transpose Convolutional Layer In a transposed convolution layer, the stride defines how much the input will be stretched, not the size of the filter steps, so the larger the stride, the larger the output (unlike for convolutional layers or pooling layers) TensorFlow Convolution Operations TensorFlow also offers a few other kinds of convolutional layers: • keras.layers.Conv1D creates a convolutional layer for 1D inputs, such as time series or text (sequences of letters or words), as we will see in ??? • keras.layers.Conv3D creates a convolutional layer for 3D inputs, such as 3D PET scan • Setting the dilation_rate hyperparameter of any convolutional layer to a value of or more creates an à-trous convolutional layer (“à trous” is French for “with holes”) This is equivalent to using a regular convolutional layer with a filter dila‐ ted by inserting rows and columns of zeros (i.e., holes) For example, a × filter equal to [[1,2,3]] may be dilated with a dilation rate of 4, resulting in a dilated filter [[1, 0, 0, 0, 2, 0, 0, 0, 3]] This allows the convolutional layer to 480 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks have a larger receptive field at no computational price and using no extra param‐ eters • tf.nn.depthwise_conv2d() can be used to create a depthwise convolutional layer (but you need to create the variables yourself) It applies every filter to every individual input channel independently Thus, if there are fn filters and fn′ input channels, then this will output fn × fn′ feature maps This solution is okay, but still too imprecise To better, the authors added skip con‐ nections from lower layers: for example, they upsampled the output image by a factor of (instead of 32), and they added the output of a lower layer that had this double resolution Then they upsampled the result by a factor of 16, leading to a total upsam‐ pling factor of 32 (see Figure 14-28) This recovered some of the spatial resolution that was lost in earlier pooling layers In their best architecture, they used a second similar skip connection to recover even finer details from an even lower layer: in short, the output of the original CNN goes through the following extra steps: upscale ×2, add the output of a lower layer (of the appropriate scale), upscale ×2, add the out‐ put of an even lower layer, and finally upscale ×8 It is even possible to scale up beyond the size of the original image: this can be used to increase the resolution of an image, which is a technique called super-resolution Figure 14-28 Skip layers recover some spatial resolution from lower layers Once again, many github repositories provide TensorFlow implementations of semantic segmentation (TensorFlow for now), and you will even find a pretrained instance segmentation model in the TensorFlow Models project Instance segmenta‐ tion is similar to semantic segmentation, but instead of merging all objects of the same class into one big lump, each object is distinguished from the others (e.g., it identifies each individual bicycle) At the present, they provide multiple implementa‐ tions of the Mask R-CNN architecture, which was proposed in a 2017 paper: it extends the Faster R-CNN model by additionally producing a pixel-mask for each bounding box So not only you get a bounding box around each object, with a set of estimated class probabilities, you also get a pixel mask that locates pixels in the bounding box that belong to the object Semantic Segmentation | 481 As you can see, the field of Deep Computer Vision is vast and moving fast, with all sorts of architectures popping out every year, all based on Convolutional Neural Net‐ works The progress made in just a few years has been astounding, and researchers are now focusing on harder and harder problems, such as adversarial learning (which attempts to make the network more resistant to images designed to fool it), explaina‐ bility (understanding why the network makes a specific classification), realistic image generation (which we will come back to in ???), single-shot learning (a system that can recognize an object after it has seen it just once), and much more Some even explore completely novel architectures, such as Geoffrey Hinton’s capsule networks32 (I pre‐ sented them in a couple videos, with the corresponding code in a notebook) Now on to the next chapter, where we will look at how to process sequential data such as time series using Recurrent Neural Networks and Convolutional Neural Networks Exercises What are the advantages of a CNN over a fully connected DNN for image classi‐ fication? Consider a CNN composed of three convolutional layers, each with × kernels, a stride of 2, and SAME padding The lowest layer outputs 100 feature maps, the middle one outputs 200, and the top one outputs 400 The input images are RGB images of 200 × 300 pixels What is the total number of parameters in the CNN? If we are using 32-bit floats, at least how much RAM will this network require when making a prediction for a single instance? What about when training on a mini-batch of 50 images? If your GPU runs out of memory while training a CNN, what are five things you could try to solve the problem? Why would you want to add a max pooling layer rather than a convolutional layer with the same stride? When would you want to add a local response normalization layer? Can you name the main innovations in AlexNet, compared to LeNet-5? What about the main innovations in GoogLeNet, ResNet, SENet and Xception? What is a Fully Convolutional Network? How can you convert a dense layer into a convolutional layer? What is the main technical difficulty of semantic segmentation? Build your own CNN from scratch and try to achieve the highest possible accu‐ racy on MNIST 32 “Matrix Capsules with EM Routing,” G Hinton, S Sabour, N Frosst (2018) 482 | Chapter 14: Deep Computer Vision Using Convolutional Neural Networks 10 Use transfer learning for large image classification a Create a training set containing at least 100 images per class For example, you could classify your own pictures based on the location (beach, mountain, city, etc.), or alternatively you can just use an existing dataset (e.g., from Tensor‐ Flow Datasets) b Split it into a training set, a validation set and a test set c Build the input pipeline, including the appropriate preprocessing operations, and optionally add data augmentation d Fine-tune a pretrained model on this dataset 11 Go through TensorFlow’s DeepDream tutorial It is a fun way to familiarize your‐ self with various ways of visualizing the patterns learned by a CNN, and to gener‐ ate art using Deep Learning Solutions to these exercises are available in ??? Exercises | 483 About the Author Aurélien Géron is a Machine Learning consultant A former Googler, he led the You‐ Tube video classification team from 2013 to 2016 He was also a founder and CTO of Wifirst from 2002 to 2012, a leading Wireless ISP in France; and a founder and CTO of Polyconseil in 2001, the firm that now manages the electric car sharing service Autolib’ Before this he worked as an engineer in a variety of domains: finance (JP Morgan and Société Générale), defense (Canada’s DOD), and healthcare (blood transfusion) He published a few technical books (on C++, WiFi, and internet architectures), and was a Computer Science lecturer in a French engineering school A few fun facts: he taught his three children to count in binary with their fingers (up to 1023), he studied microbiology and evolutionary genetics before going into soft‐ ware engineering, and his parachute didn’t open on the second jump Colophon The animal on the cover of Hands-On Machine Learning with Scikit-Learn and Ten‐ sorFlow is the fire salamander (Salamandra salamandra), an amphibian found across most of Europe Its black, glossy skin features large yellow spots on the head and back, signaling the presence of alkaloid toxins This is a possible source of this amphibian’s common name: contact with these toxins (which they can also spray short distances) causes convulsions and hyperventilation Either the painful poisons or the moistness of the salamander’s skin (or both) led to a misguided belief that these creatures not only could survive being placed in fire but could extinguish it as well Fire salamanders live in shaded forests, hiding in moist crevices and under logs near the pools or other freshwater bodies that facilitate their breeding Though they spend most of their life on land, they give birth to their young in water They subsist mostly on a diet of insects, spiders, slugs, and worms Fire salamanders can grow up to a foot in length, and in captivity, may live as long as 50 years The fire salamander’s numbers have been reduced by destruction of their forest habi‐ tat and capture for the pet trade, but the greatest threat is the susceptibility of their moisture-permeable skin to pollutants and microbes Since 2014, they have become extinct in parts of the Netherlands and Belgium due to an introduced fungus Many of the animals on O’Reilly covers are endangered; all of them are important to the world To learn more about how you can help, go to animals.oreilly.com The cover image is from Wood’s Illustrated Natural History The cover fonts are URW Typewriter and Guardian Sans The text font is Adobe Minion Pro; the heading font is Adobe Myriad Condensed; and the code font is Dalton Maag’s Ubuntu Mono ...SECOND EDITION Hands- on Machine Learning with Scikit- Learn, Keras, and TensorFlow Concepts, Tools, and Techniques to Build Intelligent Systems Aurélien Géron Beijing Boston Farnham Sebastopol Tokyo... Hands- on Machine Learning with Scikit- Learn, Keras, and TensorFlow by Aurélien Géron Copyright © 2019 Aurélien Géron All rights reserved Printed in the United States of America Published by O’Reilly. .. O’Reilly logo is a registered trademark of O’Reilly Media, Inc Hands- on Machine Learning with Scikit- Learn, Keras, and TensorFlow, the cover image, and related trade dress are trademarks of O’Reilly