Quantification and Density Estimation Gadi Fibich, Tel Aviv - - PowerPoint PPT Presentation

β–Ά
quantification and density estimation
SMART_READER_LITE
LIVE PREVIEW

Quantification and Density Estimation Gadi Fibich, Tel Aviv - - PowerPoint PPT Presentation

A Spline-based approach to Uncertainty Quantification and Density Estimation Gadi Fibich, Tel Aviv University Adi Ditkowski Amir Sagiv 1 Motivation 2 Input pulse characteristics Elliptic typical shot average over 1000 shots 3


slide-1
SLIDE 1

1

  • Adi Ditkowski
  • Amir Sagiv

A Spline-based approach to Uncertainty Quantification and Density Estimation

Gadi Fibich, Tel Aviv University

slide-2
SLIDE 2

2

Motivation

slide-3
SLIDE 3

3

Input pulse characteristics

  • Elliptic

typical shot average over 1000 shots

slide-4
SLIDE 4

4

Input pulse characteristics

  • Elliptic
  • Varies from shot to shot
  • Always the case

average over 1000 shots typical shot

slide-5
SLIDE 5

5

After 5 meters in air

Average

  • ver 1000

shots typical

slide-6
SLIDE 6

6

After 5 meters in air

Average

  • ver 1000

shots typical

slide-7
SLIDE 7

7 Average

  • ver 1000

shots

After 5 meters in air

typical

Want to predict

  • Average intensity after

5m

  • Probability for 0,1,2, or

3 filaments

slide-8
SLIDE 8

πœ” 𝑨, 𝑦, 𝑧

  • utput

πœ”0(𝑦, 𝑧)

NLS initial condition

8

Mathematical model

slide-9
SLIDE 9

πœ” 𝑨, 𝑦, 𝑧; 𝛽

random output

πœ”0(𝑦, 𝑧; 𝛽)

𝛽 - noise parameter

random initial condition

9

Shot to shot variation

NLS

slide-10
SLIDE 10

πœ” 𝑨, 𝑦, 𝑧; 𝛽

random output

πœ”0(𝑦, 𝑧; 𝛽)

𝛽 - noise parameter

random initial condition

10

Shot to shot variation

NLS

Computational goals Moment estimation

e.g., average intensity π…πœ· πœ” 2

Density estimation

e.g., probability for 2 filaments

slide-11
SLIDE 11

Nonlinear initial value problem α‰Š 𝑣𝑒 𝑒, π’š = 𝑅 π’š, 𝑣 𝑣 𝑣 𝑒 = 0, π’š = 𝑣0(π’š)

  • β€œQuantity of interest” (model output) 𝑔 = 𝑔[𝑣]
  • e.g., 𝑔 = arg(𝑣 𝑒𝑗, 𝑦𝑗 ), f = ∫ u 2𝑒𝑦, …
  • 𝑣, 𝑔[𝑣] not given explicitly, but can be evaluated numerically

11

General setting

slide-12
SLIDE 12

General setting with randomness

Add randomness (in 𝑣0 and/or 𝑅) α‰Š 𝑣𝑒 𝑒, π’š; 𝜷 = 𝑅 π’š, 𝑣; 𝜷 𝑣 𝑣 𝑒 = 0, π’š; 𝜷 = 𝑣0(π’š; 𝜷)

  • 𝜷 distributed according to a known measure
  • β€œQuantity of interest” (model output) 𝑔 𝜷 ≔ 𝑔[𝑣 𝑒, π’š; 𝜷 ]
  • 𝑔 𝜷 is a random variable

12

slide-13
SLIDE 13

Add randomness (in 𝑣0 and/or 𝑅) α‰Š 𝑣𝑒 𝑒, π’š; 𝜷 = 𝑅 π’š, 𝑣; 𝜷 𝑣 𝑣 𝑒 = 0, π’š; 𝜷 = 𝑣0(π’š; 𝜷)

  • 𝜷 distributed according to a known measure
  • β€œQuantity of interest” (model output) 𝑔 𝜷 ≔ 𝑔[𝑣 𝑒, π’š; 𝜷 ]
  • 𝑔 𝜷 is a random variable

13

Computational goals:

  • Moment estimation

π…πœ· 𝑔

  • Density estimation

Probability Density Function (PDF) of 𝑔 𝜷

