{"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/doubly-robust-policy-evaluation-and","title":"Doubly Robust Policy Evaluation and Optimization","arxiv_id":"1503.02834","date":"2015-03-10","proceeding":null,"authors":["Miroslav Dudík","Dumitru Erhan","John Langford","Lihong Li"],"abstract":"We study sequential decision making in environments where rewards are only\npartially observed, but can be modeled as a function of observed contexts and\nthe chosen action by the decision maker. This setting, known as contextual\nbandits, encompasses a wide variety of applications such as health care,\ncontent recommendation and Internet advertising. A central task is evaluation\nof a new policy given historic data consisting of contexts, actions and\nreceived rewards. The key challenge is that the past data typically does not\nfaithfully represent proportions of actions taken by a new policy. Previous\napproaches rely either on models of rewards or models of the past policy. The\nformer are plagued by a large bias whereas the latter have a large variance. In\nthis work, we leverage the strengths and overcome the weaknesses of the two\napproaches by applying the doubly robust estimation technique to the problems\nof policy evaluation and optimization. We prove that this approach yields\naccurate value estimates when we have either a good (but not necessarily\nconsistent) model of rewards or a good (but not necessarily consistent) model\nof past policy. Extensive empirical comparison demonstrates that the doubly\nrobust estimation uniformly improves over existing techniques, achieving both\nlower variance in value estimation and better policies. As such, we expect the\ndoubly robust approach to become common practice in policy evaluation and\noptimization.","url_abs":"http://arxiv.org/abs/1503.02834v1","url_pdf":"http://arxiv.org/pdf/1503.02834v1.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":"doubly-robust-policy-evaluation-and","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":"decision-making","task_name":"Decision Making"},{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"sequential-decision-making","task_name":"Sequential Decision Making"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.02834","atlas_url":"https://app.syntology.ai/?focus=1503.02834","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":"1503.02834"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.02834\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.02834"},"call":"get_concepts_for_paper(arxiv_id=\"1503.02834\")"}],"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":"af543df179b4e501d2d4b202ee13027b548a59545a6844c2c4301303cd6d8f31","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}