{"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/efficient-counterfactual-learning-from-bandit","title":"Efficient Counterfactual Learning from Bandit Feedback","arxiv_id":"1809.03084","date":"2018-09-10","proceeding":null,"authors":["Yusuke Narita","Shota Yasui","Kohei Yata"],"abstract":"What is the most statistically efficient way to do off-policy evaluation and\noptimization with batch data from bandit feedback? For log data generated by\ncontextual bandit algorithms, we consider offline estimators for the expected\nreward from a counterfactual policy. Our estimators are shown to have lowest\nvariance in a wide class of estimators, achieving variance reduction relative\nto standard estimators. We then apply our estimators to improve advertisement\ndesign by a major advertisement company. Consistent with the theoretical\nresult, our estimators allow us to improve on the existing bandit algorithm\nwith more statistical confidence compared to a state-of-the-art benchmark.","url_abs":"http://arxiv.org/abs/1809.03084v3","url_pdf":"http://arxiv.org/pdf/1809.03084v3.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":[],"tasks":[{"task_slug":"causal-inference","task_name":"Causal Inference"},{"task_slug":"off-policy-evaluation","task_name":"Off-policy evaluation"},{"task_slug":"visual-object-tracking","task_name":"Visual Object Tracking"},{"task_slug":null,"task_name":"counterfactual"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/causal-inference-on-idhp","task":"Causal Inference","dataset":"IDHP","model":"","rank_in_archive_order":3,"of":3,"metrics":{"Average Treatment Effect Error":"-0.225"},"uses_additional_data":false},{"leaderboard":"/sota/visual-object-tracking-on-vot2014","task":"Visual Object Tracking","dataset":"VOT2014","model":"","rank_in_archive_order":1,"of":1,"metrics":{"Expected Average Overlap (EAO)":"1.047"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.03084","atlas_url":"https://app.syntology.ai/?focus=1809.03084","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":"1809.03084"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.03084\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.03084"},"call":"get_concepts_for_paper(arxiv_id=\"1809.03084\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"38055cfc3c5a3a4186fa0c9b43723474b2a55ee0adc48917eda794ed7eec32c9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}