General setting with randomness

slide-14
SLIDE 14

Standard statistical methods

Moment estimation

  • Monte-Carlo 𝐅𝛽 𝑔 β‰ˆ

1 𝑂 Οƒπ‘œ=1 𝑂

𝑔

π‘œ

  • …

14

Density (PDF) estimation

  • Histogram method
  • Kernel density estimators (KDE)
  • …

Step I – draw samples {𝛽1, … , 𝛽𝑂} Step II – compute 𝑔

1, … , 𝑔 𝑂 ,

𝑔

π‘œ:=𝑔 π›½π‘œ

slide-15
SLIDE 15

Standard statistical methods

Moment estimation

  • Monte-Carlo 𝐅𝛽 𝑔 β‰ˆ

1 𝑂 Οƒπ‘œ=1 𝑂

𝑔

π‘œ

  • …

15

Density (PDF) estimation

  • Histogram method
  • Kernel density estimators (KDE)
  • …

Step I – draw samples {𝛽1, … , 𝛽𝑂} Step II – compute 𝑔

1, … , 𝑔 𝑂 ,

𝑔

π‘œ:=𝑔 π›½π‘œ

Constraint:

  • Computation of 𝑔 πœ·π’Œ is expensive (e.g., solving the (3+1)D NLS)
  • Can only use a small samples {𝑔 𝛽1 , … , 𝑔 𝛽𝑂 }
slide-16
SLIDE 16

Standard statistical methods

16

  • Poor approximations for small N

Moment estimation

  • Monte-Carlo 𝐅𝛽 𝑔 β‰ˆ

1 𝑂 Οƒπ‘œ=1 𝑂

𝑔

π‘œ

  • …

Density (PDF) estimation

  • Histogram method
  • Kernel density estimators (KDE)
  • …

e.g. Histogram method with N=10 samples Step I – draw samples {𝛽1, … , 𝛽𝑂} Step II – compute 𝑔

1, … , 𝑔 𝑂 ,

𝑔

π‘œ:=𝑔 π›½π‘œ

slide-17
SLIDE 17

Standard statistical methods

17

  • Poor approximations for small N

Moment estimation

  • Monte-Carlo 𝐅𝛽 𝑔 β‰ˆ

1 𝑂 Οƒπ‘œ=1 𝑂

𝑔

π‘œ

  • …

Density (PDF) estimation

  • Histogram method
  • Kernel density estimators (KDE)
  • …

e.g. Histogram method with N=10 samples

17

Exact PDF Step I – draw samples {𝛽1, … , 𝛽𝑂} Step II – compute 𝑔

1, … , 𝑔 𝑂 ,

𝑔

π‘œ:=𝑔 π›½π‘œ

slide-18
SLIDE 18

Standard statistical methods

Moment estimation

  • Monte-Carlo 𝐅𝛽 𝑔 β‰ˆ

1 𝑂 Οƒπ‘œ=1 𝑂

𝑔

π‘œ

  • …

18

Density (PDF) estimation

  • Histogram method
  • Kernel density estimators (KDE)
  • …

Given a sample {𝑔

1, … , 𝑔 𝑂} of 𝑔 𝛽

How to improve?

  • Above methods only use {𝑔

1, … , 𝑔 𝑂}

  • Uncertainty Quantification (UQ) approach: Utilize

1. The relation 𝑔 𝛽 2. Smoothness of 𝑔 𝛽

slide-19
SLIDE 19

Approximation-based estimation

19

𝑔 𝛽 𝑔

𝑂 𝛽

Questions

  • How accurate are E𝛽 𝑔 βˆ’ E𝛽 𝑔

𝑂 , ||π‘ž βˆ’ π‘žπ‘‚||?

  • Which approximation method should be used?

approximation moment, PDF moment, PDF

𝐅𝛽 𝑔 , π‘ž 𝐅𝛽 𝑔

𝑂 , π‘žπ‘‚

π‘œ β†’ ∞

can take a large sample, since computation of 𝑔

𝑂 𝛽 is cheap

  • π‘ž and π‘žπ‘‚ are the PDFs of 𝑔 and π‘žπ‘‚
  • π‘ž is the PDF of 𝑔
slide-20
SLIDE 20

Approximation-based estimation

20

