{"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/thompson-sampling-for-contextual-bandits-with","title":"Thompson Sampling for Contextual Bandits with Linear Payoffs","arxiv_id":"1209.3352","date":"2012-09-15","proceeding":null,"authors":["Shipra Agrawal","Navin Goyal"],"abstract":"Thompson Sampling is one of the oldest heuristics for multi-armed bandit\nproblems. It is a randomized algorithm based on Bayesian ideas, and has\nrecently generated significant interest after several studies demonstrated it\nto have better empirical performance compared to the state-of-the-art methods.\nHowever, many questions regarding its theoretical performance remained open. In\nthis paper, we design and analyze a generalization of Thompson Sampling\nalgorithm for the stochastic contextual multi-armed bandit problem with linear\npayoff functions, when the contexts are provided by an adaptive adversary. This\nis among the most important and widely studied versions of the contextual\nbandits problem. We provide the first theoretical guarantees for the contextual\nversion of Thompson Sampling. We prove a high probability regret bound of\n$\\tilde{O}(d^{3/2}\\sqrt{T})$ (or $\\tilde{O}(d\\sqrt{T \\log(N)})$), which is the\nbest regret bound achieved by any computationally efficient algorithm available\nfor this problem in the current literature, and is within a factor of\n$\\sqrt{d}$ (or $\\sqrt{\\log(N)}$) of the information-theoretic lower bound for\nthis problem.","url_abs":"http://arxiv.org/abs/1209.3352v4","url_pdf":"http://arxiv.org/pdf/1209.3352v4.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":"thompson-sampling-for-contextual-bandits-with","repo_url":"https://github.com/PlaytikaOSS/pybandits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"thompson-sampling-for-contextual-bandits-with","repo_url":"https://github.com/yanyangbaobeiIsEmma/Reinforcement-Learning-Contextual-Bandits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1209.3352","atlas_url":"https://app.syntology.ai/?focus=1209.3352","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":"1209.3352"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1209.3352\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1209.3352"},"call":"get_concepts_for_paper(arxiv_id=\"1209.3352\")"}],"by_repo":[{"repo":"PlaytikaOSS/pybandits","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yanyangbaobeiIsEmma/Reinforcement-Learning-Contextual-Bandits","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":"992a05d1749ba684e3bc20274e4af5eebd388b7104bae682414d34ab389acd72","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}