{"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/batch-selection-for-parallelisation-of","title":"Batch Selection for Parallelisation of Bayesian Quadrature","arxiv_id":"1812.01553","date":"2018-12-04","proceeding":null,"authors":["Ed Wagstaff","Saad Hamid","Michael Osborne"],"abstract":"Integration over non-negative integrands is a central problem in machine\nlearning (e.g. for model averaging, (hyper-)parameter marginalisation, and\ncomputing posterior predictive distributions). Bayesian Quadrature is a\nprobabilistic numerical integration technique that performs promisingly when\ncompared to traditional Markov Chain Monte Carlo methods. However, in contrast\nto easily-parallelised MCMC methods, Bayesian Quadrature methods have, thus\nfar, been essentially serial in nature, selecting a single point to sample at\neach step of the algorithm. We deliver methods to select batches of points at\neach step, based upon those recently presented in the Batch Bayesian\nOptimisation literature. Such parallelisation significantly reduces computation\ntime, especially when the integrand is expensive to sample.","url_abs":"http://arxiv.org/abs/1812.01553v1","url_pdf":"http://arxiv.org/pdf/1812.01553v1.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":"batch-selection-for-parallelisation-of","repo_url":"https://github.com/OxfordML/bayesquad","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"bayesian-optimisation","task_name":"Bayesian Optimisation"},{"task_slug":"numerical-integration","task_name":"Numerical Integration"}],"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":"OxfordML/bayesquad","kind":"listed","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":"d6bfd4017287363eed7f1b3d8a7daf2c8e02fb690c647f61dade8d8543c5c791","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}