𝑔 𝛽 𝑔

𝑂 𝛽

Questions

  • How accurate are E𝛽 𝑔 βˆ’ E𝛽 𝑔

𝑂 , ||π‘ž βˆ’ π‘žπ‘‚||?

  • Which approximation method should be used?

approximation moment, PDF moment, PDF

𝐅𝛽 𝑔 , π‘ž 𝐅𝛽 𝑔

𝑂 , π‘žπ‘‚

π‘œ β†’ ∞

can take a large sample, since computation of 𝑔

𝑂 𝛽 is cheap

cannot take a large sample

  • π‘ž and π‘žπ‘‚ are the PDFs of 𝑔 and π‘žπ‘‚
  • π‘ž is the PDF of 𝑔
slide-21
SLIDE 21

Approximation-based estimation

21

𝑔 𝛽 𝑔

𝑂 𝛽

Questions

  • Which approximation should be used?
  • How small are E𝛽 𝑔 βˆ’ E𝛽 𝑔

𝑂

and ||π‘ž βˆ’ π‘žπ‘‚|| ?

approximation moment, PDF moment, PDF

𝐅𝛽 𝑔 , π‘ž 𝐅𝛽 𝑔

𝑂 , π‘žπ‘‚

𝑂 β†’ ∞

can take a large sample, since computation of 𝑔

𝑂 𝛽 is cheap

cannot take a large sample

  • π‘ž is the PDF of 𝑔
  • π‘žπ‘‚ is the PDF of 𝑔

𝑂

slide-22
SLIDE 22

Noise dimension

  • One-dimensional noise 𝛽 ∈ 𝑆
  • Random input power πœ”0 = 1 + 𝛽 𝑓

βˆ’ 𝑠2

  • Random temperature
  • …
  • Multi-dimensional noise 𝛽 ∈ 𝑆𝑒
  • Random input power and incidence angle
  • …

22

slide-23
SLIDE 23

Noise dimension

  • One-dimensional noise 𝛽 ∈ 𝑆
  • Random input power πœ”0 = 1 + 𝛽 𝑓

βˆ’ 𝑠2

  • Random temperature
  • …
  • Multi-dimensional noise 𝛽 ∈ 𝑆𝑒
  • Random input power and incidence angle
  • …

23

slide-24
SLIDE 24

Standard uncertainty quantification approach:

  • Approximate 𝑔 using orthogonal polynomials π‘Ÿπ‘œ(𝛽)

𝑔

𝑂 𝛽 = ෍ π‘œ=0 π‘‚βˆ’1

π‘Ÿπ‘œ , 𝑔 π‘Ÿπ‘œ 𝛽

  • Spectral accuracy for moments

𝐅𝛽 𝑔 βˆ’ 𝐅𝛽 𝑔

𝑂 = 𝑃 π‘“βˆ’π›Ώπ‘‚ ,

𝑂 ≫ 1 if f is analytic

Generalized Polynomial Chaos (gPC)

24

slide-25
SLIDE 25

Standard uncertainty quantification approach:

  • Approximate 𝑔 using orthogonal polynomials π‘Ÿπ‘œ(𝛽)

𝑔

𝑂 𝛽 = ෍ π‘œ=0 π‘‚βˆ’1

π‘Ÿπ‘œ , 𝑔 π‘Ÿπ‘œ 𝛽

  • Spectral accuracy for moments

𝐅𝛽 𝑔 βˆ’ 𝐅𝛽 𝑔

𝑂 = 𝑃 π‘“βˆ’π›Ώπ‘‚ ,

𝑂 ≫ 1 if f is analytic

  • Problem solved

Generalized Polynomial Chaos (gPC)

25

slide-26
SLIDE 26

Standard uncertainty quantification approach:

  • Approximate 𝑔 using orthogonal polynomials π‘Ÿπ‘œ(𝛽)

𝑔

𝑂 𝛽 = ෍ π‘œ=0 π‘‚βˆ’1

π‘Ÿπ‘œ , 𝑔 π‘Ÿπ‘œ 𝛽

  • Spectral accuracy for moments

𝐅𝛽 𝑔 βˆ’ 𝐅𝛽 𝑔

𝑂 = 𝑃 π‘“βˆ’π›Ώπ‘‚ ,

𝑂 ≫ 1 if f is analytic

  • Problem solved

