The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Progressive Layered Extraction (PLE): A Novel Multi-Task Learning (MTL) Model for Personalized Recommendations
Abstract
Multi-task learning (MTL) has been successfully applied to many recommendation applications. However, MTL models often suffer from performance degeneration with negative transfer due to the complex and competing task correlation in real-world recommender systems. Moreover, through extensive experiments across SOTA MTL models, we have observed an interesting seesaw phenomenon that performance of one task is often improved by hurting the performance of some other tasks. To address these issues, we propose a Progressive Layered Extraction (PLE) model with a novel sharing structure design. PLE separates shared components and task-specific components explicitly and adopts a progressive routing mechanism to extract and separate deeper semantic knowledge gradually, improving efficiency of joint representation learning and information routing across tasks in a general setup. We apply PLE to both complicatedly correlated and normally correlated tasks, ranging from two-task cases to multi-task cases on a real-world Tencent video recommendation dataset with 1 billion samples, and results show that PLE outperforms state-of-the-art MTL models significantly under different task correlations and task-group size. Furthermore, online evaluation of PLE on a large-scale content recommendation platform at Tencent manifests 2.23% increase in view-count and 1.84% increase in watch time compared to SOTA MTL models, which is a significant improvement and demonstrates the effectiveness of PLE. Finally, extensive offline experiments on public benchmark datasets demonstrate that PLE can be applied to a variety of scenarios besides recommendations to eliminate the seesaw phenomenon. PLE now has been deployed to the online video recommender system in Tencent successfully.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
(1993) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1993.341010 · Cited by 14,265
Neural Architecture Search with Reinforcement Learning
Zoph, B., & Le, Q. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01578 · Cited by 3,974
Wide & Deep Learning for Recommender Systems
Cheng, H.-T., Koc, L., Harmsen, J., Shaked, T., Chandra, T., Aradhye, H., Anderson, G., Corrado, G., Chai, W., Ispir, M., et al. (2016) · Proceedings of the 1st Workshop on Deep Learning for Recommender Systems · doi:10.1145/2988450.2988454 · Cited by 3,535
Torrey, L., & Shavlik, J. (2010) · Handbook of Research on Machine Learning Applications and Trends · doi:10.4018/978-1-60566-766-9.ch011 · Cited by 1,503
Cross-Stitch Networks for Multi-task Learning
Misra, I., Shrivastava, A., Gupta, A., & Hebert, M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.433 · Cited by 1,397
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Ma, J., Zhao, Z., Yi, X., Chen, J., Hong, L., & Chi, E. H. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220007 · Cited by 1,233
End-To-End Multi-Task Learning With Attention
Liu, S., Johns, E., & Davison, A. J. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00197 · Cited by 1,202
Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
Ma, X., Zhao, L., Huang, G., Wang, Z., Hu, Z., Zhu, X., & Gai, K. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3210104 · Cited by 382
Olivas, E. S., Martín‐Guerrero, J. D., Martínez-Sober, M., Magdalena‐Benedito, R., & Serrano-López, A. J. (2009) · Cited by 363
Recommending what video to watch next: a multitask ranking system
Zhao, Z., Hong, L., Wei, L., Chen, J., Nath, A., Andrews, S., Kumthekar, A., Sathiamoorthy, M., Yi, X., & Chi, E. (2019) · Proceedings of the 13th ACM Conference on Recommender Systems · doi:10.1145/3298689.3346997 · Cited by 311
Ask the GRU: Multi-task Learning for Deep Text Recommendations
Bansal, T., Belanger, D., & McCallum, A. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959180 · Cited by 306
Multi-Pointer Co-Attention Networks for Recommendation
Tay, Y., Luu, A. T., & Hui, S. C. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220086 · Cited by 233
Explainable Recommendation via Multi-Task Learning in Opinionated Text Data
Wang, N., Wang, H., Jia, Y., & Yin, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3210010 · Cited by 208
SNR: Sub-Network Routing for Flexible Parameter Sharing in Multi-Task Learning
Ma, J., Zhao, Z., Chen, J., Li, A., Hong, L., & Ed, H. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301216 · Cited by 165
Sluice networks: Learning what to share between loosely related tasks.Preprint
Ruder, S., Bingel, J., Augenstein, I., & Søgaard, A. (2017) · arXiv (Cornell University) · Cited by 155
Why I like it: multi-task learning for recommendation and explanation
Lu, Y., Dong, R.-H., & Smyth, B. (2018) · ACM Conference on Recommender Systems · doi:10.1145/3240323.3240365 · Cited by 148
Co-Attentive Multi-Task Learning for Explainable Recommendation
Chen, Z., Wang, X., Xie, X., Wu, T., Bu, G., Wang, Y., & Chen, E. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/296 · Cited by 137
Multiple Relational Attention Network for Multi-task Learning
Zhao, J., Du, B., Sun, L., Zhuang, F., Lv, W., & Xiong, H. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330861 · Cited by 62
Online multi-task collaborative filtering for on-the-fly recommender systems
Wang, J., Hoi, S. C. H., Zhao, P., & Liu, Z. (2013) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2507157.2507176 · Cited by 47
Cited by
A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., et al. (2023) · ACM Transactions on Recommender Systems · doi:10.1145/3568022 · Cited by 1,082
A Survey on the Fairness of Recommender Systems
Wang, Y., Ma, W., Zhang, M., Liu, Y., & Ma, S. (2023) · ACM Transactions on Information Systems · doi:10.1145/3547333 · Cited by 356
Towards Universal Sequence Representation Learning for Recommender Systems
Hou, Y., Mu, S., Zhao, W. X., Li, Y., Ding, B., & Wen, J.-R. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539381 · Cited by 313
The Evolution of Mixture of Experts: A Survey from Basics to Breakthroughs
Vats, A., Raja, R., Jain, V., & Chadha, A. (2024) · doi:10.20944/preprints202408.0583.v2 · Cited by 10
Metadata
- Authors
- Tang, H., Liu, J., Zhao, M., & Gong, X.
- Venue
- Fourteenth ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2020-09-22
- Pages
- 269-278
- OpenAlex
- W3087931390
- Cited by
- 631
- References
- 20
- FWCI
- 42.27
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.