{"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/the-parallel-knowledge-gradient-method-for","title":"The Parallel Knowledge Gradient Method for Batch Bayesian Optimization","arxiv_id":"1606.04414","date":"2016-06-14","proceeding":"NeurIPS 2016 12","authors":["Jian Wu","Peter I. Frazier"],"abstract":"In many applications of black-box optimization, one can evaluate multiple\npoints simultaneously, e.g. when evaluating the performances of several\ndifferent neural network architectures in a parallel computing environment. In\nthis paper, we develop a novel batch Bayesian optimization algorithm --- the\nparallel knowledge gradient method. By construction, this method provides the\none-step Bayes-optimal batch of points to sample. We provide an efficient\nstrategy for computing this Bayes-optimal batch of points, and we demonstrate\nthat the parallel knowledge gradient method finds global optima significantly\nfaster than previous batch Bayesian optimization algorithms on both synthetic\ntest functions and when tuning hyperparameters of practical machine learning\nalgorithms, especially when function evaluations are noisy.","url_abs":"http://arxiv.org/abs/1606.04414v4","url_pdf":"http://arxiv.org/pdf/1606.04414v4.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":"the-parallel-knowledge-gradient-method-for","repo_url":"https://github.com/wujian16/Cornell-MOE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"the-parallel-knowledge-gradient-method-for","repo_url":"https://github.com/wujian16/qKG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.04414","atlas_url":"https://app.syntology.ai/?focus=1606.04414","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":"1606.04414"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.04414\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.04414"},"call":"get_concepts_for_paper(arxiv_id=\"1606.04414\")"}],"by_repo":[{"repo":"wujian16/Cornell-MOE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"wujian16/qKG","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":"9e20b99b4d31b0d754242a7149ade0db1fd4e5730fcec2e7c63465d61cca2756","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}