Pith. sign in

REVIEW 3 major objections 4 minor 37 references

Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders

T0 review · 3 major / 4 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper claims that domain-conditioned personalization of both user behavior and candidate representations in target-aware attention consistently improves multi-domain ranking, and reports significant online revenue lifts of 1.00% ADVV…

desk verdict A competent industrial multi-domain recommender paper with a genuinely new domain-conditioned 'scale and query' mechanism, held back by an underspecified domain feature vector and missing variance reporting. read the letter →

arxiv 2502.05523 v3 pith:WIXA26BX submitted 2025-02-08 cs.IR

Zheng Chai , Hui Lu , Di Chen , Qin Ren , Yuchao Zheng , Xun Zhou This is my paper · ORCID
classification cs.IR
keywords Multi-domainrecommendationSequentialmodelingTarget-awareattentionPersonalizedrepresentationClick-throughratepredictionParametergenerationIndustrialrecommendersystem
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes Adaptive Domain Scaling (ADS), a plug-in for target-aware attention in multi-domain recommender ranking. Its two modules, PSRG and PCRG, generate domain-conditioned versions of the user behavior sequence embeddings and of the candidate item queries before attention is applied. The central claim is that this recovers personalization lost when a shared embedding table and a single shared query are used across all domains. Offline, ADS beats the second-best approach in every backbone group on Taobao, Douyin Ads, and Douyin Ecom; online, it reports a 1.00% ADVV lift in Douyin Ads and a 0.79% GMV/U lift in Douyin Ecom. If true, it is a low-cost, backbone-agnostic way to inject multi-domain personalization into sequential modeling.

What carries the argument

Two generation networks built on a share-and-private design. Sequence-Weight Gen-Net computes $\mathbf{W}_{private} = \text{Sigmoid}(\text{ReLU}(E_D \mathbf{W}_1^T + \mathbf{b}_1) \mathbf{W}_2^T + \mathbf{b}_2)$, then $\mathbf{W}_{generated} = \eta (\mathbf{W}_{shared} \odot \mathbf{W}_{private})$ with a learnable global $\mathbf{W}_{shared}$; Sequence-Bias Gen-Net produces $\mathbf{b}_{generated}$ similarly. PSRG applies the resulting affine map to the sequence embedding $E_S$. Multi-Query Gen-Net computes $E_{Q\_private} = \text{ReLU}([E_D \oplus E_Q] \mathbf{W}_{q1}^T + \mathbf{b}_{q1}) \mathbf{W}_{q2}^T + \mathbf{b}_{q2}$, and PCRG forms per-position queries $E_{Q\_private} + \text{tile}(E_Q)$. A chunked variant groups adjacent actions to lower cost. These personalized queries, keys, and values feed standard target attention (DIN, MHA, CAN) and then the ranking MLP.

What would settle it

Run ADS with $E_D$ reduced to the explicit scenario ID alone (dropping the engineered statistical features) on Douyin Ads; if the AUC gain over the backbone does not largely disappear, the claim that implicit domain features carry the personalization would be weakened. Alternatively, compute the variance of $\mathbf{W}_{generated}$ across samples within one scenario: near-zero variance would contradict the per-user personalization story.

Watch

Extended reading notes

Core claim

The paper's central claim is that two shortcomings of multi-domain target-aware attention — the shared sequence embedding that ignores the domain a user is acting in, and the single candidate query that ignores which history item it is attending to — can be repaired by generating representations conditioned on domain features $E_D$. PSRG learns a global weight matrix $\mathbf{W}_{shared}$ that is element-wise scaled by a sigmoid-gated private weight $\mathbf{W}_{private}$ (with a tuned factor $\eta$) and combined with a generated bias; the resulting affine transform maps each sequence item embedding to a personalized one, so the same item differs across user-domain contexts. PCRG builds a private query per sequence position from $[E_D \oplus E_Q]$ through a two-layer MLP and adds it residually to the tiled original query, letting the candidate ask different questions of each history item. The paper reports consistent wins over the second-best method in every backbone group on three datasets, and online A/B tests with statistical significance at the level reported.

