Comparison of Gaussian process software: Difference between revisions

Content deleted Content added
GPstuff supports correlated potentially non-stationary errors
Joanico (talk | contribs)
Solvers: specify why a sparse approximation is called "sparse"
Line 21:
** ''Markov'': algorithms for kernels which represent (or can be formulated as) a Markov process.<ref name="sarkka2013"></ref>
* '''Approximate''': whether ''generic or specialized'' approximate algorithms are implemented. Supported approximate algorithms may be indicated as:
** ''Sparse'': algorithms based on choosing a set of "inducing points" in input space.,<ref name="candela2005"></ref> or more in general imposing a sparse structure on the inverse of the covariance matrix.
** ''Hierarchical'': algorithms which approximate the covariance matrix with a [[hierarchical matrix]].<ref name="ambikasaran2016"></ref>