Module 2
GCNs, AEs, VAEs, AAEs
2
Graph Convolutional Networks
3
1
2
3
4
Adjacency matrix
Summing up
1-hop neighbors
Summing up
2-hop neighbors
A primer on Graphs
4
1
2
3
4
Adjacency matrix
Degree matrix
Caveats
Possible solutions
A primer on Graphs
5
Types of problems
6
Type 1: Supervised drug discovery
Type 2: Semi-supervised classification of documents in citation networks
Type 3: Link prediction on knowledge graphs
Applications
7
GCNs by Kipf & Welling
8
GCNs in action
9
Original GCN
GCN with edge-features
GCNs with edge features
10
Potential Applications
11
Potential Applications
Dimensionality Reduction (PCA)
13
Simple AutoEncoders (AEs)
Output
Molecular
Fingerprints
Input
Molecular
Fingerprints
Latent
Layer
Encoder
Decoder
Simple AutoEncoders do not have generative capabilities
14
Variational AutoEncoders (VAEs)
generation_loss = mean(square(generated_image-real_image))
latent_loss = KL-Divergence(latent_variable, unit Gaussian)
loss = generation_loss + latent_loss
15
Variational AutoEncoders (VAEs)
16
Limitations of VAEs
VAEs often leave regions in the space of the prior distribution that do not map to realistic samples from the data.
AAEs aim to improve this by encouraging the output of the encoder to fill the space of the prior distribution entirely.
17
Adversarial AutoEncoders (AAEs)
18
Let’s decode AAEs
19
Let’s decode AAEs
Reconstruction Phase
20
Let’s decode AAEs
Regularization Phase – Training the discriminator
21
Let’s decode AAEs
Regularization Phase – Training the generator (encoder)