Load-bearing premise

The entire adaptation is driven by the domain feature vector $E_D$; if those features are too coarse to separate users or scenarios at the instance level, the generated transforms become nearly constant and the claimed per-user personalization collapses to a fixed per-scenario scaling.

Editorial extensions

If this is right

  • Any target-aware attention backbone can be upgraded by prepending PSRG and PCRG; gains appear with DIN, MHA, and CAN alike.
  • Sequence items become context-dependent: identical items are embedded differently across user domains, allowing the attention to reflect scenario-specific attraction.
  • The candidate becomes multi-faceted: different history positions are queried with different representations of the same target item.
  • Chunk size tunes the personalization-compute tradeoff; smaller chunks (down to per-item) monotonically improve AUC at higher FLOPs.
  • Industrial deployment is feasible at low overhead: +3.6% training time and no latency change, with online revenue lifts of 1.00% ADVV and 0.79% GMV/U.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If $E_D$ is the bottleneck, replacing the hand-built statistical domain features with learned user-level or cluster-level domain embeddings could amplify the gains, since PSRG and PCRG are agnostic to what $E_D$ encodes.
  • The per-position query mechanism resembles a form of multi-aspect target attention; one could test whether the generated queries specialize into interpretable aspects such as price-sensitive versus creator-sensitive behavior by probing or clustering the queries.
  • The method should transfer to retrieval or cold-start settings because query generation depends only on the target embedding and domain features, not on the candidate corpus, though the chunked variant would be needed to control cost.
  • The paper's offline significance convention treats 0.1%–0.2% overall Imp as meaningful without error bars; re-running with confidence intervals on repeated seeds would sharpen the comparison.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes Adaptive Domain Scaling (ADS), a plug-and-play module for multi-domain target-aware sequence modeling in recommender systems. ADS contains two components: Personalized Sequence Representation Generation (PSRG), which applies a learnable affine transformation to user behavior item embeddings using domain-related features, and Personalized Candidate Representation Generation (PCRG), which generates one query per sequence position by combining the target item embedding with domain features. The adapted keys, values, and queries are fed into standard attention backbones (DIN, MHA, and CAN). The authors evaluate on the public Taobao dataset and two billion-scale industrial datasets from ByteDance, report consistent AUC gains over strong baselines across all backbone groups, provide ablations removing each module, and present online A/B experiments in Douyin Ads and Douyin Ecom with business-metric lifts of 0.52%-1.00%.

Significance. If the reported results hold, ADS is a simple and architecture-agnostic contribution that extends multi-domain personalization to sequence modeling, an area the paper correctly identifies as under-served relative to feature-interaction multi-domain methods. The paper's strengths are its broad offline evaluation across three backbones and three datasets, the inclusion of a public dataset, and the deployment evidence with clearly named business metrics and user counts. Ablations confirm that both modules contribute, and the chunked variant of PCRG addresses efficiency concerns. The main caveats are (i) the undefined 'implicit-domain-indicator' features that form the backbone of the adaptivity mechanism, and (ii) unsupported statistical significance claims without error bars. These are fixable with additional description and reporting, but they currently prevent a full assessment of whether the gains come from the architecture or from input-feature asymmetries.

major comments (3)
  1. [Section 2.2.1, Eqs. (2), (4), (6)] E_D is the sole input that makes PSRG and PCRG adaptive, yet the 'implicit-domain-indicator features' are described only as 'engineer-constructed statistical features' and are never enumerated. If these features include user-activity or label-adjacent statistics that the DIN/MHA/CAN/FRNet/PEPNet baselines do not receive, the Table 2 comparison is confounded because the input features, not the network structure, may explain the gains; if E_D is essentially a scenario ID, then Eq. (5) applies the same affine map to all sequence positions and the claimed per-user personalization reduces to a small set of domain-level linear transforms. Please specify the exact feature set, its dimensionality, and include an ablation that removes or randomizes E_D to isolate the architecture.
  2. [Section 3.2 and Table 2] The caption states that gray-shaded results are significant at p < 0.05, but no standard errors, confidence intervals, number of repeated runs, or statistical test are reported anywhere, and the same issue affects the p < 0.01 claims in Tables 4 and 5. With a single evaluation split per dataset, significance cannot be established; please report the variance across repeated training or, if only one run is feasible for billion-scale data, state this explicitly and replace the p-value claim with a threshold-based statement.
  3. [Section 3.3, Table 3] The ablation only removes modules from the full ADS and never varies the content of E_D, so it cannot distinguish the effect of the domain-conditioned transformation from the effect of the extra parameters introduced by the two MLP-based generation networks. A control that applies the same generated transformation to a random or fixed domain indicator would strengthen the claim that multi-domain conditioning, rather than added capacity, drives the gains.
