{"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/generalized-robust-bayesian-committee-machine","title":"Generalized Robust Bayesian Committee Machine for Large-scale Gaussian Process Regression","arxiv_id":"1806.00720","date":"2018-06-03","proceeding":"ICML 2018 7","authors":["Haitao Liu","Jianfei Cai","Yi Wang","Yew-Soon Ong"],"abstract":"In order to scale standard Gaussian process (GP) regression to large-scale\ndatasets, aggregation models employ factorized training process and then\ncombine predictions from distributed experts. The state-of-the-art aggregation\nmodels, however, either provide inconsistent predictions or require\ntime-consuming aggregation process. We first prove the inconsistency of typical\naggregations using disjoint or random data partition, and then present a\nconsistent yet efficient aggregation model for large-scale GP. The proposed\nmodel inherits the advantages of aggregations, e.g., closed-form inference and\naggregation, parallelization and distributed computing. Furthermore,\ntheoretical and empirical analyses reveal that the new aggregation model\nperforms better due to the consistent predictions that converge to the true\nunderlying function when the training size approaches infinity.","url_abs":"http://arxiv.org/abs/1806.00720v1","url_pdf":"http://arxiv.org/pdf/1806.00720v1.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":"generalized-robust-bayesian-committee-machine","repo_url":"https://github.com/LiuHaiTao01/GRBCM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"distributed-computing","task_name":"Distributed Computing"},{"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/1806.00720","atlas_url":"https://app.syntology.ai/?focus=1806.00720","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1806.00720"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.00720\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.00720"},"call":"get_concepts_for_paper(arxiv_id=\"1806.00720\")"}],"by_repo":[{"repo":"LiuHaiTao01/GRBCM","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":"a2c4eb74edb6c7eeb0c751fd969ce888ac0918ff4aca006e8e8f916a8d823ef9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}