kriging
play

Kriging a.k.a. Gaussian Process Regression(GPR) Yubo Paul Yang, - PowerPoint PPT Presentation

Kriging a.k.a. Gaussian Process Regression(GPR) Yubo Paul Yang, Algorithm Interest Group, Jan. 17 2019 What is kriging? Kriging is an interpolation method. Kriging minimizes the variance of prediction error at data points. Kriging


  1. Kriging a.k.a. Gaussian Process Regression(GPR) Yubo β€œPaul” Yang, Algorithm Interest Group, Jan. 17 2019

  2. What is kriging? Kriging is an interpolation method. Kriging minimizes the variance of prediction error at data points. Kriging provides uncertainty estimates to its predictions. Problem: Given samples of a random scalar field, predict value at un-sampled location. Solution: Design unbiased estimator with minimum prediction error variance. 𝑧 0 = 𝒙 π‘ˆ 𝒛 ො 𝐹[ො 𝑧 0 ] = 𝐹[𝑧 0 ] Minimize π‘Š[ො 𝑧 0 βˆ’ 𝑧 0 ]

  3. Why krige? Interpolation is generally useful. Error estimates on predictions. Gold! Photo by Sharon McCutcheon on Unsplash

  4. How to krige? : ordinary Derive ordinary kriging equation: assume stationary mean 𝐹 𝑧 𝑗 = 𝜈, βˆ€π‘— 𝑂 𝑧 0 = 𝒙 π‘ˆ 𝒛 = ෍ ො π‘₯ 𝑗 𝑧 𝑗 𝑗=1 1. Design unbiased estimator 𝐹[ො 𝑧 0 ] = 𝐹 𝑧 0 = 𝜈 𝑂 𝑂 𝑂 𝑂 ෍ π‘₯ 𝑗 = 1 𝐹 ො 𝑧 0 = 𝐹 ෍ π‘₯ 𝑗 𝑧 𝑗 = ෍ π‘₯ 𝑗 𝐹 𝑧 𝑗 = 𝜈 ෍ π‘₯ 𝑗 𝑗=1 𝑗=1 𝑗=1 𝑗=1 2. Minimize prediction error variance π‘Š[ො 𝑧 0 βˆ’ 𝑧 0 ] π‘Š 𝑧 0 βˆ’ ො 𝑧 0 = 𝐷𝑝𝑀 𝑧 0 , 𝑧 0 βˆ’ 2𝐷𝑝𝑀 𝑧 0 , ො 𝑧 0 + 𝐷𝑝𝑀[ො 𝑧 0 , ො 𝑧 0 ] 𝑂 𝑂 π‘₯ 𝑗 𝐷𝑝𝑀[𝑧 0 , 𝑧 𝑗 ] = 𝒙 π‘ˆ 𝒆 𝑧 0 = 𝐷𝑝𝑀 𝑧 0 , Οƒ 𝑗=1 π‘₯ 𝑗 𝑧 𝑗 = Οƒ 𝑗=1 𝐷𝑝𝑀 𝑧 0 , ො 𝑒 𝑗 ≑ 𝐷𝑝𝑀[𝑧 0 , 𝑧 𝑗 ] 𝑧 0 = 𝒙 π‘ˆ 𝑫 𝒙 𝐷𝑝𝑀 ො 𝑧 0 , ො 𝐷 π‘—π‘˜ ≑ 𝐷𝑝𝑀[𝑧 𝑗 , 𝑧 π‘˜ ] 𝑧 0 = 𝐷 00 βˆ’ 2𝒙 π‘ˆ 𝒆 + 𝒙 π‘ˆ 𝑫 𝒙 π‘Š 𝑧 0 βˆ’ ො [1] Wikipedia [2] Kriging Example [3] Ordinary Kriging by MSU Ashton Shortridge

  5. How to krige? : ordinary Ordinary kriging equation: assume stationary mean 𝐹 𝑧 𝑗 = 𝜈, βˆ€π‘— 𝑧 0 = 𝐷 00 βˆ’ 2𝒙 π‘ˆ 𝒆 + 𝒙 π‘ˆ 𝑫 𝒙 minimize π‘Š 𝑧 0 βˆ’ ො 𝑂 With the constaint Οƒ 𝑗=1 π‘₯ 𝑗 = 1 Solve ordinary kriging equation using Lagrange multiplier πœ‡ minimize 𝑧 0 βˆ’ 2πœ‡(𝟐 π‘ˆ 𝒙 βˆ’ 1) π‘Š 𝑧 0 βˆ’ ො 𝒙 𝑫 𝟐 πœ‡ = 𝒆 𝟐 π‘ˆ 0 1 [1] Wikipedia [2] Kriging Example [3] Ordinary Kriging by MSU Ashton Shortridge

  6. How to krige? : ordinary Ordinary kriging equation: assume stationary mean 𝐹 𝑧 𝑗 = 𝜈, βˆ€π‘— πœ‡ = 𝟐 π‘ˆ 𝑫 βˆ’1 𝒆 βˆ’ 1 𝒙 𝑫 𝟐 πœ‡ = 𝒆 𝒙 = 𝑫 βˆ’1 (𝒆 βˆ’ πœ‡πŸ) solution 𝟐 π‘ˆ 𝟐 π‘ˆ 𝑫 βˆ’1 𝟐 0 1 implementation result 𝑧 0 = 𝒙 π‘ˆ 𝒛 𝐹 ො 𝑧 0 βˆ’ 𝑧 0 = 𝐷 00 βˆ’ 𝒙 π‘ˆ 𝒆 βˆ’ πœ‡ π‘Š ො [1] Wikipedia [2] Kriging Example [3] Ordinary Kriging by MSU Ashton Shortridge

  7. How to krige? : simple Simple kriging: assume 𝐹 𝑧 𝑗 = 0, βˆ€π‘— β‡’ no constraint on weights 𝒙 𝑫 𝟐 πœ‡ = 𝒆 𝑫𝒙 = 𝒆 becomes 𝟐 π‘ˆ 0 1 implementation result 𝑧 0 = 𝒙 π‘ˆ 𝒛 𝐹 ො 𝑧 0 βˆ’ 𝑧 0 = 𝐷 00 βˆ’ 𝒙 π‘ˆ 𝒆 π‘Š ො

  8. The secret sauce: correlation function The correlation function 𝐷𝑝𝑀(π’š 1 , π’š 2 ) should capture covariance in data. (CM people think g( r )) 𝐷𝑝𝑀(π’š 1 , π’š 2 ) is used to build the 𝑫 matrix and the 𝒆 vector. 𝐷𝑝𝑀(π’š 1 , π’š 2 ) is related to the so-called variogram by 𝛿 π’š 1 , π’š 2 = 𝐷𝑝𝑀 π’š 0 , π’š 0 βˆ’ 𝐷𝑝𝑀(π’š 1 , π’š 2 ) Exponential sine squared Squared exponential 2 𝜌 𝐷𝑝𝑀 π’š 1 , π’š 2 = exp βˆ’ π’š 1 βˆ’ π’š 2 2 π‘ˆ π’š 1 βˆ’ π’š 2 𝐷𝑝𝑀 π’š 1 , π’š 2 = exp βˆ’2 sin 2𝑀 2 𝑀

  9. The secret sauce: correlation function A kriging expert knows how to choose the correlation function form and parameters . 𝑀 =1.5 𝑀 =5.0 Squared exponential Squared exponential 𝐷𝑝𝑀 π’š 1 , π’š 2 = exp βˆ’ π’š 1 βˆ’ π’š 2 2 𝐷𝑝𝑀 π’š 1 , π’š 2 = exp βˆ’ π’š 1 βˆ’ π’š 2 2 2𝑀 2 2𝑀 2

  10. Historical Review Kriging was used for time series analysis back in the 1940s. Kriging got its name from Danie G. Krige’s master thesis for predicting the location of gold deposits in South Africa in 1960. Kriging is used extensively in geostatistics and meteorology. Kriging was reformulated in the context of Baysian inference in the late 1990s. Kriging is now known as Gaussian process regression. The choice of correlation function is phrased as a machine learning problem. [1] Wikipedia [2] Chapter 2.8 RW2006

  11. Gaussian Process Gaussian process is the generalization of multivariate distribution to infinite variables. Gaussian process is probability distribution over functions. Gaussian variable Normal distribution Gaussian vector Multivariate distribution Gaussian process [1] Chapter 2.2 RW2006

  12. Gaussian Process Regression [1] Chris Fonnsbeck blog

  13. Recent Applications [1] A. P. Bartok et. al., β€œMachine Learning a General -Purpose Interatomic Potential for Silicon,” Phys. Rev. X 8 , 041048 (2018). [2] A. Kamath et. al., β€œNeural networks vs Gaussian process regression for representing potential energy surfaces: A comparative study of fit quality and vibrational spectrum accuracy,” J. Chem. Phys. 148 , 241702 (2018). [3] A. Denzel and J. Kastner, β€œGaussian Process Regression for Transition State Search,” J. Chem. Theory Comput., 14 (11), pp 5777-5786 (2018). [4] G. Schmitz and O. Christiansen, β€œGaussian process regression to accelerate geometry optimization relying on numerical differentiation,” J. Chem. Phys. 148 , 241704 (2018).

  14. Conclusions Kriging is a minimal-variance unbiased interpolation algorithm. Kriging result depends critically on the choice of correlation function (variogram). Kriging outputs a Gaussian process. Recently combined with Baysian inference and machine learning. Problem: Given samples of a random scalar field, predict value at un-sampled location. Solution: Design unbiased estimator with minimum prediction error variance. 𝑧 0 = 𝒙 π‘ˆ 𝒛 ො 𝐹[ො 𝑧 0 ] = 𝐹[𝑧 0 ] Minimize π‘Š[ො 𝑧 0 βˆ’ 𝑧 0 ]

Recommend


More recommend