minor comments (4)
  1. [Throughout] There are several typographical errors, including 'accomodate', 'distrbutions', and 'senarios' (in Section 3.1); the paper should be carefully proofread.
  2. [Section 3.1, Eq. (14)] The definition of AUC Imp. normalizes by AUC = 0.5 as the random baseline, but the surrounding text's repeated statement that 'a random strategy yields AUC value at 0.5' is redundant; consider clarifying that this is the standard normalized improvement metric.
  3. [Figure 2] The figure is dense and the data-flow arrows connecting scenario-related features to PSRG and PCRG are not labeled with the corresponding tensor shapes or equation numbers; please annotate the figure to make it self-contained.
  4. [Section 3.1] The claim that 'a 0.1% Overall Imp. in Douyin Ads and 0.2% Overall Imp. in Douyin Ecom is considered to be significant' is informal; please define the offline significance threshold more precisely and indicate whether it is calibrated against historical online A/B outcomes.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: ADS is an end-to-end trained architecture evaluated against external baselines and public data, with no fitted constant renamed as a prediction.

full rationale

The paper's claimed contribution is an architectural module set (PSRG and PCRG) trained end-to-end by binary cross-entropy on holdout data. The transformations in Eqs. (2)-(5) and (6)-(7) are learned network parameters, not quantities fitted to a target metric and then reported as predictions of that same metric. The sequence representation and candidate queries are generated from E_D and the target embedding, but these generations are not fitted to the final AUC or ADVV values; rather, the whole model is optimized on the standard CTR/CVR loss and then measured against DIN, MHA, and CAN baselines on the public Taobao dataset and large industrial logs. The ablation study in Table 3 does show that removing PCRG or both modules degrades offline AUC, which gives some independent evidence that the modules, rather than a hidden fitted constant, drive the gain. The online A/B results are reported as business metrics with stated significance thresholds, which is ordinary industrial practice and not circularity. The main weaknesses are the unspecified 'implicit-domain-indicator features' in Section 2.2.1 and reliance on internally declared significance heuristics; these are reproducibility and statistical-rigor concerns, not self-referential derivation. The self-citations ([5], [15]) are related work and are not load-bearing for the core claim. No equation in the paper reduces by construction to its own input, and no fitted parameter is renamed as a prediction. Therefore the appropriate finding is no significant circularity.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central empirical claim rests on modeling assumptions about domain features and evaluation thresholds rather than on new mathematical axioms or invented physical entities. The two free parameters (eta and chunk size) are tunable hyperparameters, and the domain-feature sufficiency assumption is the most consequential unverified premise.

free parameters (2)
  • eta scaling hyperparameter = not reported
    In Equation 3, eta scales the sigmoid-bounded private weight before element-wise product with the shared weight; its value is chosen by hand or tuning and is not reported.
  • chunk size G in PCRG chunked variant = 1, 2, 5, 10 explored; deployed value not stated
    The chunked-query generation groups adjacent sequence items into G chunks; sensitivity analysis (Figures 4 and 5) shows performance and training cost both increase as G decreases, so G is a tunable free parameter.
