{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-unifying-framework-for-gaussian-process","title":"A Unifying Framework for Gaussian Process Pseudo-Point Approximations using Power Expectation Propagation","arxiv_id":"1605.07066","date":"2016-05-23","proceeding":null,"authors":["Thang D. Bui","Josiah Yan","Richard E. Turner"],"abstract":"Gaussian processes (GPs) are flexible distributions over functions that\nenable high-level assumptions about unknown functions to be encoded in a\nparsimonious, flexible and general way. Although elegant, the application of\nGPs is limited by computational and analytical intractabilities that arise when\ndata are sufficiently numerous or when employing non-Gaussian models.\nConsequently, a wealth of GP approximation schemes have been developed over the\nlast 15 years to address these key limitations. Many of these schemes employ a\nsmall set of pseudo data points to summarise the actual data. In this paper, we\ndevelop a new pseudo-point approximation framework using Power Expectation\nPropagation (Power EP) that unifies a large number of these pseudo-point\napproximations. Unlike much of the previous venerable work in this area, the\nnew framework is built on standard methods for approximate inference\n(variational free-energy, EP and Power EP methods) rather than employing\napproximations to the probabilistic generative model itself. In this way, all\nof approximation is performed at `inference time' rather than at `modelling\ntime' resolving awkward philosophical and empirical questions that trouble\nprevious approaches. Crucially, we demonstrate that the new framework includes\nnew pseudo-point approximation methods that outperform current approaches on\nregression and classification tasks.","url_abs":"http://arxiv.org/abs/1605.07066v3","url_pdf":"http://arxiv.org/pdf/1605.07066v3.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":"a-unifying-framework-for-gaussian-process","repo_url":"https://github.com/thangbui/sparseGP_powerEP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"thangbui/sparseGP_powerEP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2610a7dc127c5280231d39bd8b8b38c400b8eb5997e9d0d363d0bd49724dceda","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}