Gaussian processes - Refresher and some more in insig ights - - PowerPoint PPT Presentation

โ–ถ
gaussian processes refresher and some more in insig ights
SMART_READER_LITE
LIVE PREVIEW

Gaussian processes - Refresher and some more in insig ights - - PowerPoint PPT Presentation

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL Gaussian processes - Refresher and some more in insig ights Marcel Lthi Graphics and Vision Research Group Department of Mathematics and Computer Science University


slide-1
SLIDE 1

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian processes

  • Refresher and some more in

insig ights

Marcel Lรผthi

Graphics and Vision Research Group Department of Mathematics and Computer Science University of Basel

slide-2
SLIDE 2

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Outline

  • Gaussian process โ€“ refresher
  • Vector-valued and scalar valued Gaussian processes
  • The space of samples
  • Gaussian process regression

2

slide-3
SLIDE 3

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian process: Formal definition

A Gaussian process ๐‘ž ๐‘ฃ = ๐ป๐‘„ ๐œˆ, ๐‘™ is a probability distribution over functions ๐‘ฃ โˆถ ๐’ด โ†’ โ„๐‘’ such that every finite restriction to function values ๐‘ฃ๐‘Œ = (๐‘ฃ ๐‘ฆ1 , โ€ฆ , ๐‘ฃ ๐‘ฆ๐‘œ ) is a multivariate normal distribution ๐‘ž(๐‘ฃ๐‘Œ) = ๐‘‚ ๐œˆ๐‘Œ, ๐‘™๐‘Œ๐‘Œ .

slide-4
SLIDE 4

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian process: Illustration

Restriction to values at points ๐‘Œ = {๐‘ฆ} ๐‘ฃ ๐‘ฆ = ๐‘ฃ1 ๐‘ฆ ๐‘ฃ2 ๐‘ฆ โˆผ ๐‘‚ ๐œˆ๐‘Œ, ๐‘™๐‘Œ๐‘Œ = ๐‘‚ ๐œˆ1(๐‘ฆ) ๐œˆ2(๐‘ฆ) , ๐‘™11(๐‘ฆ, ๐‘ฆ) ๐‘™12(๐‘ฆ, ๐‘ฆ) ๐‘™21(๐‘ฆ, ๐‘ฆ) ๐‘™22(๐‘ฆ, ๐‘ฆ)

๐œˆ(๐‘ฆ) ๐‘ฆ

slide-5
SLIDE 5

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Restriction to values at points ๐‘Œ = {๐‘ฆ, ๐‘ฆโ€ฒ} ๐‘ฃ(๐‘ฆ) ๐‘ฃ(๐‘ฆโ€ฒ) = ๐‘ฃ1 ๐‘ฆ ๐‘ฃ2(๐‘ฆ) ๐‘ฃ1 ๐‘ฆโ€ฒ ๐‘ฃ2(๐‘ฆโ€ฒ) โˆผ ๐‘‚ ๐œˆ๐‘Œ, ๐‘™๐‘Œ๐‘Œ = ๐‘‚ ๐œˆ1(๐‘ฆ) ๐œˆ2(๐‘ฆ) ๐œˆ1(๐‘ฆโ€ฒ) ๐œˆ2(๐‘ฆโ€ฒ) , k11(๐‘ฆ, ๐‘ฆ) k12(๐‘ฆ, ๐‘ฆ) k21(๐‘ฆ, ๐‘ฆ) k22(๐‘ฆ, ๐‘ฆ) k11(๐‘ฆ, ๐‘ฆโ€ฒ) k12(๐‘ฆ, ๐‘ฆโ€ฒ) k21(๐‘ฆ, ๐‘ฆโ€ฒ) k22(๐‘ฆ, ๐‘ฆโ€ฒ) k11(๐‘ฆโ€ฒ, ๐‘ฆ) k12(๐‘ฆโ€ฒ, ๐‘ฆ) k21(๐‘ฆโ€ฒ, ๐‘ฆ) k22(๐‘ฆโ€ฒ, ๐‘ฆ) k11(๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ) k12(๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ) k21(๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ) k22(๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ)