assumptions (4)
  • domain assumption The domain feature vector E_D sufficiently captures the domain and user-intent differences that matter.
    All PSRG and PCRG generations are conditioned only on E_D. If E_D does not separate domains at the user level, the generated weights and queries add no useful adaptation. The paper does not specify the implicit statistical features (Section 2.2.1).
  • domain assumption A 0.1% relative AUC improvement in Douyin Ads and 0.2% in Douyin Ecom is a meaningful significance threshold.
    Section 3.1 states this heuristic and uses it to interpret offline gains as significant, in the absence of reported error bars or repeated-run statistics.
  • domain assumption Binary cross-entropy loss and AUC adequately measure ranking quality for the deployed systems.
    The paper trains CTR/CVR models with cross-entropy and evaluates offline AUC, implicitly assuming these metrics transfer to the online business metrics used in Section 3.5.
  • domain assumption Filtering Taobao users to those with at least 200 interactions and 10 positive actions preserves representativeness.
    Section 3.1 applies this filter; it may bias the public benchmark toward heavy users and away from the cold-start users that motivate the personalization story.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders." pith.science (2026). https://pith.science/paper/WIXA26BX

@misc{pith2026250205523,
  author       = {Pith},
  title        = {Pith review of: Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WIXA26BX}},
  note         = {Machine review of arXiv:2502.05523}
}
read the original abstract

Users generally exhibit complex behavioral patterns and diverse intentions in multiple business scenarios of super applications like Douyin, presenting great challenges to current industrial multi-domain recommenders. To mitigate the discrepancies across diverse domains, researches and industrial practices generally emphasize sophisticated network structures to accomodate diverse data distributions, while neglecting the inherent understanding of user behavioral sequence from the multi-domain perspective. In this paper, we present Adaptive Domain Scaling (ADS) model, which comprehensively enhances the personalization capability in target-aware sequence modeling across multiple domains. Specifically, ADS comprises of two major modules, including personalized sequence representation generation (PSRG) and personalized candidate representation generation (PCRG). The modules contribute to the tailored multi-domain learning by dynamically learning both the user behavioral sequence item representation and the candidate target item representation under different domains, facilitating adaptive user intention understanding. Experiments are performed on both a public dataset and two billion-scaled industrial datasets, and the extensive results verify the high effectiveness and compatibility of ADS. Besides, we conduct online experiments on two influential business scenarios including Douyin Advertisement Platform and Douyin E-commerce Service Platform, both of which show substantial business improvements. Currently, ADS has been fully deployed in many recommendation services at ByteDance, serving billions of users.

Figures

Figures reproduced from arXiv: 2502.05523 by the authors.

