{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/rates-of-convergence-for-sparse-variational","title":"Rates of Convergence for Sparse Variational Gaussian Process Regression","arxiv_id":"1903.03571","date":"2019-03-08","proceeding":null,"authors":["David R. Burt","Carl E. Rasmussen","Mark van der Wilk"],"abstract":"Excellent variational approximations to Gaussian process posteriors have been developed which avoid the $\\mathcal{O}\\left(N^3\\right)$ scaling with dataset size $N$. They reduce the computational cost to $\\mathcal{O}\\left(NM^2\\right)$, with $M\\ll N$ being the number of inducing variables, which summarise the process. While the computational cost seems to be linear in $N$, the true complexity of the algorithm depends on how $M$ must increase to ensure a certain quality of approximation. We address this by characterising the behavior of an upper bound on the KL divergence to the posterior. We show that with high probability the KL divergence can be made arbitrarily small by growing $M$ more slowly than $N$. A particular case of interest is that for regression with normally distributed inputs in D-dimensions with the popular Squared Exponential kernel, $M=\\mathcal{O}(\\log^D N)$ is sufficient. Our results show that as datasets grow, Gaussian process posteriors can truly be approximated cheaply, and provide a concrete rule for how to increase $M$ in continual learning scenarios.","url_abs":"https://arxiv.org/abs/1903.03571v3","url_pdf":"https://arxiv.org/pdf/1903.03571v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"rates-of-convergence-for-sparse-variational","repo_url":"https://github.com/DavidBurt2/Rates-of-Convergence-SGPR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.03571","atlas_url":"https://app.syntology.ai/?focus=1903.03571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03571"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DavidBurt2/Rates-of-Convergence-SGPR","reach":null}],"summary":{"ran_honours":2},"by_repo_kind":{"listed":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"894c0fb17aae8863","entry":"KL_bound","repo":"DavidBurt2/Rates-of-Convergence-SGPR","repo_kind":"listed","path":"KL_Bounds.py","file_url":"https://github.com/DavidBurt2/Rates-of-Convergence-SGPR/blob/HEAD/KL_Bounds.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"894c0fb17aae8863"}},{"code_sha256_prefix":"6a1fcbb7274af77d","entry":"KL_bound2","repo":"DavidBurt2/Rates-of-Convergence-SGPR","repo_kind":"listed","path":"KL_Bounds.py","file_url":"https://github.com/DavidBurt2/Rates-of-Convergence-SGPR/blob/HEAD/KL_Bounds.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6a1fcbb7274af77d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}