{"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/simple-bayesian-algorithms-for-best-arm","title":"Simple Bayesian Algorithms for Best Arm Identification","arxiv_id":"1602.08448","date":"2016-02-26","proceeding":null,"authors":["Daniel Russo"],"abstract":"This paper considers the optimal adaptive allocation of measurement effort\nfor identifying the best among a finite set of options or designs. An\nexperimenter sequentially chooses designs to measure and observes noisy signals\nof their quality with the goal of confidently identifying the best design after\na small number of measurements. This paper proposes three simple and intuitive\nBayesian algorithms for adaptively allocating measurement effort, and\nformalizes a sense in which these seemingly naive rules are the best possible.\nOne proposal is top-two probability sampling, which computes the two designs\nwith the highest posterior probability of being optimal, and then randomizes to\nselect among these two. One is a variant of top-two sampling which considers\nnot only the probability a design is optimal, but the expected amount by which\nits quality exceeds that of other designs. The final algorithm is a modified\nversion of Thompson sampling that is tailored for identifying the best design.\nWe prove that these simple algorithms satisfy a sharp optimality property. In a\nfrequentist setting where the true quality of the designs is fixed, one hopes\nthe posterior definitively identifies the optimal design, in the sense that\nthat the posterior probability assigned to the event that some other design is\noptimal converges to zero as measurements are collected. We show that under the\nproposed algorithms this convergence occurs at an exponential rate, and the\ncorresponding exponent is the best possible among all allocation","url_abs":"http://arxiv.org/abs/1602.08448v4","url_pdf":"http://arxiv.org/pdf/1602.08448v4.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":"simple-bayesian-algorithms-for-best-arm","repo_url":"https://github.com/PlaytikaOSS/pybandits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.08448","atlas_url":"https://app.syntology.ai/?focus=1602.08448","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":"1602.08448"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.08448\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.08448"},"call":"get_concepts_for_paper(arxiv_id=\"1602.08448\")"}],"by_repo":[{"repo":"PlaytikaOSS/pybandits","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":"2ba7bb5c0536d79e61d5de08e76c865cd199aface04fd49b85dd919389e1d24e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}