{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/memorize-factorize-or-be-naive-learning#ran","syntology_url":"https://syntology.ai/paper/2108.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01265"}},"official":{"repos":["fuyuanlyu/OptInter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}}},{"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":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deepfm-a-factorization-machine-based-neural#ran","syntology_url":"https://syntology.ai/paper/1703.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04247"}},"official":{"repos":["xue-pai/FuxiCTR"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"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":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/xdeepfm-combining-explicit-and-implicit#ran","syntology_url":"https://syntology.ai/paper/1803.05170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05170"}},"official":{"repos":["Leavingseason/xDeepFM"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"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":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/xdeepfm-combining-explicit-and-implicit#ran","syntology_url":"https://syntology.ai/paper/1803.05170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05170"}},"official":{"repos":["Leavingseason/xDeepFM"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"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":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}}},{"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":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}}},{"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":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-interest-evolution-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1809.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03672"}},"official":{"repos":["mouna99/dien"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"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":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":4,"rows_per_page":100,"shown":100,"of":391,"of_with_code":165,"tagged_in_all":391,"counts":{"archive_papers_tagged":391,"with_a_code_link":165,"where_syntology_ran_a_sample":25,"not_listed_spam_title":0,"listed":391,"listed_where_code_ran":25,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":25,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":25,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/wide-deep-learning-for-recommender-systems","slug":"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/wide-deep-learning-for-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/1606.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07792"}},"official":null}},{"url":"/paper/fibinet-combining-feature-importance-and","slug":"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":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":14,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/fibinet-combining-feature-importance-and#ran","syntology_url":"https://syntology.ai/paper/1905.09433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09433"}},"official":null}},{"url":"/paper/deepfm-a-factorization-machine-based-neural","slug":"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":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deepfm-a-factorization-machine-based-neural#ran","syntology_url":"https://syntology.ai/paper/1703.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04247"}},"official":{"repos":["xue-pai/FuxiCTR"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/masknet-introducing-feature-wise","slug":"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","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/autoint-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/1810.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11921"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/xdeepfm-combining-explicit-and-implicit","slug":"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":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/xdeepfm-combining-explicit-and-implicit#ran","syntology_url":"https://syntology.ai/paper/1803.05170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05170"}},"official":{"repos":["Leavingseason/xDeepFM"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-interest-network-for-click-through-rate","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-cross-network-for-ad-click-predictions#ran","syntology_url":"https://syntology.ai/paper/1708.05123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.05123"}},"official":null}},{"url":"/paper/deep-interest-evolution-network-for-click","slug":"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":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-interest-evolution-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1809.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03672"}},"official":{"repos":["mouna99/dien"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"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":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}},"official":{"repos":["tensorflow/recommenders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fat-deepffm-field-attentive-deep-field-aware","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/behavior-sequence-transformer-for-e-commerce#ran","syntology_url":"https://syntology.ai/paper/1905.06874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06874"}},"official":null}},{"url":"/paper/ripplenet-propagating-user-preferences-on-the","slug":"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ripplenet-propagating-user-preferences-on-the#ran","syntology_url":"https://syntology.ai/paper/1803.03467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03467"}},"official":{"repos":["hwwang55/RippleNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/real-world-large-scale-recommendation-systems","slug":"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","slug":"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":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deepfm-an-end-to-end-wide-deep-learning","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deepfm-an-end-to-end-wide-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1804.04950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04950"}},"official":null}},{"url":"/paper/progressive-layered-extraction-ple-a-novel","slug":"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","slug":"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","slug":"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":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-session-interest-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1905.06482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06482"}},"official":{"repos":["shenweichen/DSIN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuxictr-an-open-benchmark-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2009.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05794"}},"official":{"repos":["reczoo/BARS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-dual-input-aware-factorization-machine-for","slug":"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","slug":"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":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":1,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/autofis-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/2003.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11235"}},"official":{"repos":["zhuchenxv/AutoFIS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mixed-dimension-embeddings-with-application","slug":"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":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":26,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixed-dimension-embeddings-with-application#ran","syntology_url":"https://syntology.ai/paper/1909.11810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11810"}},"official":{"repos":["facebookresearch/dlrm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/feature-generation-by-convolutional-neural","slug":"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","slug":"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","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bars-towards-open-benchmarking-for#ran","syntology_url":"https://syntology.ai/paper/2205.09626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09626"}},"official":{"repos":["openbenchmark/BARS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gatenet-gating-enhanced-deep-network-for","slug":"gatenet-gating-enhanced-deep-network-for","title":"GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction","date":"2020-07-06","arxiv_id":"2007.03519","repositories_listed":5,"syntology":null},{"url":"/paper/fi-gnn-modeling-feature-interactions-via","slug":"fi-gnn-modeling-feature-interactions-via","title":"Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Prediction","date":"2019-10-12","arxiv_id":"1910.05552","repositories_listed":5,"syntology":null},{"url":"/paper/field-weighted-factorization-machines-for","slug":"field-weighted-factorization-machines-for","title":"Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising","date":"2018-06-09","arxiv_id":"1806.03514","repositories_listed":5,"syntology":null},{"url":"/paper/deep-learning-over-multi-field-categorical","slug":"deep-learning-over-multi-field-categorical","title":"Deep Learning over Multi-field Categorical Data: A Case Study on User Response Prediction","date":"2016-01-11","arxiv_id":"1601.02376","repositories_listed":5,"syntology":null},{"url":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1","slug":"finalmlp-an-enhanced-two-stream-mlp-model-for-1","title":"FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction","date":"2023-04-03","arxiv_id":"2304.00902","repositories_listed":4,"syntology":{"n":16,"n_ran":13,"n_constructed":4,"n_ran_checked":8,"n_instrument":5,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1#ran","syntology_url":"https://syntology.ai/paper/2304.00902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00902"}},"official":{"repos":["reczoo/RecZoo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/contextnet-a-click-through-rate-prediction","slug":"contextnet-a-click-through-rate-prediction","title":"ContextNet: A Click-Through Rate Prediction Framework Using Contextual information to Refine Feature Embedding","date":"2021-07-26","arxiv_id":"2107.12025","repositories_listed":4,"syntology":null},{"url":"/paper/field-embedded-factorization-machines-for","slug":"field-embedded-factorization-machines-for","title":"Field-Embedded Factorization Machines for Click-through rate prediction","date":"2020-09-13","arxiv_id":"2009.09931","repositories_listed":4,"syntology":null},{"url":"/paper/adaptive-factorization-network-learning","slug":"adaptive-factorization-network-learning","title":"Adaptive Factorization Network: Learning Adaptive-Order Feature Interactions","date":"2019-09-07","arxiv_id":"1909.03276","repositories_listed":4,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adaptive-factorization-network-learning#ran","syntology_url":"https://syntology.ai/paper/1909.03276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03276"}},"official":{"repos":["shenweichen/DeepCTR-Torch"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/dkn-deep-knowledge-aware-network-for-news","slug":"dkn-deep-knowledge-aware-network-for-news","title":"DKN: Deep Knowledge-Aware Network for News Recommendation","date":"2018-01-25","arxiv_id":"1801.08284","repositories_listed":4,"syntology":null},{"url":"/paper/multi-granularity-interest-retrieval-and","slug":"multi-granularity-interest-retrieval-and","title":"Multi-granularity Interest Retrieval and Refinement Network for Long-Term User Behavior Modeling in CTR Prediction","date":"2024-11-22","arxiv_id":"2411.15005","repositories_listed":3,"syntology":null},{"url":"/paper/towards-deeper-lighter-and-interpretable-1","slug":"towards-deeper-lighter-and-interpretable-1","title":"Towards Deeper, Lighter and Interpretable Cross Network for CTR Prediction","date":"2023-11-08","arxiv_id":"2311.04635","repositories_listed":3,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"0 ran · 5 unverified","sample_list":"/paper/towards-deeper-lighter-and-interpretable-1#ran","syntology_url":"https://syntology.ai/paper/2311.04635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04635"}},"official":{"repos":["anonctr/GDCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/search-based-user-interest-modeling-with","slug":"search-based-user-interest-modeling-with","title":"Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Prediction","date":"2020-06-10","arxiv_id":"2006.05639","repositories_listed":3,"syntology":null},{"url":"/paper/rocket-launching-a-universal-and-efficient","slug":"rocket-launching-a-universal-and-efficient","title":"Rocket Launching: A Universal and Efficient Framework for Training Well-performing Light Net","date":"2017-08-14","arxiv_id":"1708.04106","repositories_listed":3,"syntology":null},{"url":"/paper/learning-piece-wise-linear-models-from-large","slug":"learning-piece-wise-linear-models-from-large","title":"Learning Piece-wise Linear Models from Large Scale Data for Ad Click Prediction","date":"2017-04-18","arxiv_id":"1704.05194","repositories_listed":3,"syntology":null},{"url":"/paper/field-aware-factorization-machines-for-ctr","slug":"field-aware-factorization-machines-for-ctr","title":"Field-aware factorization machines for CTR prediction","date":"2016-09-07","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/dcnv3-towards-next-generation-deep-cross","slug":"dcnv3-towards-next-generation-deep-cross","title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","date":"2024-07-18","arxiv_id":"2407.13349","repositories_listed":2,"syntology":null},{"url":"/paper/discrete-semantic-tokenization-for-deep-ctr","slug":"discrete-semantic-tokenization-for-deep-ctr","title":"Discrete Semantic Tokenization for Deep CTR Prediction","date":"2024-03-13","arxiv_id":"2403.08206","repositories_listed":2,"syntology":null},{"url":"/paper/co-evolving-vector-quantization-for-id-based","slug":"co-evolving-vector-quantization-for-id-based","title":"Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization","date":"2023-08-31","arxiv_id":"2308.16761","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-interest-network-for-click-through","slug":"temporal-interest-network-for-click-through","title":"Temporal Interest Network for User Response Prediction","date":"2023-08-15","arxiv_id":"2308.08487","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/temporal-interest-network-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2308.08487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08487"}},"official":{"repos":["zhouxy1003/tin"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/eulernet-adaptive-feature-interaction","slug":"eulernet-adaptive-feature-interaction","title":"EulerNet: Adaptive Feature Interaction Learning via Euler's Formula for CTR Prediction","date":"2023-04-21","arxiv_id":"2304.10711","repositories_listed":2,"syntology":null},{"url":"/paper/twin-two-stage-interest-network-for-lifelong","slug":"twin-two-stage-interest-network-for-lifelong","title":"TWIN: TWo-stage Interest Network for Lifelong User Behavior Modeling in CTR Prediction at Kuaishou","date":"2023-02-05","arxiv_id":"2302.02352","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-long-sequential-user-data-modeling","slug":"efficient-long-sequential-user-data-modeling","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","date":"2022-09-25","arxiv_id":"2209.12212","repositories_listed":2,"syntology":null},{"url":"/paper/nasrec-weight-sharing-neural-architecture","slug":"nasrec-weight-sharing-neural-architecture","title":"NASRec: Weight Sharing Neural Architecture Search for Recommender Systems","date":"2022-07-14","arxiv_id":"2207.07187","repositories_listed":2,"syntology":null},{"url":"/paper/hybrid-cnn-based-attention-with-category","slug":"hybrid-cnn-based-attention-with-category","title":"Hybrid CNN Based Attention with Category Prior for User Image Behavior Modeling","date":"2022-05-05","arxiv_id":"2205.02711","repositories_listed":2,"syntology":null},{"url":"/paper/c-2-rec-an-effective-consistency-constraint","slug":"c-2-rec-an-effective-consistency-constraint","title":"CT4Rec: Simple yet Effective Consistency Training for Sequential Recommendation","date":"2021-12-13","arxiv_id":"2112.06668","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-explicit-and-implicit-feature","slug":"enhancing-explicit-and-implicit-feature","title":"Enhancing Explicit and Implicit Feature Interactions via Information Sharing for Parallel Deep CTR Models","date":"2021-10-30","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-optimizers-with-sparse-group-lasso-1","slug":"adaptive-optimizers-with-sparse-group-lasso-1","title":"Adaptive Optimizers with Sparse Group Lasso for Neural Networks in CTR Prediction","date":"2021-07-30","arxiv_id":"2107.14432","repositories_listed":2,"syntology":null},{"url":"/paper/fm-2-field-matrixed-factorization-machines","slug":"fm-2-field-matrixed-factorization-machines","title":"$FM^2$: Field-matrixed Factorization Machines for Recommender Systems","date":"2021-02-20","arxiv_id":"2102.12994","repositories_listed":2,"syntology":null},{"url":"/paper/disentangled-self-attentive-neural-networks","slug":"disentangled-self-attentive-neural-networks","title":"Disentangled Self-Attentive Neural Networks for Click-Through Rate Prediction","date":"2021-01-11","arxiv_id":"2101.03654","repositories_listed":2,"syntology":null},{"url":"/paper/autodis-automatic-discretization-for","slug":"autodis-automatic-discretization-for","title":"An Embedding Learning Framework for Numerical Features in CTR Prediction","date":"2020-12-16","arxiv_id":"2012.08986","repositories_listed":2,"syntology":null},{"url":"/paper/deep-match-to-rank-model-for-personalized","slug":"deep-match-to-rank-model-for-personalized","title":"Deep Match to Rank Model for Personalized Click-Through Rate Prediction","date":"2020-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-sparse-deep-factorization-machine-for","slug":"a-sparse-deep-factorization-machine-for","title":"DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving","date":"2020-02-17","arxiv_id":"2002.06987","repositories_listed":2,"syntology":null},{"url":"/paper/interpretable-click-through-rate-prediction","slug":"interpretable-click-through-rate-prediction","title":"Interpretable Click-Through Rate Prediction through Hierarchical Attention","date":"2020-01-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-feature-interactions-with-lorentzian","slug":"learning-feature-interactions-with-lorentzian","title":"Learning Feature Interactions with Lorentzian Factorization Machine","date":"2019-11-22","arxiv_id":"1911.09821","repositories_listed":2,"syntology":null},{"url":"/paper/practice-on-long-sequential-user-behavior","slug":"practice-on-long-sequential-user-behavior","title":"Practice on Long Sequential User Behavior Modeling for Click-Through Rate Prediction","date":"2019-05-22","arxiv_id":"1905.09248","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/practice-on-long-sequential-user-behavior#ran","syntology_url":"https://syntology.ai/paper/1905.09248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09248"}},"official":{"repos":["UIC-Paper/MIMN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-semantic-model-supported-deep","slug":"structured-semantic-model-supported-deep","title":"Structured Semantic Model supported Deep Neural Network for Click-Through Rate Prediction","date":"2018-12-04","arxiv_id":"1812.01353","repositories_listed":2,"syntology":null},{"url":"/paper/an-ensemble-based-approach-to-click-through","slug":"an-ensemble-based-approach-to-click-through","title":"An Ensemble-based Approach to Click-Through Rate Prediction for Promoted Listings at Etsy","date":"2017-11-04","arxiv_id":"1711.01377","repositories_listed":2,"syntology":null},{"url":"/paper/moe-mlora-for-multi-domain-ctr-prediction","slug":"moe-mlora-for-multi-domain-ctr-prediction","title":"MoE-MLoRA for Multi-Domain CTR Prediction: Efficient Adaptation with Expert Specialization","date":"2025-06-09","arxiv_id":"2506.07563","repositories_listed":1,"syntology":null},{"url":"/paper/dlf-enhancing-explicit-implicit-interaction","slug":"dlf-enhancing-explicit-implicit-interaction","title":"DLF: Enhancing Explicit-Implicit Interaction via Dynamic Low-Order-Aware Fusion for CTR Prediction","date":"2025-05-25","arxiv_id":"2505.19182","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-feature-interactions-from-the","slug":"revisiting-feature-interactions-from-the","title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","date":"2025-05-23","arxiv_id":"2505.17999","repositories_listed":1,"syntology":null},{"url":"/paper/1-st-place-solution-of-www-2025-erel-mir","slug":"1-st-place-solution-of-www-2025-erel-mir","title":"1$^{st}$ Place Solution of WWW 2025 EReL@MIR Workshop Multimodal CTR Prediction Challenge","date":"2025-05-06","arxiv_id":"2505.03543","repositories_listed":1,"syntology":null},{"url":"/paper/feature-staleness-aware-incremental-learning","slug":"feature-staleness-aware-incremental-learning","title":"Feature Staleness Aware Incremental Learning for CTR Prediction","date":"2025-04-29","arxiv_id":"2505.02844","repositories_listed":1,"syntology":null},{"url":"/paper/feature-fusion-revisited-multimodal-ctr","slug":"feature-fusion-revisited-multimodal-ctr","title":"Feature Fusion Revisited: Multimodal CTR Prediction for MMCTR Challenge","date":"2025-04-26","arxiv_id":"2504.18961","repositories_listed":1,"syntology":null},{"url":"/paper/quadratic-interest-network-for-multimodal","slug":"quadratic-interest-network-for-multimodal","title":"Quadratic Interest Network for Multimodal Click-Through Rate Prediction","date":"2025-04-24","arxiv_id":"2504.17699","repositories_listed":1,"syntology":null},{"url":"/paper/scaled-supervision-is-an-implicit-lipschitz","slug":"scaled-supervision-is-an-implicit-lipschitz","title":"Scaled Supervision is an Implicit Lipschitz Regularizer","date":"2025-03-19","arxiv_id":"2503.14813","repositories_listed":1,"syntology":null},{"url":"/paper/a-universal-framework-for-compressing","slug":"a-universal-framework-for-compressing","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","date":"2025-02-21","arxiv_id":"2502.15355","repositories_listed":1,"syntology":null},{"url":"/paper/graphhash-graph-clustering-enables-parameter","slug":"graphhash-graph-clustering-enables-parameter","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","date":"2024-12-23","arxiv_id":"2412.17245","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-learning-via-knowledge-transfer-for","slug":"ensemble-learning-via-knowledge-transfer-for","title":"Ensemble Learning via Knowledge Transfer for CTR Prediction","date":"2024-11-25","arxiv_id":"2411.16122","repositories_listed":1,"syntology":null},{"url":"/paper/fusion-matters-learning-fusion-in-deep-click","slug":"fusion-matters-learning-fusion-in-deep-click","title":"Fusion Matters: Learning Fusion in Deep Click-through Rate Prediction Models","date":"2024-11-24","arxiv_id":"2411.15731","repositories_listed":1,"syntology":null},{"url":"/paper/towards-automated-model-design-on-recommender","slug":"towards-automated-model-design-on-recommender","title":"Towards Automated Model Design on Recommender Systems","date":"2024-11-12","arxiv_id":"2411.07569","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-kan-introducing-karsein-for-adaptive","slug":"beyond-kan-introducing-karsein-for-adaptive","title":"CTR-KAN: KAN for Adaptive High-Order Feature Interaction Modeling","date":"2024-08-16","arxiv_id":"2408.08713","repositories_listed":1,"syntology":null},{"url":"/paper/scene-wise-adaptive-network-for-dynamic-cold","slug":"scene-wise-adaptive-network-for-dynamic-cold","title":"Scene-wise Adaptive Network for Dynamic Cold-start Scenes Optimization in CTR Prediction","date":"2024-08-03","arxiv_id":"2408.07278","repositories_listed":1,"syntology":null},{"url":"/paper/seminar-search-enhanced-multi-modal-interest","slug":"seminar-search-enhanced-multi-modal-interest","title":"SEMINAR: Search Enhanced Multi-modal Interest Network and Approximate Retrieval for Lifelong Sequential Recommendation","date":"2024-07-15","arxiv_id":"2407.10714","repositories_listed":1,"syntology":null},{"url":"/paper/rechorus2-0-a-modular-and-task-flexible","slug":"rechorus2-0-a-modular-and-task-flexible","title":"ReChorus2.0: A Modular and Task-Flexible Recommendation Library","date":"2024-05-28","arxiv_id":"2405.18058","repositories_listed":1,"syntology":null},{"url":"/paper/unified-low-rank-compression-framework-for","slug":"unified-low-rank-compression-framework-for","title":"Unified Low-rank Compression Framework for Click-through Rate Prediction","date":"2024-05-28","arxiv_id":"2405.18146","repositories_listed":1,"syntology":null},{"url":"/paper/cela-cost-efficient-language-model-alignment","slug":"cela-cost-efficient-language-model-alignment","title":"CELA: Cost-Efficient Language Model Alignment for CTR Prediction","date":"2024-05-17","arxiv_id":"2405.10596","repositories_listed":1,"syntology":null},{"url":"/paper/tf4ctr-twin-focus-framework-for-ctr","slug":"tf4ctr-twin-focus-framework-for-ctr","title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","date":"2024-05-06","arxiv_id":"2405.03167","repositories_listed":1,"syntology":null},{"url":"/paper/retrieval-oriented-knowledge-for-click","slug":"retrieval-oriented-knowledge-for-click","title":"Retrieval-Oriented Knowledge for Click-Through Rate Prediction","date":"2024-04-28","arxiv_id":"2404.18304","repositories_listed":1,"syntology":null},{"url":"/paper/rat-retrieval-augmented-transformer-for-click","slug":"rat-retrieval-augmented-transformer-for-click","title":"RAT: Retrieval-Augmented Transformer for Click-Through Rate Prediction","date":"2024-04-02","arxiv_id":"2404.02249","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-the-ranking-loss-for","slug":"understanding-the-ranking-loss-for","title":"Understanding the Ranking Loss for Recommendation with Sparse User Feedback","date":"2024-03-21","arxiv_id":"2403.14144","repositories_listed":1,"syntology":null},{"url":"/paper/helen-optimizing-ctr-prediction-models-with","slug":"helen-optimizing-ctr-prediction-models-with","title":"Helen: Optimizing CTR Prediction Models with Frequency-wise Hessian Eigenvalue Regularization","date":"2024-02-23","arxiv_id":"2403.00798","repositories_listed":1,"syntology":null},{"url":"/paper/merrec-a-large-scale-multipurpose-mercari","slug":"merrec-a-large-scale-multipurpose-mercari","title":"MerRec: A Large-scale Multipurpose Mercari Dataset for Consumer-to-Consumer Recommendation Systems","date":"2024-02-22","arxiv_id":"2402.14230","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-and-counteracting-feature-level","slug":"understanding-and-counteracting-feature-level","title":"Understanding and Counteracting Feature-Level Bias in Click-Through Rate Prediction","date":"2024-02-06","arxiv_id":"2402.03600","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-framework-for-multi-domain-ctr","slug":"a-unified-framework-for-multi-domain-ctr","title":"A Unified Framework for Multi-Domain CTR Prediction via Large Language Models","date":"2023-12-17","arxiv_id":"2312.10743","repositories_listed":1,"syntology":null},{"url":"/paper/cetn-contrast-enhanced-through-network-for","slug":"cetn-contrast-enhanced-through-network-for","title":"CETN: Contrast-enhanced Through Network for CTR Prediction","date":"2023-12-15","arxiv_id":"2312.09715","repositories_listed":1,"syntology":null},{"url":"/paper/ufin-universal-feature-interaction-network","slug":"ufin-universal-feature-interaction-network","title":"UFIN: Universal Feature Interaction Network for Multi-Domain Click-Through Rate Prediction","date":"2023-11-27","arxiv_id":"2311.15493","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-summarization-and-evaluation","slug":"a-comprehensive-summarization-and-evaluation","title":"A Comprehensive Summarization and Evaluation of Feature Refinement Modules for CTR Prediction","date":"2023-11-08","arxiv_id":"2311.04625","repositories_listed":1,"syntology":null},{"url":"/paper/alt-towards-fine-grained-alignment-between","slug":"alt-towards-fine-grained-alignment-between","title":"FLIP: Fine-grained Alignment between ID-based Models and Pretrained Language Models for CTR Prediction","date":"2023-10-30","arxiv_id":"2310.19453","repositories_listed":1,"syntology":null},{"url":"/paper/reform-removing-false-correlation-in-multi","slug":"reform-removing-false-correlation-in-multi","title":"RE-SORT: Removing Spurious Correlation in Multilevel Interaction for CTR Prediction","date":"2023-09-26","arxiv_id":"2309.14891","repositories_listed":1,"syntology":null}],"syntology_records":22,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","since_archive":"/sota/click-through-rate-prediction-on-criteo#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/click-through-rate-prediction-on-avazu","since_archive":"/sota/click-through-rate-prediction-on-avazu#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1m","since_archive":"/sota/click-through-rate-prediction-on-movielens-1m#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/click-through-rate-prediction-on-amazon","since_archive":"/sota/click-through-rate-prediction-on-amazon#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":25,"papers_where_code_ran_first_page":"/task/click-through-rate-prediction/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":4,"url":"/task/click-through-rate-prediction/papers/2","json":"/task/click-through-rate-prediction/papers/2.json","rows":100},{"order":"archive","page":3,"of":4,"url":"/task/click-through-rate-prediction/papers/3","json":"/task/click-through-rate-prediction/papers/3.json","rows":100},{"order":"archive","page":4,"of":4,"url":"/task/click-through-rate-prediction/papers/4","json":"/task/click-through-rate-prediction/papers/4.json","rows":91},{"order":"ran","page":1,"of":1,"url":"/task/click-through-rate-prediction/papers/ran/1","json":"/task/click-through-rate-prediction/papers/ran/1.json","rows":25}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"ede470c5fa09a983ed20c84dcfccc2bd857f2772b667ef2be139d01f9a42c121","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}