Papers › A Dual Augmented Two-tower Model for Online Large-scale Recommendation

A Dual Augmented Two-tower Model for Online Large-scale Recommendation

15 Aug 2021DLP-KDD 2021 8archive 2025-07-28

Yantao Yu, Weipeng Wang, Zhoutian Feng, Daiyue Xue

Many modern recommender systems have a very large corpus, and a common industrial recipe for handling large-scale retrieval is to learn query and item representations from their content features with the two-tower model. However, the model suffers from lack of information interaction between the two towers. Besides, imbalanced category data also hinders the model performance. In this paper, we propose a novel model named Dual Augmented Two-tower Model (DAT), which integrates a novel Adaptive-Mimic Mechanism (AMM) and a Category Alignment Loss (CAL). Our AMM customizes an augmented vector for each query and item to mitigate the lack of information interaction. Moreover, our CAL can further improve performance by aligning item representation of uneven categories. Offline experiments on large-scale datasets are conducted to show the superior performance of DAT. More-over, online A/B testings confirm that DAT can lead to improved recommendation quality for industrial applications.

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

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

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

Recommendation Systems

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