{"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/double-thompson-sampling-for-dueling-bandits","title":"Double Thompson Sampling for Dueling Bandits","arxiv_id":"1604.07101","date":"2016-04-25","proceeding":"NeurIPS 2016 12","authors":["Huasen Wu","Xin Liu"],"abstract":"In this paper, we propose a Double Thompson Sampling (D-TS) algorithm for\ndueling bandit problems. As indicated by its name, D-TS selects both the first\nand the second candidates according to Thompson Sampling. Specifically, D-TS\nmaintains a posterior distribution for the preference matrix, and chooses the\npair of arms for comparison by sampling twice from the posterior distribution.\nThis simple algorithm applies to general Copeland dueling bandits, including\nCondorcet dueling bandits as its special case. For general Copeland dueling\nbandits, we show that D-TS achieves $O(K^2 \\log T)$ regret. For Condorcet\ndueling bandits, we further simplify the D-TS algorithm and show that the\nsimplified D-TS algorithm achieves $O(K \\log T + K^2 \\log \\log T)$ regret.\nSimulation results based on both synthetic and real-world data demonstrate the\nefficiency of the proposed D-TS algorithm.","url_abs":"http://arxiv.org/abs/1604.07101v2","url_pdf":"http://arxiv.org/pdf/1604.07101v2.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":"double-thompson-sampling-for-dueling-bandits","repo_url":"https://github.com/HuasenWu/DuelingBandits","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1604.07101","atlas_url":"https://app.syntology.ai/?focus=1604.07101","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":"1604.07101"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1604.07101\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1604.07101"},"call":"get_concepts_for_paper(arxiv_id=\"1604.07101\")"}],"by_repo":[{"repo":"HuasenWu/DuelingBandits","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":"7d095ecad2af2db0add9d0d282c64950c3c7aa2ecec08d9677b267f026b61b59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}