{"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/asynchronous-parallel-bayesian-optimisation","title":"Asynchronous Parallel Bayesian Optimisation via Thompson Sampling","arxiv_id":"1705.09236","date":"2017-05-25","proceeding":null,"authors":["Kirthevasan Kandasamy","Akshay Krishnamurthy","Jeff Schneider","Barnabas Poczos"],"abstract":"We design and analyse variations of the classical Thompson sampling (TS)\nprocedure for Bayesian optimisation (BO) in settings where function evaluations\nare expensive, but can be performed in parallel. Our theoretical analysis shows\nthat a direct application of the sequential Thompson sampling algorithm in\neither synchronous or asynchronous parallel settings yields a surprisingly\npowerful result: making $n$ evaluations distributed among $M$ workers is\nessentially equivalent to performing $n$ evaluations in sequence. Further, by\nmodeling the time taken to complete a function evaluation, we show that, under\na time constraint, asynchronously parallel TS achieves asymptotically lower\nregret than both the synchronous and sequential versions. These results are\ncomplemented by an experimental analysis, showing that asynchronous TS\noutperforms a suite of existing parallel BO algorithms in simulations and in a\nhyper-parameter tuning application in convolutional neural networks. In\naddition to these, the proposed procedure is conceptually and computationally\nmuch simpler than existing work for parallel BO.","url_abs":"http://arxiv.org/abs/1705.09236v1","url_pdf":"http://arxiv.org/pdf/1705.09236v1.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":"asynchronous-parallel-bayesian-optimisation","repo_url":"https://github.com/kirthevasank/gp-parallel-ts","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"bayesian-optimisation","task_name":"Bayesian Optimisation"},{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[{"method_slug":"ts","method_name":"TS"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.09236","atlas_url":"https://app.syntology.ai/?focus=1705.09236","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":"1705.09236"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.09236\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.09236"},"call":"get_concepts_for_paper(arxiv_id=\"1705.09236\")"}],"by_repo":[{"repo":"kirthevasank/gp-parallel-ts","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":"bf19e88736eb721d82f014507ef22e1d19c5d86eac271c6cf609d7c6c56d70e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}