{"url":"/sota/collaborative-filtering-on-movielens-1m","task":{"name":"Recommendation Systems","url":"/task/recommendation-systems","note":null},"dataset":{"name":"MovieLens 1M","url":"/dataset/movielens"},"category":"Miscellaneous","categories":["Graphs","Knowledge Base","Miscellaneous"],"category_note":null,"description":"### **Recommendation System in AI Research**  \r\n\r\nA **Recommendation System** is a specialized AI-driven model that analyzes user preferences and behaviors to suggest relevant content, products, or services. It is widely used in domains like e-commerce, streaming platforms, social media, and personalized learning.  \r\n\r\nAI research in recommendation systems focuses on:  \r\n- **Collaborative Filtering**: Predicting user preferences based on similar users' choices.  \r\n- **Content-Based Filtering**: Recommending items based on user history and item characteristics.  \r\n- **Hybrid Models**: Combining multiple techniques for better accuracy.  \r\n- **Deep Learning & Transformers**: Using neural networks and self-attention mechanisms for personalized recommendations.  \r\n- **Graph-Based Approaches**: Leveraging knowledge graphs for relationship-aware recommendations.  \r\n\r\nKey challenges include data sparsity, scalability, and bias mitigation. Cutting-edge research explores reinforcement learning, explainability, and privacy-preserving methods to enhance recommendation systems.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["RMSE","nDCG@10","HR@10","NDCG","Precision","nDCG@100","HR@100","PSP@10","HR@10 (full corpus)","NDCG@10 (full corpus)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"RMSE":"lower","nDCG@10":"higher","HR@10":null,"NDCG":"higher","Precision":"higher","nDCG@100":"higher","HR@100":null,"PSP@10":null,"HR@10 (full corpus)":null,"NDCG@10 (full corpus)":"higher"}},"counts":{"rows":31,"rows_with_code":29,"rows_with_paper_page":31,"rows_dated":31,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GLocal-K","metrics":{"RMSE":"0.8227"},"uses_additional_data":false,"paper_date":"2021-08-27","paper":"/paper/glocal-k-global-and-local-kernels-for","paper_url":"https://arxiv.org/abs/2108.12184v1","paper_title":"GLocal-K: Global and Local Kernels for Recommender Systems","code":"https://github.com/usydnlp/Glocal_K","n_code_links":3,"syntology":null},{"rank_in_archive_order":2,"model":"Sparse FC","metrics":{"RMSE":"0.824"},"uses_additional_data":false,"paper_date":"2018-07-01","paper":"/paper/kernelized-synaptic-weight-matrices","paper_url":"https://icml.cc/Conferences/2018/Schedule?showEvent=2141","paper_title":"Kernelized Synaptic Weight Matrices","code":"https://github.com/lorenzMuller/kernelNet_MovieLens","n_code_links":2,"syntology":null},{"rank_in_archive_order":3,"model":"CF-NADE","metrics":{"RMSE":"0.829"},"uses_additional_data":false,"paper_date":"2016-05-31","paper":"/paper/a-neural-autoregressive-approach-to","paper_url":"http://arxiv.org/abs/1605.09477v1","paper_title":"A Neural Autoregressive Approach to Collaborative Filtering","code":"https://github.com/dsanno/chainer-cf-nade","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"IMC-GAE","metrics":{"RMSE":"0.829"},"uses_additional_data":false,"paper_date":"2021-08-25","paper":"/paper/inductive-matrix-completion-using-graph","paper_url":"https://arxiv.org/abs/2108.11124v1","paper_title":"Inductive Matrix Completion Using Graph Autoencoder","code":"https://github.com/swtheing/imc-gae","n_code_links":2,"syntology":null},{"rank_in_archive_order":5,"model":"I-AutoRec","metrics":{"RMSE":"0.831"},"uses_additional_data":false,"paper_date":"2015-05-18","paper":"/paper/autorec-autoencoders-meet-collaborative","paper_url":"https://scholar.google.com/citations?user=z_hDjNYAAAAJ&hl=en&oi=sra","paper_title":"AutoRec: Autoencoders Meet Collaborative Filtering","code":"https://github.com/gtshs2/Autorec","n_code_links":2,"syntology":null},{"rank_in_archive_order":6,"model":"GC-MC","metrics":{"RMSE":"0.832"},"uses_additional_data":false,"paper_date":"2017-06-07","paper":"/paper/graph-convolutional-matrix-completion","paper_url":"http://arxiv.org/abs/1706.02263v2","paper_title":"Graph Convolutional Matrix Completion","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/_deprecated/gcmc","n_code_links":17,"syntology":null},{"rank_in_archive_order":7,"model":"I-CFN","metrics":{"RMSE":"0.8321"},"uses_additional_data":false,"paper_date":"2016-06-24","paper":"/paper/hybrid-recommender-system-based-on","paper_url":"http://arxiv.org/abs/1606.07659v3","paper_title":"Hybrid Recommender System based on Autoencoders","code":"https://github.com/fstrub95/Autoencoders_cf","n_code_links":4,"syntology":null},{"rank_in_archive_order":8,"model":"GHRS","metrics":{"Precision":"0.792","RMSE":"0.838"},"uses_additional_data":false,"paper_date":"2021-11-06","paper":"/paper/ghrs-graph-based-hybrid-recommendation-system","paper_url":"https://arxiv.org/abs/2111.11293v2","paper_title":"GHRS: Graph-based Hybrid Recommendation System with Application to Movie Recommendation","code":"https://github.com/hadoov/GHRS","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"FedPerGNN","metrics":{"RMSE":"0.839"},"uses_additional_data":false,"paper_date":"2022-06-02","paper":"/paper/a-federated-graph-neural-network-framework","paper_url":"https://www.nature.com/articles/s41467-022-30714-9","paper_title":"A federated graph neural network framework for privacy-preserving personalization","code":"https://github.com/wuch15/fedpergnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"BST","metrics":{"RMSE":"0.8401"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/behavior-sequence-transformer-for-e-commerce","paper_url":"https://arxiv.org/abs/1905.06874v1","paper_title":"Behavior Sequence Transformer for E-commerce Recommendation in Alibaba","code":"https://github.com/shenweichen/DeepCTR","n_code_links":9,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"NNMF","metrics":{"RMSE":"0.843"},"uses_additional_data":false,"paper_date":"2015-11-19","paper":"/paper/neural-network-matrix-factorization","paper_url":"http://arxiv.org/abs/1511.06443v2","paper_title":"Neural Network Matrix Factorization","code":"https://github.com/jstol/neural-net-matrix-factorization","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"FedGNN","metrics":{"RMSE":"0.848"},"uses_additional_data":false,"paper_date":"2021-02-09","paper":"/paper/fedgnn-federated-graph-neural-network-for","paper_url":"https://arxiv.org/abs/2102.04925v2","paper_title":"FedGNN: Federated Graph Neural Network for Privacy-Preserving Recommendation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"IGMC","metrics":{"RMSE":"0.857"},"uses_additional_data":false,"paper_date":"2019-04-26","paper":"/paper/inductive-graph-pattern-learning-for","paper_url":"https://arxiv.org/abs/1904.12058v3","paper_title":"Inductive Matrix Completion Based on Graph Neural Networks","code":"https://github.com/muhanzhang/IGMC","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":14,"model":"U-CFN","metrics":{"RMSE":"0.8574"},"uses_additional_data":false,"paper_date":"2016-06-24","paper":"/paper/hybrid-recommender-system-based-on","paper_url":"http://arxiv.org/abs/1606.07659v3","paper_title":"Hybrid Recommender System based on Autoencoders","code":"https://github.com/fstrub95/Autoencoders_cf","n_code_links":4,"syntology":null},{"rank_in_archive_order":15,"model":"Factorized EAE","metrics":{"RMSE":"0.860"},"uses_additional_data":false,"paper_date":"2018-03-07","paper":"/paper/deep-models-of-interactions-across-sets","paper_url":"http://arxiv.org/abs/1803.02879v2","paper_title":"Deep Models of Interactions Across Sets","code":"https://github.com/mravanba/deep_exchangeable_tensors","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"Factorization with dictionary learning","metrics":{"RMSE":"0.866"},"uses_additional_data":false,"paper_date":"2016-05-03","paper":"/paper/dictionary-learning-for-massive-matrix","paper_url":"http://arxiv.org/abs/1605.00937v2","paper_title":"Dictionary Learning for Massive Matrix Factorization","code":"https://github.com/arthurmensch/modl","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"SSE-PT","metrics":{"HR@10":"0.8389","nDCG@10":"0.6292"},"uses_additional_data":false,"paper_date":"2019-09-25","paper":"/paper/sse-pt-sequential-recommendation-via","paper_url":"https://openreview.net/forum?id=HkeuD34KPH","paper_title":"SSE-PT: Sequential Recommendation Via Personalized Transformer","code":"https://github.com/microsoft/recommenders","n_code_links":2,"syntology":null},{"rank_in_archive_order":18,"model":"SASRec","metrics":{"HR@10":"0.8245","HR@10 (full corpus)":"0.2821","NDCG@10 (full corpus)":"0.1603","nDCG@10":"0.5905"},"uses_additional_data":false,"paper_date":"2018-08-20","paper":"/paper/180809781","paper_url":"http://arxiv.org/abs/1808.09781v1","paper_title":"Self-Attentive Sequential Recommendation","code":"https://github.com/microsoft/recommenders","n_code_links":8,"syntology":{"n_ran":3,"n_unverified":17,"n_samples":20,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"HyperML","metrics":{"HR@10":"0.7563","nDCG@10":"0.5620"},"uses_additional_data":false,"paper_date":"2018-09-05","paper":"/paper/hyperbolic-recommender-systems","paper_url":"https://arxiv.org/abs/1809.01703v3","paper_title":"HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":20,"model":"LRML","metrics":{"HR@10":"0.7397","nDCG@10":"0.5453"},"uses_additional_data":false,"paper_date":"2017-07-17","paper":"/paper/latent-relational-metric-learning-via-memory","paper_url":"http://arxiv.org/abs/1707.05176v3","paper_title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","code":"https://github.com/vanzytay/WWW2018_LRML","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"CML","metrics":{"HR@10":"0.7216","nDCG@10":"0.5413"},"uses_additional_data":false,"paper_date":"2017-04-01","paper":"/paper/collaborative-metric-learning","paper_url":"https://ylongqi.com/publication/www17b/","paper_title":"Collaborative Metric Learning","code":"https://github.com/changun/CollMetric","n_code_links":2,"syntology":null},{"rank_in_archive_order":22,"model":"Ekar*","metrics":{"HR@10":"0.1994","nDCG@10":"0.3699"},"uses_additional_data":false,"paper_date":"2019-06-22","paper":"/paper/explainable-knowledge-graph-based","paper_url":"https://arxiv.org/abs/1906.09506v3","paper_title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","code":"https://github.com/DeepGraphLearning/RecommenderSystems","n_code_links":2,"syntology":null},{"rank_in_archive_order":23,"model":"SVD-AE","metrics":{"HR@10":"0.3179","HR@100":"0.5933","PSP@10":"0.0322","nDCG@10":"0.3355","nDCG@100":"0.4257"},"uses_additional_data":false,"paper_date":"2024-05-08","paper":"/paper/svd-ae-simple-autoencoders-for-collaborative","paper_url":"https://arxiv.org/abs/2405.04746v1","paper_title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","code":"https://github.com/seoyoungh/svd-ae","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":24,"model":"∞-AE","metrics":{"HR@10":"0.3151","HR@100":"0.6005","PSP@10":"0.0322","nDCG@10":"0.3282","nDCG@100":"0.4253"},"uses_additional_data":false,"paper_date":"2022-06-03","paper":"/paper/infinite-recommendation-networks-a-data","paper_url":"https://arxiv.org/abs/2206.02626v3","paper_title":"Infinite Recommendation Networks: A Data-Centric Approach","code":"https://github.com/Guang000/Awesome-Dataset-Distillation","n_code_links":5,"syntology":{"n_ran":6,"n_unverified":7,"n_samples":13,"n_pointer_only_licence":0}},{"rank_in_archive_order":25,"model":"KTUP (soft)","metrics":{"HR@10":"0.8903","NDCG":"0.6992"},"uses_additional_data":false,"paper_date":"2019-02-17","paper":"/paper/unifying-knowledge-graph-learning-and","paper_url":"http://arxiv.org/abs/1902.06236v1","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","code":"https://github.com/TaoMiner/joint-kg-recommender","n_code_links":1,"syntology":null},{"rank_in_archive_order":26,"model":"Context-Aware Pipeline","metrics":{"Precision":"0.731"},"uses_additional_data":false,"paper_date":"2021-12-30","paper":"/paper/context-aware-compilation-of-dnn-training","paper_url":"https://dl.acm.org/doi/abs/10.1145/3494981","paper_title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","code":"https://github.com/dixiyao/Context-Aware-Compilation-of-DNN-Training-Pipelines-across-Edge-and-Cloud","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"SVAE","metrics":{"nDCG@100":"0.2993"},"uses_additional_data":false,"paper_date":"2018-11-25","paper":"/paper/sequential-variational-autoencoders-for","paper_url":"http://arxiv.org/abs/1811.09975v1","paper_title":"Sequential Variational Autoencoders for Collaborative Filtering","code":"https://github.com/noveens/svae_cf","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"HSTU+MoL","metrics":{"HR@10 (full corpus)":".3412","NDCG@10 (full corpus)":".1979"},"uses_additional_data":false,"paper_date":"2024-07-22","paper":"/paper/efficient-retrieval-with-learned-similarities","paper_url":"https://arxiv.org/abs/2407.15462v4","paper_title":"Retrieval with Learned Similarities","code":"https://github.com/bailuding/rails","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"HSTU","metrics":{"HR@10 (full corpus)":"0.3294","NDCG@10 (full corpus)":"0.1893"},"uses_additional_data":false,"paper_date":"2024-02-27","paper":"/paper/actions-speak-louder-than-words-trillion","paper_url":"https://arxiv.org/abs/2402.17152v3","paper_title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","code":"https://github.com/facebookresearch/generative-recommenders","n_code_links":12,"syntology":{"n_ran":14,"n_unverified":28,"n_samples":42,"n_pointer_only_licence":3}},{"rank_in_archive_order":30,"model":"BERT4Rec","metrics":{"HR@10 (full corpus)":"0.2843","NDCG@10 (full corpus)":"0.1537"},"uses_additional_data":false,"paper_date":"2019-04-14","paper":"/paper/bert4rec-sequential-recommendation-with","paper_url":"https://arxiv.org/abs/1904.06690v2","paper_title":"BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer","code":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/rank/bert4rec","n_code_links":8,"syntology":{"n_ran":2,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":1}},{"rank_in_archive_order":31,"model":"GRU4Rec","metrics":{"HR@10 (full corpus)":"0.2811","NDCG@10 (full corpus)":"0.1648"},"uses_additional_data":false,"paper_date":"2015-11-21","paper":"/paper/session-based-recommendations-with-recurrent","paper_url":"http://arxiv.org/abs/1511.06939v4","paper_title":"Session-based Recommendations with Recurrent Neural Networks","code":"https://github.com/microsoft/recommenders","n_code_links":25,"syntology":{"n_ran":2,"n_unverified":13,"n_samples":15,"n_pointer_only_licence":4}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":7,"distinct_papers_with_graph_line":9,"distinct_papers_with_any_sample_ran":7,"samples_over_distinct_papers":{"n_ran":31,"n_unverified":75,"n_samples":106,"n_pointer_only_licence":10,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":31,"n_unverified":75,"n_samples":106,"n_pointer_only_licence":10,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}