2000 character limit reached
Temporal Importance Factor for Loss Functions for CTR Prediction (2311.16878v1)
Published 28 Nov 2023 in cs.IR
Abstract: Click-through rate (CTR) prediction is an important task for the companies to recommend products which better match user preferences. User behavior in digital advertising is dynamic and changes over time. It is crucial for the companies to capture the most recent trends to provide more accurate recommendations for users. In CTR prediction, most models use binary cross-entropy loss function. However, it does not focus on the data distribution shifts occurring over time. To address this problem, we propose a factor for the loss functions by utilizing the sequential nature of user-item interactions. This approach aims to focus on the most recent samples by penalizing them more through the loss function without forgetting the long-term information. Our solution is model-agnostic, and the temporal importance factor can be used with different loss functions. Offline experiments in both public and company datasets show that the temporal importance factor for loss functions outperforms the baseline loss functions considered.
- Predicting clicks: Estimating the click-through rate for new ads. In Proceedings of the 16th International Conference on World Wide Web, WWW ’07, page 521–530, New York, NY, USA, 2007. Association for Computing Machinery.
- Xinfei Wang. A survey of online advertising click-through rate prediction models. In 2020 IEEE International Conference on Information Technology,Big Data and Artificial Intelligence (ICIBA), volume 1, pages 516–521, 2020.
- Shawn R. Wolfe and Yi Zhang. Interaction and personalization of criteria in recommender systems. In Paul De Bra, Alfred Kobsa, and David Chin, editors, User Modeling, Adaptation, and Personalization, pages 183–194, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.
- AMER: automatic behavior modeling and interaction exploration in recommender system. CoRR, abs/2006.05933, 2020.
- Masknet: Introducing feature-wise multiplication to CTR ranking models by instance-guided mask. CoRR, abs/2102.07619, 2021.
- Deepfm: A factorization-machine based neural network for CTR prediction. CoRR, abs/1703.04247, 2017.
- Autoint: Automatic feature interaction learning via self-attentive neural networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM ’19, page 1161–1170, New York, NY, USA, 2019. Association for Computing Machinery.
- Deep & cross network for ad click predictions. CoRR, abs/1708.05123, 2017.
- Difference embedding for recommender systems. Data Min. Knowl. Discov., 37(2):948–969, dec 2022.
- Steffen Rendle. Learning recommender systems with adaptive regularization. In Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM ’12, page 133–142, New York, NY, USA, 2012. Association for Computing Machinery.
- Autoloss: Automated loss function search in recommendations. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, KDD ’21, page 3959–3967, New York, NY, USA, 2021. Association for Computing Machinery.
- Managing popularity bias in recommender systems with personalized re-ranking. CoRR, abs/1901.07555, 2019.
- On the adaptation to concept drift for ctr prediction, 2023.
- Beyond incremental processing: Tracking concept drift. In Proceedings of the Fifth AAAI National Conference on Artificial Intelligence, AAAI’86, page 502–507. AAAI Press, 1986.
- Ivan Koychev. Gradual forgetting for adaptation to concept drift. ECAI, 08 2004.
- Deep time-aware item evolution network for click-through rate prediction. pages 785–794, 10 2020.
- Temporal diversity in recommender systems. In Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’10, page 210–217, New York, NY, USA, 2010. Association for Computing Machinery.
- Wide & deep learning for recommender systems. In Proceedings of the 1st Workshop on Deep Learning for Recommender Systems, DLRS 2016, page 7–10, New York, NY, USA, 2016. Association for Computing Machinery.
- Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD ’18, page 1059–1068, New York, NY, USA, 2018. Association for Computing Machinery.
- Deep interest evolution network for click-through rate prediction. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):5941–5948, Jul. 2019.
- Always strengthen your strengths: A drift-aware incremental learning framework for ctr prediction, 2023.
- A practical incremental method to train deep ctr models. arXiv preprint arXiv:2009.02147, 2020.
- Iterative boosting deep neural networks for predicting click-through rate. arXiv preprint arXiv:2007.13087, 2020.
- Towards open-world feature extrapolation: An inductive graph learning approach. Advances in Neural Information Processing Systems, 34:19435–19447, 2021.
- Bars: Towards open benchmarking for recommender systems, 2022.
- Fibinet: Combining feature importance and bilinear feature interaction for click-through rate prediction. CoRR, abs/1905.09433, 2019.
- Product-based neural networks for user response prediction. CoRR, abs/1611.00144, 2016.
- Finalmlp: An enhanced two-stream mlp model for ctr prediction, 2023.
- Adaptive factorization network: Learning adaptive-order feature interactions. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 3609–3616, 2020.
- Dcn v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems. In Proceedings of the web conference 2021, pages 1785–1797, 2021.
- Causalint: Causal inspired intervention for multi-scenario recommendation. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD ’22, page 4090–4099, New York, NY, USA, 2022. Association for Computing Machinery.