But,

Generalized Polynomial Chaos (gPC)

26

Moment estimation Spectral accuracy reached only for large N How to achieve ``good’’ accuracy with e.g. 𝑢 = 𝟐𝟏 samples?

Density estimation No theory for π‘ž βˆ’ π‘žπ‘‚ Will it work in practice?

slide-27
SLIDE 27

Example: Density estimation with gPC

27

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

slide-28
SLIDE 28

28

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

PDF approximation, 𝑂 = 12

Example: Density estimation with gPC

slide-29
SLIDE 29

29

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

PDF approximation, 𝑂 = 12

Example: Density estimation with gPC

Lemma π‘ž 𝑧 = ෍

𝑔 𝛽 =𝑧

1 𝑔′ 𝛽

slide-30
SLIDE 30

30

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

PDF approximation, 𝑂 = 12

Example: Density estimation with gPC

𝛽 fβ€²(Ξ±)

Lemma π‘ž 𝑧 = ෍

𝑔 𝛽 =𝑧

1 𝑔′ 𝛽

slide-31
SLIDE 31

31

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

PDF approximation, 𝑂 = 12

Example: Density estimation with gPC

𝛽 fβ€²(Ξ±)

Lemma π‘ž 𝑧 = ෍

𝑔 𝛽 =𝑧

1 𝑔′ 𝛽

slide-32
SLIDE 32

32

𝛽

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

PDF approximation, 𝑂 = 12

Example: Density estimation with gPC

𝛽 fβ€²(Ξ±)

Conclusion Although gPC is spectrally accurate in 𝑀2, it produces β€œartificial” zero derivatives which ``contaminate’’ the PDF

Lemma π‘ž 𝑧 = ෍

𝑔 𝛽 =𝑧

1 𝑔′ 𝛽

slide-33
SLIDE 33
  • π‘žπ‘‚ is the PDF of 𝑔

𝑂

Approximation-based estimation

33

𝑔 𝛽 𝑔

𝑂 𝛽

Question: Which approximation should be used?

moment, PDF moment, PDF

𝐅𝛽 𝑔 , π‘ž 𝐅𝛽 𝑔

𝑂 , π‘žπ‘‚

𝑂 β†’ ∞

can take a large sample, since computation of 𝑔

𝑂 𝛽 is cheap

cannot take a large sample

  • π‘ž is the PDF of 𝑔

Answer

  • For density approximation, require that 𝑔

𝑂 β€² = 0 ⇔ 𝑔′ = 0

  • β€œMonotonicity-preserving” approximation

approximation

slide-34
SLIDE 34

Ditkowski, Fibich, Sagiv, 18: Approximate f using a cubic spline over N grid points Thm (Ditkowski, Fibich, Sagiv, 18) : Let π‘ž and π‘žπ‘‚ denote the PDFs

  • f 𝑔(𝛽) and its cubic spline interpolant over 𝑂 points. Then

π‘ž βˆ’ π‘žπ‘‚ 1 ≀ π·π‘‚βˆ’3, 𝐷 = 𝑃(1)

  • No equivalent thm for gPC

Thm: 𝐅𝛽 𝑔 βˆ’ 𝐅𝛽 𝑔

𝑂

≀ π·π‘‚βˆ’4, 𝐷 = 𝑃(1)

  • Worse than gPC for large N
  • But, usually better than gPC for small N

Adopt a spline-based approach

34

slide-35
SLIDE 35

35

𝑂

𝛽

Example – moment estimation

𝜏 𝑔 βˆ’ 𝜏 𝑔

𝑂

𝑂

Moment estimation 𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

𝑂

slide-36
SLIDE 36

36

𝑂

𝛽

Example – moment estimation

𝜏 𝑔 βˆ’ 𝜏 𝑔

𝑂

𝑂

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

Moment estimation Spline better than gPC for small N

slide-37
SLIDE 37

𝜏 𝑔 βˆ’ 𝜏 𝑔

𝑂

PDF estimation

37

𝛽

PDF approximation, 𝑂 = 12

Statistically optimal 𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

slide-38
SLIDE 38

𝜏 𝑔 βˆ’ 𝜏 𝑔

𝑂

PDF estimation

38

𝛽

PDF approximation, 𝑂 = 12

