-
Notifications
You must be signed in to change notification settings - Fork 6
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement "Unifying View of Sparse Approximations ..." methods #84
Comments
This is one way to go. You might also be interested in the more recent A unifying framework for Gaussian process pseudo-point approximations using power expectation propagation |
We also have the closed-form version of the approximation here implemented in AbstractGPs, for when the likelihood is Gaussian and such a closed-form solution exists. |
I have looked into that paper, as well as related ones, and dug through the current implementation. Now I am essentially ready to implement. However, I can come up with a few different options on how to connect to AbstractGPs.jl, and wanted to ask what the best one would be:
I think given the idea that AbstractGPs.jl is supposed to be a lean package to build on top of (I believe?), 2/3 make more sense? Thoughts? |
Option 2 would be my preference. So everything other than the We've definitely discussed this elsewhere, but I can't find the issue now... |
The |
Yeah, we could probably do that. As the comment in the GaussianProcesses.jl implementation points out, you would just need to modify the observation variance. Specifically for FITC, I think computing the approximate log marginal probability would just involve calling |
@willtebbutt I think I missed this. Could you point me to where this is said? |
Ah, sorry, I guess I'm referring to the contents of equations 21-24b in the linked paper |
As far as I can tell, this package currently implements a general approximation distribution
q
, which can be optimized "as a whole", which means as many optimization variables as there are inducing points.There exist various approximations for
q
that reduce the computational effort for optimization, see e.g. A Unifying View of Sparse Approximate Gaussian Process Regression by Quinonero-Candela & Rasmussen.I would like to give implementing those here a go in the near future, but wanted to open an issue first.
The text was updated successfully, but these errors were encountered: