@bwengals I just saw the video of your talk and your HSGP approach looks very promising to handle (my) common performance problems with GPs! ![]()
However, there were just two questions coming into my mind:
-
Is
HSGPalso working withWrapedInputkernels? I’m frequently usingWrapedInputto model GPs on non-euclidean domains, e.g. data on a 2-D sphere. -
I’m not an expert on Hilbert space methods, but if I understood your approach correctly, HSGP is basically approximating the GP via a Fourier series with random coefficients. Then, it should be quite natural to extend this method to use any kind of orthonormal basis functions for approximation, e.g. orthogonal polynomials, wavelets, etc. - shouldn’t it? Intuitively, I would have maybe chosen Hermite polynomials to approximate GPs on an euclidean domain, to avoid the artificial periodicity that seems to be currently introduced if you predict values outside [-L, L].