𝑔 = tanh 9𝛽 +

𝛽 2 , 𝛽 ∼ Uniform [βˆ’1, 1]

slide-39
SLIDE 39

alpha_min = βˆ’1; alpha_max = 1 ; N = 18; f = @(x) tanh (9βˆ—x) + x/2; samplingGrid = linspace(alpha_min, alpha_max, N) ; sample_s = f (samplingGrid); M = 2e6 ; denseGrid = linspace (alpha_min, alpha_max ,M) ; fNspline = spline ( samplingG rid, samples, denseGrid) Cf = 1 . 6 9 ; L =Cfβˆ—MΛ† (1/3 ) ; [histogram, binsEdges ] = hist( fNspline ,L) ; binWidth = (max( binsEdges)βˆ’min (binsEdges)) /L; pdf = histogram / (sum(histogram) βˆ—binWidth ) ; plot(binsEdges, pdf )

Matlab code for PDF estimation

39

slide-40
SLIDE 40

πœ” 𝑨, 𝑦, 𝑧; 𝛽

random output

πœ”0(𝑦, 𝑧; 𝛽)

𝛽 - noise parameter

random initial condition

40

Shot to shot variation

NLS

Loss of Phase Lemma (Sagiv, Ditkowski, Fibich, 2017) Let 𝑔 𝑨; 𝛽 ≔ arg πœ”(𝑨, 𝑦 = 0, 𝑧 = 0; 𝛽)𝑛𝑝𝑒(2𝜌). Then lim

π‘¨β†’βˆž 𝑔 𝑨; 𝛽

∼ 𝑉(0,2𝜌)

slide-41
SLIDE 41

Example: PDF of on-axis phase

Histogram 𝑨1 𝑨2 𝑨3

𝑨2 𝑨1 𝑦 𝑨3

Spline

𝑔 PDF PDF

Use N=10 NLS simulations 𝑔 𝛽 = arg πœ” 𝑨, 0; 𝛽 mod 2𝜌

𝑔 𝑔 𝑔 𝑔 𝑔

slide-42
SLIDE 42

Coupled NLS – loss of polarization angle

phase: πœ’Β± 𝑒 = arg 𝐡± 𝑒, 𝑦 = 0

𝑛𝑝𝑒 (2𝜌)

polarization πœ„ 𝑒 = πœ’+ 𝑒 βˆ’ πœ’βˆ’ 𝑒 Random elliptical beam – 𝐡± 𝑒 = 0 = 1 + 𝛽 π·Β±π‘“βˆ’π‘¦2, 𝛽 ∼ 𝑉(βˆ’0.1,0.1)

𝒋 𝝐 𝝐𝒖 𝑩± 𝒖, π’š + ππŸ‘ ππ’šπŸ‘ 𝑩± + πŸ‘ πŸ’ 𝑩±

πŸ‘ + πŸ‘ π‘©βˆ“ πŸ‘ 𝑩± = 𝟏

πœ„ πœ„ PDF, N=64 PDF, N=64

Patwardhan et al., 2018

slide-43
SLIDE 43

Coupled NLS – loss of polarization angle

𝑂 π‘ž βˆ’ π‘žπ‘‚ 1

𝒋 𝝐 𝝐𝒖 𝑩± 𝒖, π’š + ππŸ‘ ππ’šπŸ‘ 𝑩± + πŸ‘ πŸ’ 𝑩±

πŸ‘ + πŸ‘ π‘©βˆ“ πŸ‘ 𝑩± = 𝟏

πœ„ πœ„ PDF, N=64 PDF, N=64

phase: πœ’Β± 𝑒 = arg 𝐡± 𝑒, 𝑦 = 0

𝑛𝑝𝑒 (2𝜌)

polarization πœ„ 𝑒 = πœ’+ 𝑒 βˆ’ πœ’βˆ’ 𝑒 Random elliptical beam – 𝐡± 𝑒 = 0 = 1 + 𝛽 π·Β±π‘“βˆ’π‘¦2, 𝛽 ∼ 𝑉(βˆ’0.1,0.1)

𝒋 𝝐 𝝐𝒖 𝑩± 𝒖, π’š + ππŸ‘ ππ’šπŸ‘ 𝑩± + πŸ‘ πŸ’ 𝑩±

