Book Image

Advanced Deep Learning with Python

By : Ivan Vasilev
Book Image

Advanced Deep Learning with Python

By: Ivan Vasilev

Overview of this book

In order to build robust deep learning systems, you’ll need to understand everything from how neural networks work to training CNN models. In this book, you’ll discover newly developed deep learning models, methodologies used in the domain, and their implementation based on areas of application. You’ll start by understanding the building blocks and the math behind neural networks, and then move on to CNNs and their advanced applications in computer vision. You'll also learn to apply the most popular CNN architectures in object detection and image segmentation. Further on, you’ll focus on variational autoencoders and GANs. You’ll then use neural networks to extract sophisticated vector representations of words, before going on to cover various types of recurrent networks, such as LSTM and GRU. You’ll even explore the attention mechanism to process sequential data without the help of recurrent neural networks (RNNs). Later, you’ll use graph neural networks for processing structured data, along with covering meta-learning, which allows you to train neural networks with fewer training samples. Finally, you’ll understand how to apply deep learning to autonomous vehicles. By the end of this book, you’ll have mastered key deep learning concepts and the different applications of deep learning models in the real world.
Table of Contents (17 chapters)
Free Chapter
1
Section 1: Core Concepts
3
Section 2: Computer Vision
8
Section 3: Natural Language and Sequence Processing
12
Section 4: A Look to the Future

Introducing Graph NNs

Before learning about graph NNs (GNNs), let's look at why we need graph networks in the first place. We'll start by defining a graph, which is a set of objects (also known as nodes or vertices) where some pairs of objects have connections (or edges) between them.

In this section, we'll use several survey papers as resources, most notably A Comprehensive Survey on Graph Neural Networks (https://arxiv.org/abs/1901.00596), which contains some quotes and images.

A graph has the following properties:

  • We'll represent the graph as , where V is the set of nodes and E is the set of edges.
  • The expression describes an edge between two nodes, .
  • An adjacency matrix, , where n is the number of graph nodes. This is written as if an edge exists and if it doesn't.
  • Graphs can be directed when the edges have a direction and undirected when they...