๐‘ฃ(๐‘ฆโ€ฒ) ๐‘ฆโ€ฒ ๐‘ฃ(๐‘ฆ) ๐‘ฆ

Gaussian process: Illustration

slide-6
SLIDE 6

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

ex

Defining a Gaussian process

A Gaussian process ๐ป๐‘„ ๐œˆ, ๐‘™ is completely specified by a mean function ๐œˆ and covariance function (or kernel) ๐‘™.

  • ๐œˆ: ๐’ด โ†’ โ„๐‘’ defines how the average deformation looks like
  • ๐‘™: ๐’ด ร— ๐’ด โ†’ โ„๐‘’ร—๐‘’ defines how it can deviate from the mean
  • Must be positive semi-definite
slide-7
SLIDE 7

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Marginalization property

Let ๐‘Œ = ๐‘ฆ1, โ€ฆ , ๐‘ฆ๐‘œ and ๐‘ = ๐‘ง1, โ€ฆ , ๐‘ง๐‘› p ๐‘Œ, ๐‘ = ๐‘‚ ๐œˆ๐‘Œ ๐œˆ๐‘ , ฮฃ๐‘Œ๐‘Œ ฮฃ๐‘Œ๐‘ ฮฃ๐‘๐‘Œ ฮฃ๐‘๐‘ The marginal distribution ๐‘ž ๐‘Œ = โˆซ ๐‘ž ๐‘Œ, ๐‘ ๐‘’๐‘ is given by ๐‘ž ๐‘Œ = ๐‘‚ ๐œˆ๐‘Œ, ฮฃ๐‘Œ๐‘Œ .

  • Evaluating the Gaussian process ๐ป๐‘„ ๐œˆ, ๐‘™ defined on domain ๐’ด at the points ๐‘Œ =

(๐‘ฆ1, โ€ฆ , ๐‘ฆ๐‘œ) is marginalizing out (ignoring) all random variables ๐’ด \ ๐‘Œ

slide-8
SLIDE 8

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Conceptual formulation: Continuous: ๐ป๐‘„(๐œˆ, ๐‘™) Practical implementation: Discrete: ๐‘‚(๐œˆ, ๐ฟ)

From continuous to discrete

slide-9
SLIDE 9

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

We can write u โˆผ ๐ป๐‘„ ๐œˆ, ๐‘™ as ๐‘ฃ โˆผ ๐œˆ + ฯƒ๐‘—=1

โˆž ๐›ฝ๐‘—

๐œ‡๐‘— ๐œš๐‘—, ๐›ฝ๐‘— โˆผ ๐‘‚(0, 1)

  • ๐œš๐‘— is the eigenfunction with associated eigenvalue ๐œ‡๐‘— of the

linear operator [๐‘ˆ๐‘™๐‘ฃ](๐‘ฆ) = โˆซ ๐‘™ ๐‘ฆ, ๐‘ก ๐‘ฃ ๐‘ก ๐‘’๐‘ก

The Karhunen-Loรจve expansion

slide-10
SLIDE 10

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

  • The total variance of the process

๐‘ฃ โˆผ ๐ป๐‘„ ๐œˆ, ๐‘™ is given by ฯƒ๐‘—=1

โˆž ๐œ‡๐‘— .

  • Observatio

ion: Most variance is explained by the first eigenfunctions

  • Eigenvalue ๐œ‡๐‘—
  • Interpretation: Variance of ๐›ฝ๐‘—

๐œ‡๐‘—๐œš๐‘—

Eigenvalues and variance

slide-11
SLIDE 11

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Main idea: Represent process using only the first ๐‘  components

  • We have a finite, parametric representation of the process.
  • Any deformation ๐‘ฃ is determined by the coefficients