πŸ‘ + πŸ‘ π‘©βˆ“ πŸ‘ 𝑩± = 𝟏

Patwardhan et al., 2018

~π‘‚βˆ’3.7

(π‘’β„Žπ‘“π‘π‘ π‘§: π‘‚βˆ’3)

slide-44
SLIDE 44

Burgers equation – shock location

Initial condition: u0 x = 𝛽 sin(𝑦) Shock location at 𝑒 β†’ ∞

𝛽 = βˆ’ 𝑑𝑝𝑑 π‘Œπ‘‘

Distribution of random initial amplitude –

𝛽 πœ‰ = ࡞ βˆ’1 + 1 + 4πœ‰2 2πœ‰ πœ‰ β‰  0 πœ‰ = 0 πœ‰ ∼ 𝑂(0, 𝜏) 44

𝒗𝒖 𝒖, π’š + 𝟐 πŸ‘ π’—πŸ‘

π’š = 𝟐

πŸ‘ 𝒕𝒋𝒐 π’š

π’š

π‘Œπ‘‘ π‘Œπ‘‘ PDF, N=7 PDF, N=7

Chen, Gottlieb, Hesthaven, JCP 2005

slide-45
SLIDE 45

Burgers equation – shock location

Initial condition: u0 x = 𝛽 sin(𝑦) Shock location at 𝑒 β†’ ∞

𝛽 = βˆ’ 𝑑𝑝𝑑 π‘Œπ‘‘

Distribution of random initial amplitude –

𝛽 πœ‰ = ࡞ βˆ’1 + 1 + 4πœ‰2 2πœ‰ πœ‰ β‰  0 πœ‰ = 0 πœ‰ ∼ 𝑂(0, 𝜏) 45

𝑂 π‘ž βˆ’ π‘žπ‘‚ 1

𝒗𝒖 𝒖, π’š + 𝟐 πŸ‘ π’—πŸ‘

π’š = 𝟐

πŸ‘ 𝒕𝒋𝒐 π’š

π’š

π‘Œπ‘‘ π‘Œπ‘‘ PDF, N=7 PDF, N=7

~π‘‚βˆ’3.1

Chen, Gottlieb, Hesthaven, JCP 2005

(π‘’β„Žπ‘“π‘π‘ π‘§: π‘‚βˆ’3)

slide-46
SLIDE 46

Noise dimension

  • One-dimensional noise 𝛽 ∈ 𝑆
  • Random input power πœ”0 = 1 + 𝛽 𝑓

βˆ’ 𝑠2

  • Random temperature
  • …
  • Multi-dimensional noise 𝛽 ∈ 𝑆𝑒
  • Random input power and incidence angle
  • …

46

slide-47
SLIDE 47
  • π‘žπ‘‚ is the PDF of 𝑔

𝑂

Approximation-based estimation

47

𝑔 𝛽 𝑔

𝑂 𝛽

Questions

  • Which approximation should be used?
  • How small are E𝛽 𝑔 βˆ’ E𝛽 𝑔

𝑂

and ||π‘ž βˆ’ π‘žπ‘‚|| ?

moment, PDF moment, PDF

𝐅𝛽 𝑔 , π‘ž 𝐅𝛽 𝑔

𝑂 , π‘žπ‘‚

𝑂 β†’ ∞

can take a large sample, since computation of 𝑔

𝑂 𝛽 is cheap

cannot take a large sample

  • π‘ž is the PDF of 𝑔

approximation

slide-48
SLIDE 48

Ditkowski, Fibich, Sagiv, 18: If 𝛽 is d-dimensional, approximate f with a tensor product cubic spline over N grid points Thm (Ditkowski, Fibich, Sagiv, 18): π‘ž βˆ’ π‘žπ‘‚ 1 = 𝑃(π‘‚βˆ’3/𝒆)

  • Optimal statistical method (KDE) converges as π‘‚βˆ’2/5
  • Hence, our method is faster for d ≀ 7
  • For higher dimensions, can use mth-order splines:

Thm (Ditkowski, Fibich, Sagiv, 18): π‘ž βˆ’ π‘žπ‘‚ 1 = 𝑃(π‘‚βˆ’π‘›/𝒆)

Tensor product spline

48

Lemma π‘ž 𝑧 = 1 𝜈(Ξ©) ΰΆ±

