gp_posterior_mean
std.nn.gp_posterior_mean · Level L3The posterior mean of a Gaussian process with a squared-exponential kernel of length scale ℓ and noise variance σ², at new points Xs. The training system is solved by Cholesky (calls cholesky_solve).
Signature
gp_posterior_mean(X: f64[n, d], y: f64[n], Xs: f64[m, d], ell: f64[], noise: f64[]) → f64[m]
Structure
The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.
- input
- operation
- constant
- call
- output
Verification
- Signature proven by NOVA’s shape solver, for every size.
- Agrees with the reference
K(Xs,X) @ np.linalg.solve(K(X,X) + noise*I, y)to 80 digits (100-digit arithmetic), on all 40 test cases. - All 163 float64 results inside the running error bound; the closest uses 18% of it.
- Interpreter and NumPy backend return bit-identical results.
- correctly rounded (the float64 nearest the exact value)
- 25%
- bit-equal to the NumPy formula in float64
- 37%
- largest error, in units in the last place
- 1.9e+3
Large ulp counts appear where a result is zero or tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound.
Identity
sha256:b5da9aa06108d722be7802c5667c71c8ad9440d88486511912f9a1e221dfba63The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.