{"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/optimal-and-adaptive-off-policy-evaluation-in","title":"Optimal and Adaptive Off-policy Evaluation in Contextual Bandits","arxiv_id":"1612.01205","date":"2016-12-04","proceeding":"ICML 2017 8","authors":["Yu-Xiang Wang","Alekh Agarwal","Miroslav Dudik"],"abstract":"We study the off-policy evaluation problem---estimating the value of a target\npolicy using data collected by another policy---under the contextual bandit\nmodel. We consider the general (agnostic) setting without access to a\nconsistent model of rewards and establish a minimax lower bound on the mean\nsquared error (MSE). The bound is matched up to constants by the inverse\npropensity scoring (IPS) and doubly robust (DR) estimators. This highlights the\ndifficulty of the agnostic contextual setting, in contrast with multi-armed\nbandits and contextual bandits with access to a consistent reward model, where\nIPS is suboptimal. We then propose the SWITCH estimator, which can use an\nexisting reward model (not necessarily consistent) to achieve a better\nbias-variance tradeoff than IPS and DR. We prove an upper bound on its MSE and\ndemonstrate its benefits empirically on a diverse collection of data sets,\noften outperforming prior work by orders of magnitude.","url_abs":"http://arxiv.org/abs/1612.01205v2","url_pdf":"http://arxiv.org/pdf/1612.01205v2.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":"optimal-and-adaptive-off-policy-evaluation-in","repo_url":"https://github.com/facebookresearch/Horizon","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"optimal-and-adaptive-off-policy-evaluation-in","repo_url":"https://github.com/facebookresearch/ReAgent","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"optimal-and-adaptive-off-policy-evaluation-in","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":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"off-policy-evaluation","task_name":"Off-policy evaluation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.01205","atlas_url":"https://app.syntology.ai/?focus=1612.01205","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":"1612.01205"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.01205\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.01205"},"call":"get_concepts_for_paper(arxiv_id=\"1612.01205\")"}],"by_repo":[{"repo":"facebookresearch/Horizon","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"facebookresearch/ReAgent","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"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":"c4cdb56b1744b0be7c680695c5770440c075a36c5b2e901f8826a35a4849597a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}