{"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/a-user-simulator-for-task-completion","title":"A User Simulator for Task-Completion Dialogues","arxiv_id":"1612.05688","date":"2016-12-17","proceeding":null,"authors":["Xiujun Li","Zachary C. Lipton","Bhuwan Dhingra","Lihong Li","Jianfeng Gao","Yun-Nung Chen"],"abstract":"Despite widespread interests in reinforcement-learning for task-oriented\ndialogue systems, several obstacles can frustrate research and development\nprogress. First, reinforcement learners typically require interaction with the\nenvironment, so conventional dialogue corpora cannot be used directly. Second,\neach task presents specific challenges, requiring separate corpus of\ntask-specific annotated data. Third, collecting and annotating human-machine or\nhuman-human conversations for task-oriented dialogues requires extensive domain\nknowledge. Because building an appropriate dataset can be both financially\ncostly and time-consuming, one popular approach is to build a user simulator\nbased upon a corpus of example dialogues. Then, one can train reinforcement\nlearning agents in an online fashion as they interact with the simulator.\nDialogue agents trained on these simulators can serve as an effective starting\npoint. Once agents master the simulator, they may be deployed in a real\nenvironment to interact with humans, and continue to be trained online. To ease\nempirical algorithmic comparisons in dialogues, this paper introduces a new,\npublicly available simulation framework, where our simulator, designed for the\nmovie-booking domain, leverages both rules and collected data. The simulator\nsupports two tasks: movie ticket booking and movie seeking. Finally, we\ndemonstrate several agents and detail the procedure to add and test your own\nagent in the proposed framework.","url_abs":"http://arxiv.org/abs/1612.05688v3","url_pdf":"http://arxiv.org/pdf/1612.05688v3.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":"a-user-simulator-for-task-completion","repo_url":"https://github.com/MiuLab/UserSimulator","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/Ambitioner-c/UserSimulator","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/AtmaHou/UserSimulator","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/MiuLab/TC-Bot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/Zhihan1996/User-sim","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/dirtdust/TC-Bot-python3","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/durashi/Dialog_policy_network_for_low_resource_setting","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/jerrylsu/TC-Bot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/markWJJ/TC-Bot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-user-simulator-for-task-completion","repo_url":"https://github.com/tanayz/TC-Bot-py3","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"task-oriented-dialogue-systems","task_name":"Task-Oriented Dialogue Systems"},{"task_slug":"user-simulation","task_name":"User Simulation"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.05688","atlas_url":"https://app.syntology.ai/?focus=1612.05688","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.05688"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.05688\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.05688"},"call":"get_concepts_for_paper(arxiv_id=\"1612.05688\")"}],"by_repo":[{"repo":"MiuLab/UserSimulator","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Ambitioner-c/UserSimulator","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.01008"],"harvested_for_calls":[{"arxiv_id":"1703.01008","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.01008"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.01008\")"}]},{"repo":"AtmaHou/UserSimulator","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.01008"],"harvested_for_calls":[{"arxiv_id":"1703.01008","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.01008"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.01008\")"}]},{"repo":"MiuLab/TC-Bot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.01008"],"harvested_for_calls":[{"arxiv_id":"1703.01008","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.01008"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.01008\")"}]},{"repo":"Zhihan1996/User-sim","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dirtdust/TC-Bot-python3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.01008"],"harvested_for_calls":[{"arxiv_id":"1703.01008","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.01008"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.01008\")"}]},{"repo":"durashi/Dialog_policy_network_for_low_resource_setting","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jerrylsu/TC-Bot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"markWJJ/TC-Bot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tanayz/TC-Bot-py3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"eb0807b5f2b089ad863dafeb6e874b795eb74b7c6d8e73532a97305041500a47","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}