{"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/twin-networks-matching-the-future-for","title":"Twin Networks: Matching the Future for Sequence Generation","arxiv_id":"1708.06742","date":"2017-08-22","proceeding":"ICLR 2018 1","authors":["Dmitriy Serdyuk","Nan Rosemary Ke","Alessandro Sordoni","Adam Trischler","Chris Pal","Yoshua Bengio"],"abstract":"We propose a simple technique for encouraging generative RNNs to plan ahead.\nWe train a \"backward\" recurrent network to generate a given sequence in reverse\norder, and we encourage states of the forward model to predict cotemporal\nstates of the backward model. The backward network is used only during\ntraining, and plays no role during sampling or inference. We hypothesize that\nour approach eases modeling of long-term dependencies by implicitly forcing the\nforward states to hold information about the longer-term future (as contained\nin the backward states). We show empirically that our approach achieves 9%\nrelative improvement for a speech recognition task, and achieves significant\nimprovement on a COCO caption generation task.","url_abs":"http://arxiv.org/abs/1708.06742v3","url_pdf":"http://arxiv.org/pdf/1708.06742v3.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":"twin-networks-matching-the-future-for","repo_url":"https://github.com/dmitriy-serdyuk/twin-net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"twin-networks-matching-the-future-for","repo_url":"https://github.com/mravanelli/pytorch-kaldi","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"caption-generation","task_name":"Caption Generation"},{"task_slug":"speech-recognition","task_name":"Speech Recognition"},{"task_slug":"speech-recognition-1","task_name":"speech-recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.06742","atlas_url":"https://app.syntology.ai/?focus=1708.06742","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":"1708.06742"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.06742\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.06742"},"call":"get_concepts_for_paper(arxiv_id=\"1708.06742\")"}],"by_repo":[{"repo":"dmitriy-serdyuk/twin-net","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mravanelli/pytorch-kaldi","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1811.07453"],"harvested_for_calls":[{"arxiv_id":"1811.07453","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.07453"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.07453\")"}]}],"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":"931f21d88faa32f3539141efc446e4e850c7b81b1f1e6aefd4fc589a9bd7e3de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}