Figure 1
Figure 1. Typical business scenarios in Douyin. With the exponential growth of digital contents and the widespread use of the internet, recommender systems have become a vital role for enhancing user experience and alleviating information overload [5, 15, 30]. In real-world applications, for improving user retention and promote business benefit, the demands of industrial recommen￾dation are widely distributed cross multiple d… view at source ↗
Figure 2
Figure 2. Overview of ADS. ADS consists of PCRG, PSRG, and target attention module. Given scenario-related features and [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Comparison of traditional target-attention methods [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Model parameter and training FLOPs patterns by [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Performance patterns by varying the number of chunks in ADS. [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 13 canonical work pages

  1. [1]

    Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al

  2. [2]

    Weijie Bian, Kailun Wu, Lejian Ren, Qi Pi, Yujing Zhang, Can Xiao, Xiang-Rong Sheng, Yong-Nan Zhu, Zhangming Chan, Na Mou, et al . 2022. CAN: feature co-action network for click-through rate prediction. InProceedings of the fifteenth ACM international conference on web search and data mining . 57–65

    2022

  3. [3]

    Yue Cao, Xiaojiang Zhou, Jiaqi Feng, Peihao Huang, Yao Xiao, Dayao Chen, and Sheng Chen. 2022. Sampling is all you need on modeling long-term user behaviors for CTR prediction. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management . 2974–2983

    2022

  4. [4]

    R Caruana. 1993. Multitask learning: A knowledge-based source of inductive bias1. In Proceedings of the Tenth International Conference on Machine Learning . Citeseer, 41–48

    work page 1993

  5. [5]

    Zheng Chai, Zhihong Chen, Chenliang Li, Rong Xiao, Houyi Li, Jiawei Wu, Jingxu Chen, and Haihong Tang. 2022. User-aware multi-interest learning for candidate matching in recommenders. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval . 1326–1335. Adaptive Domain Scaling for Personalized Sequ...

    work page 2022

  6. [6]

    Jianxin Chang, Chenbin Zhang, Yiqun Hui, Dewei Leng, Yanan Niu, Yang Song, and Kun Gai. 2023. Pepnet: Parameter and embedding personalized network for infusing with personalized prior information. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining . 3795–3804

    2023

  7. [7]

    Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, et al

  8. [8]

    Paul Covington, Jay Adams, and Emre Sargin. 2016. Deep neural networks for youtube recommendations. In Proceedings of the 10th ACM conference on recommender systems. 191–198

    2016

Show all 37 references
  1. [9]

    In Proceedings of the 1st workshop on deep learning for recommender systems

    Wide & deep learning for recommender systems. In Proceedings of the 1st workshop on deep learning for recommender systems . 7–10

  2. [10]

    Wei Guo, Chenxu Zhu, Fan Yan, Bo Chen, Weiwen Liu, Huifeng Guo, Hongkun Zheng, Yong Liu, and Ruiming Tang. 2023. DFFM: Domain Facilitated Feature Modeling for CTR Prediction. In Proceedings of the 32nd ACM International Con- ference on Information and Knowledge Management . 4602–4608

    2023

  3. [11]

    Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. In Proceedings of the 26th International Joint Conference on Artificial Intelligence . 1725–1731

    2017

  4. [12]

    Yuchen Jiang, Qi Li, Han Zhu, Jinbei Yu, Jin Li, Ziru Xu, Huihui Dong, and Bo Zheng. 2022. Adaptive domain interest network for multi-domain recommenda- tion. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 3212–3221

    2022

  5. [13]

    Tongwen Huang, Qingyun She, Zhiqiang Wang, and Junlin Zhang. 2020. GateNet: gating-enhanced deep network for click-through rate prediction. arXiv preprint arXiv:2007.03519 (2020)

    2020 arXiv

  6. [14]

    Chenglin Li, Yuanzhen Xie, Chenyun Yu, Bo Hu, Zang Li, Guoqiang Shu, Xiaohu Qie, and Di Niu. 2023. One for all, all for one: Learning and transferring user embeddings for cross-domain recommendation. In Proceedings of the Sixteenth ACM International Conference on Web Search an...

    2023

  7. [15]

    Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic opti- mization. In Proceedings of ICLR

    2015

  8. [16]

    Qi Pi, Guorui Zhou, Yujing Zhang, Zhe Wang, Lejian Ren, Ying Fan, Xiaoqiang Zhu, and Kun Gai. 2020. Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction. In Proceedings of the 29th ACM International Conference on Informat...

    2020

  9. [17]

    Hui Lu, Zheng Chai, Yuchao Zheng, Zhe Chen, Deping Xie, Peng Xu, Xun Zhou, and Di Wu. 2025. Large Memory Network for Recommendation. In Proceedings of the ACM Web Conference. https://doi.org/10.1145/3701716.3715514

    2025

  10. [18]

    Qijie Shen, Hong Wen, Wanjie Tao, Jing Zhang, Fuyu Lv, Zulong Chen, and Zhao Li. 2022. Deep interest highlight network for click-through rate prediction in trigger-induced recommendation. In Proceedings of the ACM Web Conference 2022. 422–430

    2022

  11. [19]

    Steffen Rendle. 2010. Factorization machines. In2010 IEEE International conference on data mining. IEEE, 995–1000

    2010

  12. [20]

    Hongyan Tang, Junning Liu, Ming Zhao, and Xudong Gong. 2020. Progressive layered extraction (ple): A novel multi-task learning (mtl) model for personalized recommendations. In Proceedings of the 14th ACM Conference on Recommender Systems. 269–278

    2020

  13. [21]

    Xiang-Rong Sheng, Liqin Zhao, Guorui Zhou, Xinyao Ding, Binding Dai, Qiang Luo, Siran Yang, Jingshan Lv, Chi Zhang, Hongbo Deng, et al. 2021. One model to serve all: Star topology adaptive recommender for multi-domain ctr prediction. In Proceedings of the 30th ACM Internationa...

    2021

  14. [22]

    Fangye Wang, Yingxu Wang, Dongsheng Li, Hansu Gu, Tun Lu, Peng Zhang, and Ning Gu. 2022. Enhancing CTR prediction with context-aware feature repre- sentation learning. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retr...

    2022

  15. [23]

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in neural information processing systems 30 (2017)

    2017

  16. [24]

    Ruoxi Wang, Rakesh Shivanna, Derek Cheng, Sagar Jain, Dong Lin, Lichan Hong, and Ed Chi. 2021. DCN v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems. In Proceedings of the web conference 2021 . 1785–1797

    2021

  17. [25]

    Ruoxi Wang, Bin Fu, Gang Fu, and Mingliang Wang. 2017. Deep & cross network for ad click predictions. In Proceedings of the ADKDD’17 . 1–7

    2017

  18. [26]

    Bencheng Yan, Pengjie Wang, Kai Zhang, Feng Li, Hongbo Deng, Jian Xu, and Bo Zheng. 2022. Apg: Adaptive parameter generation network for click-through rate prediction. Advances in Neural Information Processing Systems 35 (2022), 24740–24752

    2022

  19. [27]

    Zhiqiang Wang, Qingyun She, and Junlin Zhang. 2021. Masknet: Introducing feature-wise multiplication to CTR ranking models by instance-guided mask. arXiv preprint arXiv:2102.07619 (2021)

    2021 arXiv

  20. [28]

    Xuanhua Yang, Xiaoyu Peng, Penghui Wei, Shaoguo Liu, Liang Wang, and Bo Zheng. 2022. Adasparse: Learning adaptively sparse structures for multi-domain click-through rate prediction. In Proceedings of the 31st ACM International Con- ference on Information & Knowledge Management...

    2022

  21. [29]

    Ling Yan, Wu-Jun Li, Gui-Rong Xue, and Dingyi Han. 2014. Coupled group lasso for web-scale ctr prediction in display advertising. In International conference on machine learning. PMLR, 802–810

    2014

  22. [30]

    Shuai Zhang, Lina Yao, Aixin Sun, and Yi Tay. 2019. Deep learning based recom- mender system: A survey and new perspectives. ACM computing surveys (CSUR) 52, 1 (2019), 1–38

    2019

  23. [31]

    Buyun Zhang, Liang Luo, Xi Liu, Jay Li, Zeliang Chen, Weilin Zhang, Xiaohan Wei, Yuchen Hao, Michael Tsang, Wenjun Wang, et al. 2022. DHEN: A deep and hierarchical ensemble network for large-scale click-through rate prediction. In Proceedings of the DLP-KDD

    2022

  24. [32]

    Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. 2019. Deep interest evolution network for click-through rate prediction. In Proceedings of the AAAI conference on artificial intelligence , Vol. 33. 5941–5948

    2019

  25. [33]

    Yiqian Zhang, Yinfu Feng, Wen-Ji Zhou, Yunan Ye, Min Tan, Rong Xiao, Haihong Tang, Jiajun Ding, and Jun Yu. 2024. Multi-Domain Deep Learning from a Multi- View Perspective for Cross-Border E-commerce Search. In Proceedings of the AAAI Conference on Artificial Intelligence , Vo...

    2024

  26. [34]

    Han Zhu, Xiang Li, Pengye Zhang, Guozheng Li, Jie He, Han Li, and Kun Gai

  27. [35]

    Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining ...

    2018

  28. [2016]

    In 12th USENIX symposium on operating systems design and implementation (OSDI 16)

    TensorFlow: a system for large-scale machine learning. In 12th USENIX symposium on operating systems design and implementation (OSDI 16) . 265–283

  29. [2018]

    In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining

    Learning tree-based deep model for recommender systems. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 1079–1088

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.