Skip to main content
. 2022 Apr 15;15(8):2902. doi: 10.3390/ma15082902
Algorithm 1 Multi Fidelity Gaussian Process
Require: Low-fidelity input, x1; Low-fidelity output, y1; Hyperparameter of the low fidelity kernel, θ1; High-fidelity input, x2; High-fidelity output, y2; Hyperparameter of the high fidelity kernel, θ2; Kernel function, k (for simplicity, here k1 = k2); Test input, xtst; Noise-level, σϵ2 (for simplicity, here σϵ12 = σϵ22)
  • 1:

    L = cholesky(K +σϵ2I) ▹ K as calculated from Equation (9)

  • 2:

    Y = [y1y2]

  • 3:

    α = LT(LY)

  • 4:

    ψ1=ρk(xtst,x1,θ1)

  • 5:

    ψ2=ρ2k(xtst,x2;θ1)+k(xtst,x2;θ2)

  • 6:

    Ψ=[ψ1ψ2]

  • 7:

    f^xtst=Ψ.α ▹ predictive mean

  • 8:

    β=LT(LΨT)

  • 9:

    V[fxtst]=ρ2k(xtst,xtst,θ1)+k(xtst,xtst;θ2)Ψβ ▹ predictive variance