Papers › Learning deep structured semantic models for web search using clickthrough data

Learning deep structured semantic models for web search using clickthrough data

27 Oct 2013CIKM 2013 10archive 2025-07-28

Po-Sen Huang, Xiaodong He, Jianfeng Gao, Li Deng, Alex Acero, Larry Heck

Latent semantic models, such as LSA, intend to map a query to its relevant documents at the semantic level where keyword-based matching often fails. In this study we strive to develop a series of new latent semantic models with a deep structure that project queries and documents into a common low-dimensional space where the relevance of a document given a query is readily computed as the distance between them. The proposed deep structured semantic models are discriminatively trained by maximizing the conditional likelihood of the clicked documents given a query using the clickthrough data. To make our models applicable to large-scale Web search applications, we also use a technique called word hashing, which is shown to effectively scale up our semantic models to handle large vocabularies which are common in such tasks. The new models are evaluated on a Web document ranking task using a real-world data set. Results show that our best model significantly outperforms other latent semantic models, which were considered state-of-the-art in the performance prior to the work presented in this paper.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

PaddlePaddle/PaddleRec paddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ESCM²: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation (arXiv:2204.05125; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
UlionTse/mlgb pytorchSyntology: not harvested report
Wings236/DSSM_pytorch pytorchSyntology: not harvested report
alibaba/EasyRec tfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Deep Learning Recommendation Model for Personalization and Recommendation Systems (arXiv:1906.00091; that paper's own run record: 19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. report
alibaba/TorchEasyRec pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for... (arXiv:2402.17152; that paper's own run record: 15 ran (of which 13 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 27 unverified); nothing checks that they implement this paper's method. report
xue-pai/FuxiCTR pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to APG: Adaptive Parameter Generation Network for Click-Through Rate Prediction (arXiv:2203.16218; that paper's own run record: 0 ran · 1 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Document Ranking

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections