{"url":"/task/click-through-rate-prediction","name":"Click-Through Rate Prediction","slug":"click-through-rate-prediction","description_markdown":"Click-through rate prediction is the task of predicting the likelihood that something on a website (such as an advertisement) will be clicked.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Deep Spatio-Temporal Neural Networks for Click-Through Rate Prediction](https://arxiv.org/pdf/1906.03776v2.pdf) )</span>","categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":391,"papers_with_code":165,"benchmarks":20,"benchmark_tables_in_archive":20,"benchmark_tables_shown":20,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":8,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","slug":"click-through-rate-prediction-on-criteo","dataset":"Criteo","dataset_url":"/dataset/criteo","rows_in_archive":39,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"QNN-α","paper_title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","paper_url":"/paper/revisiting-feature-interactions-from-the","paper_date":"2025-05-23","arxiv_id":"2505.17999","code_links":[{"title":"salmon1802/QNN","url":"https://github.com/salmon1802/QNN"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-avazu","slug":"click-through-rate-prediction-on-avazu","dataset":"Avazu","dataset_url":null,"rows_in_archive":15,"metrics":["AUC","LogLoss"],"first_row_in_archive_order":{"model":"OptInter","paper_title":"Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction","paper_url":"/paper/memorize-factorize-or-be-naive-learning","paper_date":"2021-08-03","arxiv_id":"2108.01265","code_links":[{"title":"fuyuanlyu/OptInter","url":"https://github.com/fuyuanlyu/OptInter"}],"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}}},{"leaderboard":"/sota/click-through-rate-prediction-on-company","slug":"click-through-rate-prediction-on-company","dataset":"Company*","dataset_url":null,"rows_in_archive":8,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"DeepFM","paper_title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","paper_url":"/paper/deepfm-a-factorization-machine-based-neural","paper_date":"2017-03-13","arxiv_id":"1703.04247","code_links":[{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/rank/deepfm"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"alibaba/EasyRec","url":"https://github.com/alibaba/EasyRec/blob/master/easy_rec/python/model/deepfm.py"},{"title":"xue-pai/FuxiCTR","url":"https://github.com/xue-pai/FuxiCTR"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"DataCanvasIO/DeepTables","url":"https://github.com/DataCanvasIO/DeepTables"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"Leavingseason/OpenLearning4DeepRecsys","url":"https://github.com/Leavingseason/OpenLearning4DeepRecsys"},{"title":"JianzhouZhan/Awesome-RecSystem-Models","url":"https://github.com/JianzhouZhan/Awesome-RecSystem-Models"},{"title":"GitHub-HongweiZhang/prediction-flow","url":"https://github.com/GitHub-HongweiZhang/prediction-flow"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/recommend/deepfm"},{"title":"Oneflow-Inc/models","url":"https://github.com/Oneflow-Inc/models/tree/main/RecommenderSystems/deepfm"},{"title":"hzn666/rlbid_ea","url":"https://github.com/hzn666/rlbid_ea"},{"title":"shiwang0211/kdd_cup_2019","url":"https://github.com/shiwang0211/kdd_cup_2019"},{"title":"baiyimeng/umc","url":"https://github.com/baiyimeng/umc"},{"title":"objectc/DeepFM","url":"https://github.com/objectc/DeepFM"},{"title":"meabhishekkumar/iith_session_2020","url":"https://github.com/meabhishekkumar/iith_session_2020"},{"title":"saulhazelius/deepFM","url":"https://github.com/saulhazelius/deepFM"},{"title":"sandeepnair2812/Deep-Learning-Based-Search-and-Recommendation-System","url":"https://github.com/sandeepnair2812/Deep-Learning-Based-Search-and-Recommendation-System"},{"title":"ddoeunn/recommender-system-implementation","url":"https://github.com/ddoeunn/recommender-system-implementation"},{"title":"codlife/NLP","url":"https://github.com/codlife/NLP"},{"title":"jamesdvance/predicting_clicks","url":"https://github.com/jamesdvance/predicting_clicks"}],"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":2}}},{"leaderboard":"/sota/click-through-rate-prediction-on-bing-news","slug":"click-through-rate-prediction-on-bing-news","dataset":"Bing News","dataset_url":null,"rows_in_archive":7,"metrics":["AUC","Log Loss","Accuracy"],"first_row_in_archive_order":{"model":"xDeepFM","paper_title":"xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems","paper_url":"/paper/xdeepfm-combining-explicit-and-implicit","paper_date":"2018-03-14","arxiv_id":"1803.05170","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"recommenders-team/recommenders","url":"https://github.com/recommenders-team/recommenders"},{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/rank/xdeepfm"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"xue-pai/FuxiCTR","url":"https://github.com/xue-pai/FuxiCTR"},{"title":"Leavingseason/xDeepFM","url":"https://github.com/Leavingseason/xDeepFM"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"bettenW/Tencent2019_Finals_Rank1st","url":"https://github.com/bettenW/Tencent2019_Finals_Rank1st"},{"title":"JianzhouZhan/Awesome-RecSystem-Models","url":"https://github.com/JianzhouZhan/Awesome-RecSystem-Models"},{"title":"tangxyw/RecAlgorithm","url":"https://github.com/tangxyw/RecAlgorithm"},{"title":"Rearcher/ICME2019_Short_Video_Understanding_Challenge_Rank14","url":"https://github.com/Rearcher/ICME2019_Short_Video_Understanding_Challenge_Rank14"},{"title":"caesarjuly/reginx","url":"https://github.com/caesarjuly/reginx/blob/master/trainer/models/xdeepfm.py"},{"title":"wangweitong/recommend_system","url":"https://github.com/wangweitong/recommend_system"},{"title":"wangweitong/DL","url":"https://github.com/wangweitong/DL"},{"title":"YZBM/Tenceng2019_Finals_Rank1st","url":"https://github.com/YZBM/Tenceng2019_Finals_Rank1st"},{"title":"DownyPrio/xDeepFM","url":"https://github.com/DownyPrio/xDeepFM"},{"title":"zhanafengxiaomi/xDeepFM_","url":"https://github.com/zhanafengxiaomi/xDeepFM_"},{"title":"zaf11/xDeepFM-","url":"https://github.com/zaf11/xDeepFM-"}],"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":2}}},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","slug":"click-through-rate-prediction-on-ipinyou","dataset":"iPinYou","dataset_url":"/dataset/ipinyou","rows_in_archive":7,"metrics":["AUC","LogLoss"],"first_row_in_archive_order":{"model":"OPNN","paper_title":"Product-based Neural Networks for User Response Prediction","paper_url":"/paper/product-based-neural-networks-for-user","paper_date":"2016-11-01","arxiv_id":"1611.00144","code_links":[{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"xue-pai/FuxiCTR","url":"https://github.com/xue-pai/FuxiCTR"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"Atomu2014/product-nets","url":"https://github.com/Atomu2014/product-nets"},{"title":"JianzhouZhan/Awesome-RecSystem-Models","url":"https://github.com/JianzhouZhan/Awesome-RecSystem-Models"},{"title":"tangxyw/RecAlgorithm","url":"https://github.com/tangxyw/RecAlgorithm"},{"title":"Atomu2014/product-nets-distributed","url":"https://github.com/Atomu2014/product-nets-distributed"},{"title":"wangweitong/recommend_system","url":"https://github.com/wangweitong/recommend_system"},{"title":"wangweitong/DL","url":"https://github.com/wangweitong/DL"},{"title":"jamesdvance/predicting_clicks","url":"https://github.com/jamesdvance/predicting_clicks"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-kkbox","slug":"click-through-rate-prediction-on-kkbox","dataset":"KKBox","dataset_url":"/dataset/kkbox","rows_in_archive":6,"metrics":["AUC"],"first_row_in_archive_order":{"model":"FCN","paper_title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","paper_url":"/paper/dcnv3-towards-next-generation-deep-cross","paper_date":"2024-07-18","arxiv_id":"2407.13349","code_links":[{"title":"reczoo/FuxiCTR","url":"https://github.com/reczoo/FuxiCTR"},{"title":"salmon1802/DCNv3","url":"https://github.com/salmon1802/DCNv3"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens","slug":"click-through-rate-prediction-on-movielens","dataset":"MovieLens 20M","dataset_url":"/dataset/movielens","rows_in_archive":6,"metrics":["AUC"],"first_row_in_archive_order":{"model":"github.com/guotong1988/movielens_dataset","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1m","slug":"click-through-rate-prediction-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":6,"metrics":["AUC","Accuracy","Log Loss"],"first_row_in_archive_order":{"model":"STEC","paper_title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","paper_url":"/paper/stec-see-through-transformer-based-encoder","paper_date":"2023-08-29","arxiv_id":"2308.15033","code_links":[],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-amazon","slug":"click-through-rate-prediction-on-amazon","dataset":"Amazon","dataset_url":null,"rows_in_archive":5,"metrics":["AUC"],"first_row_in_archive_order":{"model":"DIN + Dice Activation","paper_title":"Deep Interest Network for Click-Through Rate Prediction","paper_url":"/paper/deep-interest-network-for-click-through-rate","paper_date":"2017-06-21","arxiv_id":"1706.06978","code_links":[{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/rank/din"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"zhougr1993/DeepInterestNetwork","url":"https://github.com/zhougr1993/DeepInterestNetwork"},{"title":"reczoo/FuxiCTR","url":"https://github.com/reczoo/FuxiCTR"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"tangxyw/RecAlgorithm","url":"https://github.com/tangxyw/RecAlgorithm"},{"title":"GitHub-HongweiZhang/prediction-flow","url":"https://github.com/GitHub-HongweiZhang/prediction-flow"},{"title":"alibaba/TorchEasyRec","url":"https://github.com/alibaba/TorchEasyRec"},{"title":"searchlink/din","url":"https://github.com/searchlink/din"},{"title":"StephenBo-China/DIEN-DIN","url":"https://github.com/StephenBo-China/DIEN-DIN"},{"title":"StephenBo-China/recommendation_system_sort_model","url":"https://github.com/StephenBo-China/recommendation_system_sort_model"},{"title":"YunjiaXi/Multi-Level-Interaction-Reranking","url":"https://github.com/YunjiaXi/Multi-Level-Interaction-Reranking"},{"title":"YafeiWu/DIEN","url":"https://github.com/YafeiWu/DIEN"},{"title":"mikudehuane/Configurable-Tensorflow-DIN","url":"https://github.com/mikudehuane/Configurable-Tensorflow-DIN"},{"title":"johnlevi/recsys","url":"https://github.com/johnlevi/recsys"},{"title":"imvishvaraj/ctr_nlp","url":"https://github.com/imvishvaraj/ctr_nlp"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-dianping","slug":"click-through-rate-prediction-on-dianping","dataset":"Dianping","dataset_url":null,"rows_in_archive":5,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"xDeepFM","paper_title":"xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems","paper_url":"/paper/xdeepfm-combining-explicit-and-implicit","paper_date":"2018-03-14","arxiv_id":"1803.05170","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"recommenders-team/recommenders","url":"https://github.com/recommenders-team/recommenders"},{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/rank/xdeepfm"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"xue-pai/FuxiCTR","url":"https://github.com/xue-pai/FuxiCTR"},{"title":"Leavingseason/xDeepFM","url":"https://github.com/Leavingseason/xDeepFM"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"bettenW/Tencent2019_Finals_Rank1st","url":"https://github.com/bettenW/Tencent2019_Finals_Rank1st"},{"title":"JianzhouZhan/Awesome-RecSystem-Models","url":"https://github.com/JianzhouZhan/Awesome-RecSystem-Models"},{"title":"tangxyw/RecAlgorithm","url":"https://github.com/tangxyw/RecAlgorithm"},{"title":"Rearcher/ICME2019_Short_Video_Understanding_Challenge_Rank14","url":"https://github.com/Rearcher/ICME2019_Short_Video_Understanding_Challenge_Rank14"},{"title":"caesarjuly/reginx","url":"https://github.com/caesarjuly/reginx/blob/master/trainer/models/xdeepfm.py"},{"title":"wangweitong/recommend_system","url":"https://github.com/wangweitong/recommend_system"},{"title":"wangweitong/DL","url":"https://github.com/wangweitong/DL"},{"title":"YZBM/Tenceng2019_Finals_Rank1st","url":"https://github.com/YZBM/Tenceng2019_Finals_Rank1st"},{"title":"DownyPrio/xDeepFM","url":"https://github.com/DownyPrio/xDeepFM"},{"title":"zhanafengxiaomi/xDeepFM_","url":"https://github.com/zhanafengxiaomi/xDeepFM_"},{"title":"zaf11/xDeepFM-","url":"https://github.com/zaf11/xDeepFM-"}],"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":2}}},{"leaderboard":"/sota/click-through-rate-prediction-on-frappe","slug":"click-through-rate-prediction-on-frappe","dataset":"Frappe","dataset_url":null,"rows_in_archive":5,"metrics":["AUC"],"first_row_in_archive_order":{"model":"TF4CTR","paper_title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","paper_url":"/paper/tf4ctr-twin-focus-framework-for-ctr","paper_date":"2024-05-06","arxiv_id":"2405.03167","code_links":[{"title":"salmon1802/tf4ctr","url":"https://github.com/salmon1802/tf4ctr"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-kdd12","slug":"click-through-rate-prediction-on-kdd12","dataset":"KDD12","dataset_url":"/dataset/kdd12","rows_in_archive":5,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"FCN","paper_title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","paper_url":"/paper/dcnv3-towards-next-generation-deep-cross","paper_date":"2024-07-18","arxiv_id":"2407.13349","code_links":[{"title":"reczoo/FuxiCTR","url":"https://github.com/reczoo/FuxiCTR"},{"title":"salmon1802/DCNv3","url":"https://github.com/salmon1802/DCNv3"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1","slug":"click-through-rate-prediction-on-movielens-1","dataset":"MovieLens","dataset_url":"/dataset/movielens","rows_in_archive":3,"metrics":["AUC"],"first_row_in_archive_order":{"model":"TF4CTR","paper_title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","paper_url":"/paper/tf4ctr-twin-focus-framework-for-ctr","paper_date":"2024-05-06","arxiv_id":"2405.03167","code_links":[{"title":"salmon1802/tf4ctr","url":"https://github.com/salmon1802/tf4ctr"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-avito","slug":"click-through-rate-prediction-on-avito","dataset":"Avito","dataset_url":null,"rows_in_archive":2,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"DSTN-I","paper_title":"Deep Spatio-Temporal Neural Networks for Click-Through Rate Prediction","paper_url":"/paper/deep-spatio-temporal-neural-networks-for","paper_date":"2019-06-10","arxiv_id":"1906.03776","code_links":[{"title":"oywtece/dstn","url":"https://github.com/oywtece/dstn"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-book","slug":"click-through-rate-prediction-on-book","dataset":"Book-Crossing","dataset_url":null,"rows_in_archive":2,"metrics":["AUC","Accuracy","F1"],"first_row_in_archive_order":{"model":"KGCN-sum","paper_title":"Knowledge Graph Convolutional Networks for Recommender Systems","paper_url":"/paper/190412575","paper_date":"2019-03-18","arxiv_id":"1904.12575","code_links":[{"title":"hwwang55/KGCN","url":"https://github.com/hwwang55/KGCN"},{"title":"zzaebok/KGCN-pytorch","url":"https://github.com/zzaebok/KGCN-pytorch"},{"title":"johnnyjana730/MVIN","url":"https://github.com/johnnyjana730/MVIN"},{"title":"KanchiShimono/KGCN","url":"https://github.com/KanchiShimono/KGCN"},{"title":"Ki-Seki/KGCN-pytorch-updated","url":"https://github.com/Ki-Seki/KGCN-pytorch-updated"},{"title":"youngch12/Cluster_KGCN","url":"https://github.com/youngch12/Cluster_KGCN"},{"title":"mostsuperman/KGCN-ML","url":"https://github.com/mostsuperman/KGCN-ML"},{"title":"mostsuperman/test","url":"https://github.com/mostsuperman/test"}],"syntology":{"n":5,"n_ran":1,"n_unverified":4,"n_pointer_only":1}}},{"leaderboard":"/sota/click-through-rate-prediction-on-lastfm","slug":"click-through-rate-prediction-on-lastfm","dataset":"Last.FM","dataset_url":null,"rows_in_archive":2,"metrics":["AUC","Accuracy","F1"],"first_row_in_archive_order":{"model":"KGCN-concat","paper_title":"Knowledge Graph Convolutional Networks for Recommender Systems","paper_url":"/paper/190412575","paper_date":"2019-03-18","arxiv_id":"1904.12575","code_links":[{"title":"hwwang55/KGCN","url":"https://github.com/hwwang55/KGCN"},{"title":"zzaebok/KGCN-pytorch","url":"https://github.com/zzaebok/KGCN-pytorch"},{"title":"johnnyjana730/MVIN","url":"https://github.com/johnnyjana730/MVIN"},{"title":"KanchiShimono/KGCN","url":"https://github.com/KanchiShimono/KGCN"},{"title":"Ki-Seki/KGCN-pytorch-updated","url":"https://github.com/Ki-Seki/KGCN-pytorch-updated"},{"title":"youngch12/Cluster_KGCN","url":"https://github.com/youngch12/Cluster_KGCN"},{"title":"mostsuperman/KGCN-ML","url":"https://github.com/mostsuperman/KGCN-ML"},{"title":"mostsuperman/test","url":"https://github.com/mostsuperman/test"}],"syntology":{"n":5,"n_ran":1,"n_unverified":4,"n_pointer_only":1}}},{"leaderboard":"/sota/click-through-rate-prediction-on-amazon-1","slug":"click-through-rate-prediction-on-amazon-1","dataset":"Amazon Dataset","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"DIEN","paper_title":"Deep Interest Evolution Network for Click-Through Rate Prediction","paper_url":"/paper/deep-interest-evolution-network-for-click","paper_date":"2018-09-11","arxiv_id":"1809.03672","code_links":[{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/rank/dien"},{"title":"shenweichen/DeepCTR-Torch","url":"https://github.com/shenweichen/DeepCTR-Torch"},{"title":"reczoo/FuxiCTR","url":"https://github.com/reczoo/FuxiCTR"},{"title":"mouna99/dien","url":"https://github.com/mouna99/dien"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/research/recommend/DIEN"},{"title":"GitHub-HongweiZhang/prediction-flow","url":"https://github.com/GitHub-HongweiZhang/prediction-flow"},{"title":"StephenBo-China/DIEN-DIN","url":"https://github.com/StephenBo-China/DIEN-DIN"},{"title":"StephenBo-China/recommendation_system_sort_model","url":"https://github.com/StephenBo-China/recommendation_system_sort_model"},{"title":"kupuSs/DIEN-pipline","url":"https://github.com/kupuSs/DIEN-pipline"},{"title":"YafeiWu/DIEN","url":"https://github.com/YafeiWu/DIEN"},{"title":"LionQYW/Dien----Deep-Interest-Evolution-Network-for-Click-Through-Rate-Prediction","url":"https://github.com/LionQYW/Dien----Deep-Interest-Evolution-Network-for-Click-Through-Rate-Prediction"},{"title":"jiean001/models_m","url":"https://github.com/jiean001/models_m/tree/main/DIEN"},{"title":"StephenBo-China/DIEN","url":"https://github.com/StephenBo-China/DIEN"}],"syntology":{"n":14,"n_ran":0,"n_unverified":14,"n_pointer_only":0}}},{"leaderboard":"/sota/click-through-rate-prediction-on-android","slug":"click-through-rate-prediction-on-android","dataset":"Android Malware Dataset","dataset_url":null,"rows_in_archive":1,"metrics":["AUC"],"first_row_in_archive_order":{"model":"NormDNN","paper_title":"Correct Normalization Matters: Understanding the Effect of Normalization On Deep Neural Network Models For Click-Through Rate Prediction","paper_url":"/paper/correct-normalization-matters-understanding","paper_date":"2020-06-23","arxiv_id":"2006.12753","code_links":[{"title":"alibaba/EasyRec","url":"https://github.com/alibaba/EasyRec/blob/master/easy_rec/python/input/criteo_input.py"}],"syntology":null}},{"leaderboard":"/sota/click-through-rate-prediction-on-childrens","slug":"click-through-rate-prediction-on-childrens","dataset":"Children's Book Test Common noun","dataset_url":"/dataset/cbt","rows_in_archive":1,"metrics":["AUC","Accuracy"],"first_row_in_archive_order":{"model":"MKR","paper_title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","paper_url":"/paper/multi-task-feature-learning-for-knowledge","paper_date":"2019-01-23","arxiv_id":"1901.08907","code_links":[{"title":"hwwang55/KGCN","url":"https://github.com/hwwang55/KGCN"},{"title":"hwwang55/MKR","url":"https://github.com/hwwang55/MKR"},{"title":"hsientzucheng/MKR.PyTorch","url":"https://github.com/hsientzucheng/MKR.PyTorch"}],"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}}},{"leaderboard":"/sota/click-through-rate-prediction-on-huawei-app","slug":"click-through-rate-prediction-on-huawei-app","dataset":"Huawei App Store","dataset_url":null,"rows_in_archive":1,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"FGCNN+IPNN","paper_title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","paper_url":"/paper/feature-generation-by-convolutional-neural","paper_date":"2019-04-09","arxiv_id":"1904.04447","code_links":[{"title":"shenweichen/DeepCTR","url":"https://github.com/shenweichen/DeepCTR"},{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/1.8.5/models/rank/fgcnn"},{"title":"shenweichen/DeepCTR-PyTorch","url":"https://github.com/shenweichen/DeepCTR-PyTorch"},{"title":"xue-pai/FuxiCTR","url":"https://github.com/xue-pai/FuxiCTR"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"chenjiyan2001/paddle-FGCNN","url":"https://github.com/chenjiyan2001/paddle-FGCNN"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/cbt","name":"CBT","full_name":"Children’s Book Test","num_papers_in_archive":92},{"url":"/dataset/criteo","name":"Criteo","full_name":"Display Advertising Challenge","num_papers_in_archive":46},{"url":"/dataset/ipinyou","name":"iPinYou","full_name":"iPinYou Global RTB Bidding Algorithm Competition Dataset","num_papers_in_archive":22},{"url":"/dataset/tripclick","name":"TripClick","full_name":"","num_papers_in_archive":16},{"url":"/dataset/kkbox","name":"KKBox","full_name":"","num_papers_in_archive":6},{"url":"/dataset/kdd12","name":"KDD12","full_name":"","num_papers_in_archive":5},{"url":"/dataset/merrec","name":"MerRec","full_name":"MerRec Recommendation Dataset","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":165,"tagged_in_all":391,"items":[{"url":"/paper/wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","repositories_listed":39,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":5}},{"url":"/paper/fibinet-combining-feature-importance-and","title":"FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction","date":"2019-05-23","arxiv_id":"1905.09433","repositories_listed":31,"syntology":{"n":26,"n_ran":2,"n_unverified":24,"n_pointer_only":3}},{"url":"/paper/deepfm-a-factorization-machine-based-neural","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","date":"2017-03-13","arxiv_id":"1703.04247","repositories_listed":23,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":2}},{"url":"/paper/masknet-introducing-feature-wise","title":"MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Mask","date":"2021-02-09","arxiv_id":"2102.07619","repositories_listed":21,"syntology":null},{"url":"/paper/autoint-automatic-feature-interaction","title":"AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks","date":"2018-10-29","arxiv_id":"1810.11921","repositories_listed":19,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/xdeepfm-combining-explicit-and-implicit","title":"xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems","date":"2018-03-14","arxiv_id":"1803.05170","repositories_listed":19,"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":2}},{"url":"/paper/deep-interest-network-for-click-through-rate","title":"Deep Interest Network for Click-Through Rate Prediction","date":"2017-06-21","arxiv_id":"1706.06978","repositories_listed":18,"syntology":null},{"url":"/paper/deep-cross-network-for-ad-click-predictions","title":"Deep & Cross Network for Ad Click Predictions","date":"2017-08-17","arxiv_id":"1708.05123","repositories_listed":16,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","arxiv_id":"1809.03672","repositories_listed":15,"syntology":{"n":14,"n_ran":0,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","repositories_listed":12,"syntology":{"n":14,"n_ran":2,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/fat-deepffm-field-attentive-deep-field-aware","title":"FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine","date":"2019-05-15","arxiv_id":"1905.06336","repositories_listed":12,"syntology":null},{"url":"/paper/modeling-task-relationships-in-multi-task","title":"Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts","date":"2018-07-19","arxiv_id":null,"repositories_listed":11,"syntology":null},{"url":"/paper/product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","date":"2016-11-01","arxiv_id":"1611.00144","repositories_listed":11,"syntology":null},{"url":"/paper/product-based-neural-networks-for-user-1","title":"Product-based Neural Networks for User Response Prediction over Multi-field Categorical Data","date":"2018-07-01","arxiv_id":"1807.00311","repositories_listed":10,"syntology":null},{"url":"/paper/behavior-sequence-transformer-for-e-commerce","title":"Behavior Sequence Transformer for E-commerce Recommendation in Alibaba","date":"2019-05-15","arxiv_id":"1905.06874","repositories_listed":9,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","arxiv_id":"1803.03467","repositories_listed":9,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/real-world-large-scale-recommendation-systems","title":"Real World Large Scale Recommendation Systems Reproducibility and Smooth Activations","date":"2022-02-14","arxiv_id":"2202.06499","repositories_listed":8,"syntology":null},{"url":"/paper/190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","repositories_listed":8,"syntology":{"n":5,"n_ran":1,"n_unverified":4,"n_pointer_only":1}},{"url":"/paper/deepfm-an-end-to-end-wide-deep-learning","title":"DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction","date":"2018-04-12","arxiv_id":"1804.04950","repositories_listed":8,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":2}},{"url":"/paper/progressive-layered-extraction-ple-a-novel","title":"Progressive Layered Extraction (PLE): A Novel Multi-Task Learning (MTL) Model for Personalized Recommendations","date":"2020-02-22","arxiv_id":null,"repositories_listed":7,"syntology":null},{"url":"/paper/flen-leveraging-field-for-scalable-ctr","title":"FLEN: Leveraging Field for Scalable CTR Prediction","date":"2019-11-12","arxiv_id":"1911.04690","repositories_listed":7,"syntology":null},{"url":"/paper/deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":2,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","title":"BARS-CTR: Open Benchmarking for Click-Through Rate Prediction","date":"2020-09-12","arxiv_id":"2009.05794","repositories_listed":6,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/a-dual-input-aware-factorization-machine-for","title":"A Dual Input-aware Factorization Machine for CTR Prediction","date":"2020-07-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","arxiv_id":"2003.11235","repositories_listed":6,"syntology":{"n":24,"n_ran":1,"n_unverified":23,"n_pointer_only":0}},{"url":"/paper/mixed-dimension-embeddings-with-application","title":"Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems","date":"2019-09-25","arxiv_id":"1909.11810","repositories_listed":6,"syntology":{"n":26,"n_ran":2,"n_unverified":24,"n_pointer_only":26}},{"url":"/paper/feature-generation-by-convolutional-neural","title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","date":"2019-04-09","arxiv_id":"1904.04447","repositories_listed":6,"syntology":null},{"url":"/paper/entire-space-multi-task-model-an-effective","title":"Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate","date":"2018-04-21","arxiv_id":"1804.07931","repositories_listed":6,"syntology":null},{"url":"/paper/fibinet-improving-fibinet-by-greatly-reducing","title":"FiBiNet++: Reducing Model Size by Low Rank Feature Interaction Layer for CTR Prediction","date":"2022-09-12","arxiv_id":"2209.05016","repositories_listed":5,"syntology":null},{"url":"/paper/bars-towards-open-benchmarking-for","title":"BARS: Towards Open Benchmarking for Recommender Systems","date":"2022-05-19","arxiv_id":"2205.09626","repositories_listed":5,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":0}}],"syntology_records":17,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}