๐›ฝ = ๐›ฝ1, โ€ฆ , ๐›ฝ๐‘  ๐‘ž ๐‘ฃ = ๐‘ž ๐›ฝ = เท‘

๐‘—=1 ๐‘ 

1 2๐œŒ exp(โˆ’๐›ฝ๐‘—

2/2)

๐‘ฃ = ๐œˆ + เท

๐‘—=1 ๐‘ 

๐›ฝ๐‘— ๐œ‡๐‘— ๐œš๐‘—, ๐›ฝ๐‘— โˆผ ๐‘‚(0, 1)

Low-rank approximation

slide-12
SLIDE 12

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Vector-valued and single valued Gaussian processes

slide-13
SLIDE 13

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Scalar-valued Gaussian processes

Vector-valu lued (th (this is cou

  • urse)
  • Samples u are deformation fields:

๐‘ฃ: โ„๐‘œ โ†’ โ„๐‘’ Sc Scalar-valu lued (m (more common)

  • Samples f are real-valued functions

๐‘” โˆถ โ„๐‘œ โ†’ โ„

slide-14
SLIDE 14

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Scalar-valued Gaussian processes

Vector-valu lued (th (this is cou

  • urse)

๐‘ฃ โˆผ ๐ป๐‘„ ิฆ ๐œˆ, ๐’ ิฆ ๐œˆ: ๐’ด โ†’ โ„๐‘’ ๐’: ๐’ด ร— ๐’ด โ†’ โ„๐‘’ร—๐‘’ Sc Scalar-valu lued (m (more common) ๐‘” โˆผ ๐ป๐‘„ ๐œˆ, ๐‘™ ๐œˆ: ๐’ด โ†’ โ„ ๐‘™: ๐’ด ร— ๐’ด โ†’ โ„

slide-15
SLIDE 15

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

A connection

Matrix-valued kernels can be reinterpreted as scalar-valued kernels: Matrix valued kernel: ๐’: ๐’ด ร— ๐’ด โ†’ โ„๐’†ร—๐’† Scalar valued kernel: ๐‘™: ๐’ด ร— 1. . ๐‘’ ร— ๐’ด ร— 1. . ๐‘’ โ†’ โ„ Bijection: : Define ๐‘™( ๐‘ฆ, ๐‘— , ๐‘ฆโ€ฒ, ๐‘˜ = ๐’ ๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ ๐‘—,๐‘˜

slide-16
SLIDE 16

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

GP Regression โ€“ Vector-valued case

21

๐‘ณ = ๐‘™11 ๐‘ฆ1, ๐‘ฆ1 ๐‘™12 ๐‘ฆ1, ๐‘ฆ1 ๐‘™21 ๐‘ฆ1, ๐‘ฆ1 ๐‘™22 ๐‘ฆ1, ๐‘ฆ1 โ€ฆ ๐‘™11 ๐‘ฆ1, ๐‘ฆ๐‘œ ๐‘™12 ๐‘ฆ1, ๐‘ฆ๐‘œ ๐‘™21 ๐‘ฆ1, ๐‘ฆ๐‘œ ๐‘™22 ๐‘ฆ1, ๐‘ฆ๐‘œ โ‹ฎ โ‹ฎ ๐‘™11 ๐‘ฆ๐‘œ, ๐‘ฆ1 ๐‘™12 ๐‘ฆ๐‘œ, ๐‘ฆ1 ๐‘™21 ๐‘ฆ๐‘œ, ๐‘ฆ1 ๐‘™22 ๐‘ฆ๐‘œ, ๐‘ฆ1 โ€ฆ ๐‘™11 ๐‘ฆ๐‘œ, ๐‘ฆ๐‘œ ๐‘™12 ๐‘ฆ๐‘œ, ๐‘ฆ๐‘œ ๐‘™21 ๐‘ฆ๐‘œ, ๐‘ฆ๐‘œ ๐‘™22 ๐‘ฆ๐‘œ, ๐‘ฆ๐‘œ

๐ฟ = ๐‘™ (๐‘ฆ1, 1), (๐‘ฆ1, 1) ๐‘™ (๐‘ฆ1, 1), (๐‘ฆ1, 2) ๐‘™ ๐‘ฆ1, 2 , (๐‘ฆ1, 1) ๐‘™ ๐‘ฆ1, 2 , (๐‘ฆ1, 2) โ€ฆ ๐‘™ (๐‘ฆ1, 1), (๐‘ฆ๐‘œ, 1) ๐‘™ (๐‘ฆ1, 1), (๐‘ฆ๐‘œ, 2) ๐‘™ ๐‘ฆ1, 2 , (๐‘ฆ๐‘œ, 1) ๐‘™ ๐‘ฆ1, 2 , (๐‘ฆ๐‘œ, 2) โ‹ฎ โ‹ฎ ๐‘™ (๐‘ฆ๐‘œ, 1), (๐‘ฆ1, 1) ๐‘™ (๐‘ฆ๐‘œ, 1), (๐‘ฆ1, 2) ๐‘™ ๐‘ฆ๐‘œ, 2 , (๐‘ฆ1, 1) ๐‘™ ๐‘ฆ๐‘œ, 2 , (๐‘ฆ1, 2) โ€ฆ ๐‘™ (๐‘ฆ๐‘œ, 1), (๐‘ฆ๐‘œ, 1) ๐‘™ (๐‘ฆ๐‘œ, 1), (๐‘ฆ๐‘œ, 2) ๐‘™ ๐‘ฆ๐‘œ, 2 , (๐‘ฆ๐‘œ, 1) ๐‘™ ๐‘ฆ๐‘œ, 2 , (๐‘ฆ๐‘œ, 2)

slide-17
SLIDE 17

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

A connection

Matrix-valued kernels can be reinterpreted as scalar-valued kernels: Matrix valued kernel: ๐’: ๐’ด ร— ๐’ด โ†’ โ„๐’†ร—๐’† Scalar valued kernel: ๐‘™: ๐’ด ร— 1. . ๐‘’ ร— ๐’ด ร— 1. . ๐‘’ โ†’ โ„ Bijection: : Define ๐‘™( ๐‘ฆ, ๐‘— , ๐‘ฆโ€ฒ, ๐‘˜ = ๐’ ๐‘ฆโ€ฒ, ๐‘ฆโ€ฒ ๐‘—,๐‘˜ All the theory developed for the scalar-valued GPs holds also for vector-valued GPs!

slide-18
SLIDE 18

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Sampling revisited

slide-19
SLIDE 19

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Finite views on infinite objects

24

Gaussian process Infinite dimensional Finite dimensional Continuous domain Finite domain (Marginalization) Finite rank (KL- Expansion)

slide-20
SLIDE 20

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

The space of samples

Sampling from ๐ป๐‘„ ๐œˆ, ๐‘™ is done using the corresponding normal distribution ๐‘‚( ิฆ ๐œˆ, K) Algorithm for sampling (slightly inefficient) 1. Do an SVD: K = ๐‘‰๐ธ2๐‘‰๐‘ˆ

  • 2. Draw a normal vector ๐›ฝ โˆผ ๐‘‚ 0, ๐ฝ๐‘œร—๐‘œ
  • 3. Compute ิฆ

๐œˆ + ๐‘‰๐ธ๐›ฝ

25

slide-21
SLIDE 21

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

The space of samples

  • From K = ๐‘‰๐ธ2๐‘‰๐‘ˆ(using that ๐‘‰๐‘ˆ๐‘‰ = ๐ฝ) we have that

K๐‘‰๐ธโˆ’1 = ๐‘‰๐ธ

  • Any sample

๐‘ก = ิฆ ๐œˆ + ๐‘‰๐ธ๐›ฝ = ิฆ ๐œˆ + K๐‘‰๐ธโˆ’1๐›ฝ = ๐œˆ + K๐›พ is a linear combinations of the columns of K. Two ways to represent sample:

  • 1. KL-Expansion: ๐‘ก = ิฆ

๐œˆ + ฯƒ๐‘— ๐‘’๐‘—๐›ฝ๐‘—๐‘ฃ๐‘—

  • 2. Linear combination of kernels: ๐‘ก = ิฆ

๐œˆ + ฯƒ๐‘˜ ๐›พ๐‘™๐‘˜

26

slide-22
SLIDE 22

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Four examples covariance functions

27

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = เท

๐‘—=1 3

๐‘”

๐‘— ๐‘ฆ ๐‘” ๐‘—(๐‘ฆโ€ฒ)

๐‘”

1 ๐‘ฆ = sin ๐‘ฆ , ๐‘” 2 ๐‘ฆ = ๐‘ฆ, ๐‘” 3 ๐‘ฆ = cos(๐‘ฆ 2)

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘” ๐‘ฆ ๐‘” ๐‘ฆโ€ฒ f x = (1 โˆ’ ๐‘ก ๐‘ฆ )2๐‘ฆ2 + ๐‘ก ๐‘ฆ sin ๐‘ฆ2

slide-23
SLIDE 23

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Four examples covariance functions

28

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐œ€(๐‘ฆ, ๐‘ฆโ€ฒ)

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 9

slide-24
SLIDE 24

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 1

29

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘” ๐‘ฆ ๐‘”(๐‘ฆโ€ฒ)

slide-25
SLIDE 25

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 1

30

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘” ๐‘ฆ ๐‘”(๐‘ฆโ€ฒ)

slide-26
SLIDE 26

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 1

31

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘” ๐‘ฆ ๐‘”(๐‘ฆโ€ฒ)

slide-27
SLIDE 27

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 2

32

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = เท

๐‘—=1 3

๐‘”

๐‘— ๐‘ฆ ๐‘” ๐‘—(๐‘ฆโ€ฒ)

slide-28
SLIDE 28

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 2

33 ๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = เท

๐‘—=1 3

๐‘”

๐‘— ๐‘ฆ ๐‘” ๐‘—(๐‘ฆโ€ฒ)

slide-29
SLIDE 29

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 2

34

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = เท

๐‘—=1 3

๐‘”

๐‘— ๐‘ฆ ๐‘” ๐‘—(๐‘ฆโ€ฒ)

slide-30
SLIDE 30

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 3

35

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 9

slide-31
SLIDE 31

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 3

36

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 9

slide-32
SLIDE 32

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 3

37

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 9

slide-33
SLIDE 33

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 4

38

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐œ€(๐‘ฆ, ๐‘ฆโ€ฒ)

slide-34
SLIDE 34

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 4

39

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐œ€(๐‘ฆ, ๐‘ฆโ€ฒ)

slide-35
SLIDE 35

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example 4

40

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐œ€(๐‘ฆ, ๐‘ฆโ€ฒ)

slide-36
SLIDE 36

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian process regression revisited

slide-37
SLIDE 37

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian process regression

  • Given: observations {(๐‘ฆ1, ๐‘ง1), โ€ฆ , ๐‘ฆ๐‘œ, ๐‘ง๐‘œ }
  • Model: ๐‘ง๐‘— = ๐‘” ๐‘ฆ๐‘— + ๐œ—, ๐‘” โˆผ ๐ป๐‘„(๐œˆ, ๐‘™)
  • Goal: compute p(๐‘งโˆ—|๐‘ฆโˆ—, ๐‘ฆ1, โ€ฆ , ๐‘ฆ๐‘œ, ๐‘ง1, โ€ฆ , ๐‘ง๐‘œ)

53

๐‘ฆ1 ๐‘ฆ2 ๐‘ฆ๐‘œ ๐‘ฆโˆ— ๐‘งโˆ—

slide-38
SLIDE 38

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Gaussian process regression

  • Solution given by posterior process ๐ป๐‘„ ๐œˆ๐‘ž, ๐‘™๐‘ž with

๐œˆ๐‘ž(๐‘ฆโˆ—) = ๐ฟ ๐‘ฆโˆ—, ๐‘Œ ๐ฟ ๐‘Œ, ๐‘Œ + ๐œ2๐ฝ โˆ’1๐‘ง ๐‘™๐‘ž ๐‘ฆโˆ—, ๐‘ฆโˆ—โ€ฒ = ๐‘™ ๐‘ฆโˆ—, ๐‘ฆโˆ—โ€ฒ โˆ’ ๐ฟ ๐‘ฆโˆ—, ๐‘Œ ๐ฟ ๐‘Œ, ๐‘Œ + ๐œ2๐ฝ โˆ’1๐ฟ ๐‘Œ, ๐‘ฆโˆ—

โ€ฒ

  • The covariance is independent of the value at the training points
  • Structure of posterior GP determined solely by kernel.

54

slide-39
SLIDE 39

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

60

slide-40
SLIDE 40

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example: Gaussian kernel

61

ฯƒ = 1

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 ๐œ2

slide-41
SLIDE 41

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

62

  • Gaussian kernel (๐œ = 1)
slide-42
SLIDE 42

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Example: Gaussian kernel

63

๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp โˆ’ ๐‘ฆ โˆ’ ๐‘ฆโ€ฒ 2 ๐œ2

ฯƒ = 3

slide-43
SLIDE 43

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

64

  • Gaussian kernel (๐œ = 5)
slide-44
SLIDE 44

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Periodic kernels

  • Define ๐‘ฃ ๐‘ฆ =

cos ๐‘ฆ sin(๐‘ฆ)

  • ๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = exp(โˆ’โ€–(๐‘ฃ ๐‘ฆ โˆ’ ๐‘ฃ ๐‘ฆโ€ฒ โ€–2= exp(โˆ’4 sin2

โ€–๐‘ฆ โˆ’๐‘ฆโ€ฒโ€– ๐œ2

)

65

slide-45
SLIDE 45

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

66

  • Periodic kernel
slide-46
SLIDE 46

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Changepoint kernels

  • ๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘ก ๐‘ฆ ๐‘™1 ๐‘ฆ, ๐‘ฆโ€ฒ ๐‘ก ๐‘ฆโ€ฒ + (1 โˆ’ ๐‘ก ๐‘ฆ )๐‘™2(๐‘ฆ, ๐‘ฆโ€ฒ)(1 โˆ’ ๐‘ก ๐‘ฆโ€ฒ )
  • s ๐‘ฆ =

1 1+exp( โˆ’๐‘ฆ)

67

slide-47
SLIDE 47

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

68

  • Changepoint kernel
slide-48
SLIDE 48

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Symmetric kernels

  • Enforce that f(x) = f(-x)
  • ๐‘™ ๐‘ฆ, ๐‘ฆโ€ฒ = ๐‘™ โˆ’๐‘ฆ, ๐‘ฆโ€ฒ + ๐‘™(๐‘ฆ, ๐‘ฆโ€ฒ)

69

slide-49
SLIDE 49

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Examples

70

  • Symmetric kernel
slide-50
SLIDE 50

> DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE GRAVIS 2016 | BASEL

Summary

  • Gaussian processes are an extremely rich toolbox for modelling functions / deformation

fields

  • Possible functions are linear combinations of the kernels ๐‘™(โ‹…, ๐‘ฆ), fixed at one point ๐‘ฆ
  • Kernels ๐‘™(โ‹…, ๐‘ฆ) form the basis of the space of possible functions
  • Regularity/smoothness of kernels is transferred to samples
  • In inference tasks, the structure of the kernel determines the prediction
  • => Extremely important to model it well