1 of 26

2022.11.18

제네시스랩 신재영

NeurIPS 2018

2 of 26

Contents

Glow: Generative Flow with Invertible 1×1 Convolutions

Introduction

Types of

generative models

​

Motivation

01

Background

Change of

variable theorem

Normalizing Flows

RealNVP

02

Architecture

03

Experiments

04

Overview

Components

Qualitative Experiment

Quantitative Experiment

3 of 26

Types of Generative Models

Introduction

4 of 26

  • Exact latent-variable inference and log-likelihood evaluation
    • VAEs infer only approximately the value of the latents
    • GANs have no encoder at all to infer latents
    • Glow directly infers the latents and optimizes exact log-likelihood of the data

​

​

​

  • Efficient inference
    • Autoregressive models is inefficient on parallel hardware
    • Glow is efficient to parallelize

​

Motivation

Introduction

5 of 26

 

Introduction

Types of Generative Models

6 of 26

 

Background

Change of Variable Theorem

7 of 26

​

Multi variable version:

​

Jacobian Matrix

Background

Change of Variable Theorem

​

Determinant

8 of 26

Background

Normalizing Flows

9 of 26

According to the inverse func theorem

According to a property of Jacobians of invertible func

Background

Normalizing Flows

10 of 26

 

Background

Normalizing Flows

11 of 26

 

Background

RealNVP

12 of 26

Condition 1: “It is easily invertible.”

​

​

​

​

Condition 2: “Its Jacobian determinant is easy to compute .”

​

​

​

​

Some dimensions remain unchanged

To make sure all the inputs have a chance to be altered, the model reverses the ordering in each layer

det(J) =

Background

RealNVP

13 of 26

Between layers of the RealNVP flow, the ordering of channels is reversed so that all the data dimensions have a chance to be altered.

​

A 1×1 convolution with equal number of input and output channels is a generalization of any permutation of the channel ordering.

Architecture

Overview

14 of 26

Components

Architecture

15 of 26

Invertible 1x1 convolution

Architecture

 

16 of 26

Actnorm

Architecture

 

17 of 26

Architecture

Overall Architecture

squeeze

18 of 26

Qualitative Experiment

Experiments

19 of 26

Qualitative Experiment

Experiments

20 of 26

Quantitative Experiment

Experiments

The affine coupling models converge faster than the additive coupling models.

The increase in wallclock time for the invertible 1 × 1 convolution model was only ≈ 7%,

thus the operation is computationally efficient as well.

21 of 26

THANK YOU FOR LISTENING

22 of 26

  • Autoregressive models
    • Advantage: Simplicity
    • Disadvantage: limited parallelizability of synthesis

​

  • Variational autoencoders
    • Advantage: parallelizability of training and synthesis
    • Disadvantage: challenging to optimize

​

  • Flow-based generative model
    • NICE: Non-linear Independent Component Estimation
    • Density estimation using Real NVP
    • Glow: Generative Flow with Invertible 1x1 Convolutions

Introduction

Flow based generative models

23 of 26

  • Exact latent-variable inference and log-likelihood evaluation
    • VAEs infer only approximately the value of the latents
    • GANs have no encoder at all to infer latents
    • Glow directly infers the latents and optimizes exact log-likelihood of the data

​

  • Efficient inference and efficient synthesis
    • Autoregressive models is inefficient on parallel hardware
    • Glow is efficient to parallelize

​

  • Useful latent space for downstream tasks
    • Autoregressive models have unknown marginal distributions
    • In GANs, dataponts can usually not be directly represented in a latent space
    • Glow and VAEs infer meaningful latents

​

  • Significant potential for memory savings
    • Computing gradients requires a constant amount of memory

​

Motivation

Introduction

24 of 26

Introduction

​

Flow-based generative models have so far gained little attention in the research community compared to GANs (Goodfellow et al., 2014) and VAEs (Kingma and Welling, 2013). Some of the merits of flow-based generative models include:

​

• Exact latent-variable inference and log-likelihood evaluation

​

• Efficient inference and efficient synthesis

​

• Useful latent space for downstream tasks

​

• Significant potential for memory savings

​

25 of 26

 

Background

Change of Variable Theorem

26 of 26

Between layers of the RealNVP flow, the ordering of channels is reversed so that all the data dimensions have a chance to be altered.

​

A 1×1 convolution with equal number of input and output channels is a generalization of any permutation of the channel ordering.

Architecture

Overview