π‘”βˆ’1(𝑧)

1 𝛼𝑔 π‘’πœ

slide-49
SLIDE 49

2D example

49

𝛽1 𝛽2

𝑔 𝛽1, 𝛽2 = tanh 6𝛽1𝛽2 + 𝛽1 2 + 𝛽1 + 𝛽2 2 , 𝛽1, 𝛽2 ∼ Uni βˆ’1,1 , 𝑗. 𝑗. 𝑒.

𝑔

𝑂 = 82

slide-50
SLIDE 50

2-dimensional example

50

𝛽1 𝛽2 𝑔

𝑂

π‘‚βˆ’2.1

𝑔 𝛽1, 𝛽2 = tanh 6𝛽1𝛽2 + 𝛽1 2 + 𝛽1 + 𝛽2 2 , 𝛽1, 𝛽2 ∼ Uni βˆ’1,1 , 𝑗. 𝑗. 𝑒. π‘ž βˆ’ π‘žπ‘‚ 1 (π‘’β„Žπ‘“π‘π‘ π‘§: π‘‚βˆ’3/2)

𝑂 = 82

slide-51
SLIDE 51

func = @(x,y) atan(1.3*y.^2 - .4*x.*y+1.1*x.^2)+(x+y) MCpointsPerBlock = 2e3; MCsqrtNumBlock = 10; binsNum = 750; N=10; [xs,ys] = ndgrid(linspace(xmin,xmax,N),linspace(xmin,xmax,N)); [pdf_spline,y_spline] = pdfSampleSquare(@(t,v) interpn(xs,ys,func(xs,ys),t,v,'cubic'),... MCsqrtNumBlock,MCpointsPerBlock,binsNum); function [pdf,binsEdges] = pdfSampleSquare(func,sqrtNumBlocks,sqrtSamplesBlock, numBins) xmin =-1; xmax = 1; smallGridSize = 3e6; blockLength = (xmax-xmin)/sqrtNumBlocks; nsmall =1e3; [x_calibrate,y_calibrate] = ndgrid(linspace(xmin,xmax,1e3),linspace(xmin,xmax,1e3)); [~,binsEdges] = hist(func(x_calibrate,y_calibrate),numBins); binWidth = (max(binsEdges)-min(binsEdges))/numBins; histogram = zeros(1,numBins); for k=1:sqrtNumBlocks for m=1:sqrtNumBlocks [xg,yg] = ndgrid(linspace(xmin+(k-1)*blockLength,xmin+(k)*blockLength, sqrtSamplesBlock),... linspace(xmin+(m-1)*blockLength,xmin+(m)*blockLength,sqrtSamplesBlock)); funcBlock =func(xg,yg); [hist_temp] = hist(funcBlock(:),binsEdges); histogram = histogram+hist_temp; end end pdf = histogram/(sum(histogram)*binWidth);

Matlab code for 2D PDF estimation

51

slide-52
SLIDE 52

3 dimensional example

52

𝑔 𝛽1, 𝛽2, 𝛽3 = tanh 2𝛽1 + 3𝛽2 + 3𝛽3 + 𝛽1 + 𝛽2 + 𝛽3 3 , 𝛽1, 𝛽2, 𝛽3 ∼ Uni βˆ’1,1 , 𝑗. 𝑗. 𝑒.

𝑔

PDF

𝑂

π‘‚βˆ’1.09

π‘ž βˆ’ π‘žπ‘‚ 1

𝑂 = 83

(π‘’β„Žπ‘“π‘π‘ π‘§: π‘‚βˆ’1)

slide-53
SLIDE 53

Conclusions

53

References

  • A. Sagiv, A. Ditkowski, G. Fibich

A spline-based approach to uncertainty quantification and density estimation ArXiv 1803.10991

  • A. Sagiv, A. Ditkowski, G. Fibich

Loss of phase and universality of stochastic interactions between laser beams Optics Express 25: 24387-24399, 2017

  • New method for computing PDF and moments of nl PDEs

with randomness

  • Outperforms standard statistical methods and gPC
  • Guaranteed to converge for PDF approximation
  • Non-intrusive: can use any deterministic numerical solver
  • Achieves good accuracy using small samples
  • Extends to multi-dimensional noise
  • Can also handle non-smooth ``quantity of interest’’