{"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-deep-structured-semantic-models-for","title":"Learning deep structured semantic models for web search using clickthrough data","arxiv_id":null,"date":"2013-10-27","proceeding":"CIKM 2013 10","authors":["Po-Sen Huang","Xiaodong He","Jianfeng Gao","Li Deng","Alex Acero","Larry Heck"],"abstract":"Latent semantic models, such as LSA, intend to map a query to its\r\nrelevant documents at the semantic level where keyword-based\r\nmatching often fails. In this study we strive to develop a series of\r\nnew latent semantic models with a deep structure that project\r\nqueries and documents into a common low-dimensional space\r\nwhere the relevance of a document given a query is readily\r\ncomputed as the distance between them. The proposed deep\r\nstructured semantic models are discriminatively trained by\r\nmaximizing the conditional likelihood of the clicked documents\r\ngiven a query using the clickthrough data. To make our models\r\napplicable to large-scale Web search applications, we also use a\r\ntechnique called word hashing, which is shown to effectively\r\nscale up our semantic models to handle large vocabularies which\r\nare common in such tasks. The new models are evaluated on a\r\nWeb document ranking task using a real-world data set. Results\r\nshow that our best model significantly outperforms other latent\r\nsemantic models, which were considered state-of-the-art in the\r\nperformance prior to the work presented in this paper.","url_abs":"https://dl.acm.org/doi/10.1145/2505515.2505665","url_pdf":"https://posenhuang.github.io/papers/cikm2013_DSSM_fullversion.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-deep-structured-semantic-models-for","repo_url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/match/dssm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"learning-deep-structured-semantic-models-for","repo_url":"https://github.com/UlionTse/mlgb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-deep-structured-semantic-models-for","repo_url":"https://github.com/Wings236/DSSM_pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"learning-deep-structured-semantic-models-for","repo_url":"https://github.com/alibaba/EasyRec/blob/master/easy_rec/python/model/dssm.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"learning-deep-structured-semantic-models-for","repo_url":"https://github.com/alibaba/TorchEasyRec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"learning-deep-structured-semantic-models-for","repo_url":"https://github.com/xue-pai/FuxiCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"document-ranking","task_name":"Document Ranking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"PaddlePaddle/PaddleRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.05125"],"harvested_for_calls":[{"arxiv_id":"2204.05125","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.05125"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.05125\")"}]},{"repo":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Wings236/DSSM_pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alibaba/EasyRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1906.00091"],"harvested_for_calls":[{"arxiv_id":"1906.00091","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.00091"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.00091\")"}]},{"repo":"alibaba/TorchEasyRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.17152"],"harvested_for_calls":[{"arxiv_id":"2402.17152","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.17152"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.17152\")"}]},{"repo":"xue-pai/FuxiCTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.16218"],"harvested_for_calls":[{"arxiv_id":"2203.16218","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.16218"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.16218\")"}]}],"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":"c0e13bd844bc181da3b8f71825981b91d698320e50c47d51adf3b521ca2db107","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}