{"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/learning-to-rank-question-answer-pairs-with","title":"Learning to Rank Question Answer Pairs with Holographic Dual LSTM Architecture","arxiv_id":"1707.06372","date":"2017-07-20","proceeding":null,"authors":["Tay Yi","Phan Minh C.","Tuan Luu Anh","Hui Siu Cheung"],"abstract":"We describe a new deep learning architecture for learning to rank question\nanswer pairs. Our approach extends the long short-term memory (LSTM) network\nwith holographic composition to model the relationship between question and\nanswer representations. As opposed to the neural tensor layer that has been\nadopted recently, the holographic composition provides the benefits of scalable\nand rich representational learning approach without incurring huge parameter\ncosts. Overall, we present Holographic Dual LSTM (HD-LSTM), a unified\narchitecture for both deep sentence modeling and semantic matching.\nEssentially, our model is trained end-to-end whereby the parameters of the LSTM\nare optimized in a way that best explains the correlation between question and\nanswer representations. In addition, our proposed deep learning architecture\nrequires no extensive feature engineering. Via extensive experiments, we show\nthat HD-LSTM outperforms many other neural architectures on two popular\nbenchmark QA datasets. Empirical studies confirm the effectiveness of\nholographic composition over the neural tensor layer.","url_abs":"http://arxiv.org/abs/1707.06372v1","url_pdf":"http://arxiv.org/pdf/1707.06372v1.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":"learning-to-rank-question-answer-pairs-with","repo_url":"https://github.com/lezzhov/learning_to_rank","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.06372","atlas_url":"https://app.syntology.ai/?focus=1707.06372","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":"1707.06372"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.06372\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.06372"},"call":"get_concepts_for_paper(arxiv_id=\"1707.06372\")"}],"by_repo":[{"repo":"lezzhov/learning_to_rank","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":"39c54a95cc9240308dd5552622943c14287daa20d666166b0997fc53a05a1b1b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}