{"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/towards-automatic-evaluation-of-dialog","title":"Towards Automatic Evaluation of Dialog Systems: A Model-Free Off-Policy Evaluation Approach","arxiv_id":"2102.10242","date":"2021-02-20","proceeding":"EMNLP 2021 11","authors":["Haoming Jiang","Bo Dai","Mengjiao Yang","Tuo Zhao","Wei Wei"],"abstract":"Reliable automatic evaluation of dialogue systems under an interactive environment has long been overdue. An ideal environment for evaluating dialog systems, also known as the Turing test, needs to involve human interaction, which is usually not affordable for large-scale experiments. Though researchers have attempted to use metrics (e.g., perplexity, BLEU) in language generation tasks or some model-based reinforcement learning methods (e.g., self-play evaluation) for automatic evaluation, these methods only show a very weak correlation with the actual human evaluation in practice. To bridge such a gap, we propose a new framework named ENIGMA for estimating human evaluation scores based on recent advances of off-policy evaluation in reinforcement learning. ENIGMA only requires a handful of pre-collected experience data, and therefore does not involve human interaction with the target policy during the evaluation, making automatic evaluations feasible. More importantly, ENIGMA is model-free and agnostic to the behavior policies for collecting the experience data (see details in Section 2), which significantly alleviates the technical difficulties of modeling complex dialogue environments and human behaviors. Our experiments show that ENIGMA significantly outperforms existing methods in terms of correlation with human evaluation scores.","url_abs":"https://arxiv.org/abs/2102.10242v3","url_pdf":"https://arxiv.org/pdf/2102.10242v3.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":"towards-automatic-evaluation-of-dialog","repo_url":"https://github.com/google-research/google-research","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"model-based-reinforcement-learning","task_name":"Model-based Reinforcement Learning"},{"task_slug":"off-policy-evaluation","task_name":"Off-policy evaluation"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"text-generation","task_name":"Text Generation"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"enigma","method_name":"ENIGMA"}],"datasets_introduced":[],"methods_introduced":[{"slug":"enigma","name":"ENIGMA","full_name":"ENIGMA"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2102.10242","atlas_url":"https://app.syntology.ai/?focus=2102.10242","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":"2102.10242"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2102.10242\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2102.10242"},"call":"get_concepts_for_paper(arxiv_id=\"2102.10242\")"}],"by_repo":[{"repo":"google-research/google-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":24,"harvested_for":["1802.03268","2003.12022","2004.13912","2006.04678","2006.15055","2007.07314","2009.14794","2104.04657","2105.01237","2106.03314","2106.03760","2106.11905","2107.05768","2110.11346","2111.06888","2201.08896","2202.00512","2209.14881","2210.15458","2303.00732","2305.07011","2305.16381","2310.18893","2405.05349"],"harvested_for_calls":[{"arxiv_id":"1802.03268","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.03268"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.03268\")"},{"arxiv_id":"2003.12022","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.12022"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.12022\")"},{"arxiv_id":"2004.13912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.13912"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.13912\")"},{"arxiv_id":"2006.04678","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04678"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04678\")"},{"arxiv_id":"2006.15055","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15055"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15055\")"},{"arxiv_id":"2007.07314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.07314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.07314\")"},{"arxiv_id":"2009.14794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14794\")"},{"arxiv_id":"2104.04657","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.04657"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.04657\")"},{"arxiv_id":"2105.01237","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01237"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01237\")"},{"arxiv_id":"2106.03314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03314\")"},{"arxiv_id":"2106.03760","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03760"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03760\")"},{"arxiv_id":"2106.11905","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.11905"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.11905\")"},{"arxiv_id":"2107.05768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.05768"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.05768\")"},{"arxiv_id":"2110.11346","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.11346"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.11346\")"},{"arxiv_id":"2111.06888","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.06888"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.06888\")"},{"arxiv_id":"2201.08896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.08896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.08896\")"},{"arxiv_id":"2202.00512","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.00512"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.00512\")"},{"arxiv_id":"2209.14881","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.14881"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.14881\")"},{"arxiv_id":"2210.15458","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.15458"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.15458\")"},{"arxiv_id":"2303.00732","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.00732"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.00732\")"},{"arxiv_id":"2305.07011","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.07011"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.07011\")"},{"arxiv_id":"2305.16381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16381"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16381\")"},{"arxiv_id":"2310.18893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.18893"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.18893\")"},{"arxiv_id":"2405.05349","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.05349"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.05349\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"965f3ab10600976834ffe452b6c903276d2748c24c928222e76b910afc6f6721","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}