{"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":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","description_markdown":"The **MovieLens** datasets, first released in 1998, describe people’s expressed preferences for movies. These preferences take the form of tuples, each the result of a person expressing a preference (a 0-5 star rating) for a movie at a particular time. These preferences were entered by way of the MovieLens web site1 — a recommender system that asks its users to give movie ratings in order to receive personalized movie recommendations.\r\n\r\nSource: [The MovieLens Datasets: History and Context](http://files.grouplens.org/papers/harper-tiis2015.pdf)\r\nImage Source: [http://files.grouplens.org/papers/harper-tiis2015.pdf](http://files.grouplens.org/papers/harper-tiis2015.pdf)","description_withheld":null,"homepage":"https://grouplens.org/datasets/movielens/","introduced_date":"2016-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"The MovieLens Datasets: History and Context","first_author":null,"url":"https://doi.org/10.1145/2827872"},"license":{"name":"Custom","url":"https://grouplens.org/datasets/movielens/"},"modalities":[{"name":"Tabular","url":"/datasets/modality/tabular"}],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Recommendation Systems","url":"/task/recommendation-systems","datasets_with_task":"/datasets/task/recommendation-systems"},{"name":"Knowledge Graph Completion","url":"/task/knowledge-graph-completion","datasets_with_task":"/datasets/task/knowledge-graph-completion"},{"name":"Click-Through Rate Prediction","url":"/task/click-through-rate-prediction","datasets_with_task":"/datasets/task/click-through-rate-prediction"},{"name":"Sequential Recommendation","url":"/task/sequential-recommendation","datasets_with_task":"/datasets/task/sequential-recommendation"},{"name":"Collaborative Filtering","url":"/task/collaborative-filtering","datasets_with_task":"/datasets/task/collaborative-filtering"},{"name":"Multi-Media Recommendation","url":"/task/multi-media-recommendation","datasets_with_task":"/datasets/task/multi-media-recommendation"},{"name":"Multibehavior Recommendation","url":"/task/multibehavior-recommendation","datasets_with_task":"/datasets/task/multibehavior-recommendation"},{"name":"Explainable Recommendation","url":"/task/explainable-recommendation","datasets_with_task":"/datasets/task/explainable-recommendation"},{"name":"Recommendation Systems (Item cold-start)","url":"/task/recommendation-systems-item-cold-start","datasets_with_task":"/datasets/task/recommendation-systems-item-cold-start"},{"name":"Movie Recommendation","url":"/task/movie-recommendation","datasets_with_task":"/datasets/task/movie-recommendation"}],"languages":[{"name":"English","url":"/datasets/language/english"},{"name":"Spanish","url":"/datasets/language/spanish"}],"variants":["MovieLens","MovieLens 100K","MovieLens 1M","MovieLens 10M","MovieLens 20M","MovieLens-Latest","MovieLens 25M"],"data_loaders":[{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/movielens","frameworks":["tf","jax"]}],"num_papers_in_archive":1246,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset_variant":"MovieLens 1M","rows":31,"metrics":["RMSE","nDCG@10","HR@10","NDCG","Precision","nDCG@100","HR@100","PSP@10","HR@10 (full corpus)","NDCG@10 (full corpus)"],"first_row_in_archive_order":{"model":"GLocal-K","paper":"/paper/glocal-k-global-and-local-kernels-for","metrics":{"RMSE":"0.8227"},"code_links":[{"title":"usydnlp/Glocal_K","url":"https://github.com/usydnlp/Glocal_K"},{"title":"fleanend/TorchGlocalK","url":"https://github.com/fleanend/TorchGlocalK"},{"title":"fleanend/NeuralRecommender","url":"https://github.com/fleanend/NeuralRecommender"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","task":"Recommendation Systems","dataset_variant":"MovieLens 100K","rows":18,"metrics":["RMSE (u1 Splits)","RMSE (Random 90/10 Splits)","RMSE"],"first_row_in_archive_order":{"model":"CDLD-GR (doi: 10.5281/zenodo.15851754)","paper":null,"metrics":{"RMSE (u1 Splits)":"0.884"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-movielens-20m","task":"Recommendation Systems","dataset_variant":"MovieLens 20M","rows":18,"metrics":["nDCG@10","Recall@10","Recall@20","Recall@50","nDCG@100","Recall@100","HR@10","HR@10 (full corpus)","nDCG@10 (full corpus)","Recall@2"],"first_row_in_archive_order":{"model":"HyperML","paper":"/paper/hyperbolic-recommender-systems","metrics":{"HR@10":"0.8736","nDCG@10":"0.6404"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","task":"Recommendation Systems","dataset_variant":"MovieLens 10M","rows":17,"metrics":["RMSE","MAP@15","MAP@30","MAP@5","NDCG@15","NDCG@30","NDCG@5","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"Bayesian timeSVD++ flipped","paper":"/paper/on-the-difficulty-of-evaluating-baselines-a","metrics":{"RMSE":"0.7485"},"code_links":[{"title":"srendle/libfm","url":"https://github.com/srendle/libfm"},{"title":"tohtsky/myFM","url":"https://github.com/tohtsky/myFM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-movielens-25m","task":"Link Prediction","dataset_variant":"MovieLens 25M","rows":7,"metrics":["nDCG@10","Hits@10"],"first_row_in_archive_order":{"model":"PEAGAT","paper":"/paper/metapath-and-entity-aware-graph-neural","metrics":{"Hits@10":"0.8284","nDCG@10":"0.5475"},"code_links":[{"title":"ecml-peagnn/PEAGNN","url":"https://github.com/ecml-peagnn/PEAGNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens","task":"Click-Through Rate Prediction","dataset_variant":"MovieLens 20M","rows":6,"metrics":["AUC"],"first_row_in_archive_order":{"model":"github.com/guotong1988/movielens_dataset","paper":null,"metrics":{"AUC":"0.79"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1m","task":"Click-Through Rate Prediction","dataset_variant":"MovieLens 1M","rows":6,"metrics":["AUC","Accuracy","Log Loss"],"first_row_in_archive_order":{"model":"STEC","paper":"/paper/stec-see-through-transformer-based-encoder","metrics":{"AUC":"0.9712","Log Loss":"0.2016"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/movie-recommendation-on-movielens-1m","task":"Movie Recommendation","dataset_variant":"MovieLens 1M","rows":5,"metrics":["NDCG","RMSE"],"first_row_in_archive_order":{"model":"BPR","paper":"/paper/post-processing-recommender-systems-with","metrics":{"NDCG":"0.33"},"code_links":[{"title":"giacoballoccu/explanation-quality-recsys","url":"https://github.com/giacoballoccu/explanation-quality-recsys"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m-1","task":"Collaborative Filtering","dataset_variant":"MovieLens 1M","rows":4,"metrics":["NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"SimpleX","paper":"/paper/simplex-a-simple-and-strong-baseline-for","metrics":{"NDCG@20":"0.2670"},"code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/cf/SimpleX"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/multibehavior-recommendation-on-movielens","task":"Multibehavior Recommendation","dataset_variant":"MovieLens","rows":4,"metrics":["HR@10"],"first_row_in_archive_order":{"model":"HMAR","paper":"/paper/hmar-hierarchical-masked-attention-for-multi","metrics":{"HR@10":"0.9412"},"code_links":[{"title":"shereen-elsayed/hmar","url":"https://github.com/shereen-elsayed/hmar"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/sequential-recommendation-on-movielens-1m","task":"Sequential Recommendation","dataset_variant":"MovieLens 1M","rows":4,"metrics":["HR@5","HR@10","HR@20","NDCG@5","NDCG@10","NDCG@20","HR@5 (99 Neg. Samples)","HR@10 (99 Neg. Samples)","NDCG@5 (99 Neg. Samples)","NDCG@10 (99 Neg. Samples)","MRR (99 Neg. Samples)","HR@50","MRR@10","MRR@20","MRR@50","NDCG@50"],"first_row_in_archive_order":{"model":"TiM4Rec","paper":"/paper/tim4rec-an-efficient-sequential","metrics":{"HR@10":"0.331","HR@20":"0.4338","HR@5":"0.2308","HR@50":"0.577","MRR@10":"0.1512","MRR@20":"0.1584","MRR@50":"0.1629","NDCG@10":"0.1932","NDCG@20":"0.2194","NDCG@5":"0.1608","NDCG@50":"0.2477"},"code_links":[{"title":"alwaysfhao/tim4rec","url":"https://github.com/alwaysfhao/tim4rec"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1","task":"Click-Through Rate Prediction","dataset_variant":"MovieLens","rows":3,"metrics":["AUC"],"first_row_in_archive_order":{"model":"TF4CTR","paper":"/paper/tf4ctr-twin-focus-framework-for-ctr","metrics":{"AUC":"0.9746"},"code_links":[{"title":"salmon1802/tf4ctr","url":"https://github.com/salmon1802/tf4ctr"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-movielens-1m","task":"Link Prediction","dataset_variant":"MovieLens 1M","rows":2,"metrics":["AUPR","AUC"],"first_row_in_archive_order":{"model":"Hyper-SAGNN-W","paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","metrics":{"AUC":"0.93","AUPR":"0.81"},"code_links":[{"title":"ma-compbio/Hyper-SAGNN","url":"https://github.com/ma-compbio/Hyper-SAGNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-completion-on-movielens-1m","task":"Knowledge Graph Completion","dataset_variant":"MovieLens 1M","rows":1,"metrics":["Hits@10","Mean Rank"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper":"/paper/unifying-knowledge-graph-learning-and","metrics":{"Hits@10":"48.9","Mean Rank":"527"},"code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/multi-media-recommendation-on-movielens","task":"Multi-Media Recommendation","dataset_variant":"MovieLens","rows":1,"metrics":["Recall@10","nDCG@10"],"first_row_in_archive_order":{"model":"LightGT","paper":"/paper/lightgt-a-light-graph-transformer-for","metrics":{"Recall@10":"0.2650","nDCG@10":"0.1771"},"code_links":[{"title":"Liuwq-bit/LightGT","url":"https://github.com/Liuwq-bit/LightGT"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/multi-media-recommendation-on-movielens-10m","task":"Multi-Media Recommendation","dataset_variant":"MovieLens 10M","rows":1,"metrics":["NDCG","Precision","Recall"],"first_row_in_archive_order":{"model":"MMGCN","paper":"/paper/mmgcn-multi-modal-graph-convolution-network","metrics":{"NDCG":"0.3062","Precision":"0.1215","Recall":"0.5138"},"code_links":[{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/recommendation-systems-on-movielens-latest","task":"Recommendation Systems","dataset_variant":"MovieLens-Latest","rows":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RATE-CSE","paper":"/paper/collaborative-similarity-embedding-for","metrics":{"Recall@10":"0.3225","mAP@10":"0.199"},"code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":84,"of":84,"counts":{"papers_with_a_benchmark_row":84,"with_a_code_link":81,"where_syntology_ran_a_sample":29,"not_listed_spam_title":0,"listed":84,"listed_where_code_ran":29,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":29,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":29,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/ss4rec-continuous-time-sequential","slug":"ss4rec-continuous-time-sequential","title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","date":"2025-02-12","arxiv_id":"2502.08132","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-behavioral-sequential-recommendation","slug":"multi-behavioral-sequential-recommendation","title":"Multi-Behavioral Sequential Recommendation","date":"2024-10-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/tim4rec-an-efficient-sequential","slug":"tim4rec-an-efficient-sequential","title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","date":"2024-09-24","arxiv_id":"2409.16182","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/efficient-retrieval-with-learned-similarities","slug":"efficient-retrieval-with-learned-similarities","title":"Retrieval with Learned Similarities","date":"2024-07-22","arxiv_id":"2407.15462","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hmar-hierarchical-masked-attention-for-multi","slug":"hmar-hierarchical-masked-attention-for-multi","title":"HMAR: Hierarchical Masked Attention for Multi-Behaviour Recommendation","date":"2024-04-29","arxiv_id":"2405.09638","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/actions-speak-louder-than-words-trillion","slug":"actions-speak-louder-than-words-trillion","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","date":"2024-02-27","arxiv_id":"2402.17152","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":42,"samples_ran":15,"samples_constructed":13,"samples_ran_checked":14,"samples_ran_instrument_failed":1,"samples_unverified":27,"pointer_only_for_licence":3,"official":{"repos":["facebookresearch/generative-recommenders"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/actions-speak-louder-than-words-trillion#ran","syntology_url":"https://syntology.ai/paper/2402.17152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17152"}}}},{"paper":"/paper/an-attentive-inductive-bias-for-sequential","slug":"an-attentive-inductive-bias-for-sequential","title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","date":"2023-12-16","arxiv_id":"2312.10325","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}}}},{"paper":"/paper/stec-see-through-transformer-based-encoder","slug":"stec-see-through-transformer-based-encoder","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","date":"2023-08-29","arxiv_id":"2308.15033","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/weighted-multi-level-feature-factorization","slug":"weighted-multi-level-feature-factorization","title":"Weighted Multi-Level Feature Factorization for App ads CTR and installation prediction","date":"2023-08-03","arxiv_id":"2308.02568","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lightgt-a-light-graph-transformer-for","slug":"lightgt-a-light-graph-transformer-for","title":"LightGT: A Light Graph Transformer for Multimedia Recommendation","date":"2023-07-18","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}}}},{"paper":"/paper/a-federated-graph-neural-network-framework","slug":"a-federated-graph-neural-network-framework","title":"A federated graph neural network framework for privacy-preserving personalization","date":"2022-06-02","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/post-processing-recommender-systems-with","slug":"post-processing-recommender-systems-with","title":"Post Processing Recommender Systems with Knowledge Graphs for Recency, Popularity, and Diversity of Explanations","date":"2022-04-24","arxiv_id":"2204.11241","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/context-aware-compilation-of-dnn-training","slug":"context-aware-compilation-of-dnn-training","title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","date":"2021-12-30","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ghrs-graph-based-hybrid-recommendation-system","slug":"ghrs-graph-based-hybrid-recommendation-system","title":"GHRS: Graph-based Hybrid Recommendation System with Application to Movie Recommendation","date":"2021-11-06","arxiv_id":"2111.11293","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/glocal-k-global-and-local-kernels-for","slug":"glocal-k-global-and-local-kernels-for","title":"GLocal-K: Global and Local Kernels for Recommender Systems","date":"2021-08-27","arxiv_id":"2108.12184","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/inductive-matrix-completion-using-graph","slug":"inductive-matrix-completion-using-graph","title":"Inductive Matrix Completion Using Graph Autoencoder","date":"2021-08-25","arxiv_id":"2108.11124","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/deep-variational-autoencoder-with-shallow","slug":"deep-variational-autoencoder-with-shallow","title":"Deep Variational Autoencoder with Shallow Parallel Path for Top-N Recommendation (VASP)","date":"2021-02-10","arxiv_id":"2102.05774","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fedgnn-federated-graph-neural-network-for","slug":"fedgnn-federated-graph-neural-network-for","title":"FedGNN: Federated Graph Neural Network for Privacy-Preserving Recommendation","date":"2021-02-09","arxiv_id":"2102.04925","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/scalable-representation-learning-and","slug":"scalable-representation-learning-and","title":"Lightweight representation learning for efficient and scalable recommendation","date":"2021-01-04","arxiv_id":"2101.00870","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/exploring-the-multimodal-information-from","slug":"exploring-the-multimodal-information-from","title":"The complementarity of a diverse range of deep learning features extracted from video content for video recommendation","date":"2020-11-21","arxiv_id":"2011.10834","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/metapath-and-entity-aware-graph-neural","slug":"metapath-and-entity-aware-graph-neural","title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","date":"2020-10-22","arxiv_id":"2010.11793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/interpretable-recommender-system-with","slug":"interpretable-recommender-system-with","title":"Interpretable Recommender System With Heterogeneous Information: A Geometric Deep Learning Perspective","date":"2020-09-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/disentangled-graph-collaborative-filtering","slug":"disentangled-graph-collaborative-filtering","title":"Disentangled Graph Collaborative Filtering","date":"2020-07-03","arxiv_id":"2007.01764","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":6,"official":{"repos":["xiangwang1223/disentangled_graph_collaborative_filtering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/disentangled-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2007.01764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01764"}}}},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","rows_on_this_dataset":1,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"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":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}}}},{"paper":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}}}},{"paper":"/paper/multi-gradient-descent-for-multi-objective","slug":"multi-gradient-descent-for-multi-objective","title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","date":"2019-12-09","arxiv_id":"2001.00846","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}}}},{"paper":"/paper/enhancing-vaes-for-collaborative-filtering","slug":"enhancing-vaes-for-collaborative-filtering","title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","date":"2019-11-03","arxiv_id":"1911.00936","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mmgcn-multi-modal-graph-convolution-network","slug":"mmgcn-multi-modal-graph-convolution-network","title":"MMGCN: Multi-modal Graph Convolution Network for Personalized Recommendation of Micro-video","date":"2019-10-19","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sse-pt-sequential-recommendation-via","slug":"sse-pt-sequential-recommendation-via","title":"SSE-PT: Sequential Recommendation Via Personalized Transformer","date":"2019-09-25","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/attribute-aware-non-linear-co-embeddings-of","slug":"attribute-aware-non-linear-co-embeddings-of","title":"Attribute-aware non-linear co-embeddings of graph features","date":"2019-09-16","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/scalable-probabilistic-matrix-factorization","slug":"scalable-probabilistic-matrix-factorization","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","date":"2019-08-25","arxiv_id":"1908.09393","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-end-to-end-neighborhood-based-interaction","slug":"an-end-to-end-neighborhood-based-interaction","title":"An End-to-End Neighborhood-based Interaction Model for Knowledge-enhanced Recommendation","date":"2019-08-12","arxiv_id":"1908.04032","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/explainable-knowledge-graph-based","slug":"explainable-knowledge-graph-based","title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","date":"2019-06-22","arxiv_id":"1906.09506","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/hierarchical-gating-networks-for-sequential","slug":"hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","arxiv_id":"1906.09217","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}}}},{"paper":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":7,"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}}}},{"paper":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":6,"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}}}},{"paper":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}}}},{"paper":"/paper/on-the-difficulty-of-evaluating-baselines-a","slug":"on-the-difficulty-of-evaluating-baselines-a","title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","date":"2019-05-04","arxiv_id":"1905.01395","rows_on_this_dataset":5,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}}}},{"paper":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["muhanzhang/IGMC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}}}},{"paper":"/paper/bert4rec-sequential-recommendation-with","slug":"bert4rec-sequential-recommendation-with","title":"BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer","date":"2019-04-14","arxiv_id":"1904.06690","rows_on_this_dataset":2,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["FeiSun/BERT4Rec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert4rec-sequential-recommendation-with#ran","syntology_url":"https://syntology.ai/paper/1904.06690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06690"}}}},{"paper":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}}}},{"paper":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/unifying-knowledge-graph-learning-and","slug":"unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","date":"2019-02-17","arxiv_id":"1902.06236","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sequential-variational-autoencoders-for","slug":"sequential-variational-autoencoders-for","title":"Sequential Variational Autoencoders for Collaborative Filtering","date":"2018-11-25","arxiv_id":"1811.09975","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/hyperbolic-recommender-systems","slug":"hyperbolic-recommender-systems","title":"HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems","date":"2018-09-05","arxiv_id":"1809.01703","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/180809781","slug":"180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","arxiv_id":"1808.09781","rows_on_this_dataset":3,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":8,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/180809781#ran","syntology_url":"https://syntology.ai/paper/1808.09781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09781"}}}},{"paper":"/paper/kernelized-synaptic-weight-matrices","slug":"kernelized-synaptic-weight-matrices","title":"Kernelized Synaptic Weight Matrices","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/180503352","slug":"180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","date":"2018-05-09","arxiv_id":"1805.03352","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/deep-models-of-interactions-across-sets","slug":"deep-models-of-interactions-across-sets","title":"Deep Models of Interactions Across Sets","date":"2018-03-07","arxiv_id":"1803.02879","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":1,"official":{"repos":["dawenl/vae_cf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}}}},{"paper":"/paper/mixture-rank-matrix-approximation-for","slug":"mixture-rank-matrix-approximation-for","title":"Mixture-Rank Matrix Approximation for Collaborative Filtering","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-factorization-machines-for-sparse","slug":"neural-factorization-machines-for-sparse","title":"Neural Factorization Machines for Sparse Predictive Analytics","date":"2017-08-16","arxiv_id":"1708.05027","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/latent-relational-metric-learning-via-memory","slug":"latent-relational-metric-learning-via-memory","title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","date":"2017-07-17","arxiv_id":"1707.05176","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":18,"syntology":null},{"paper":"/paper/graph-convolutional-matrix-completion","slug":"graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","rows_on_this_dataset":4,"code_links":17,"syntology":null},{"paper":"/paper/geometric-matrix-completion-with-recurrent","slug":"geometric-matrix-completion-with-recurrent","title":"Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks","date":"2017-04-22","arxiv_id":"1704.06803","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":23,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":11,"syntology":null},{"paper":"/paper/hybrid-recommender-system-based-on","slug":"hybrid-recommender-system-based-on","title":"Hybrid Recommender System based on Autoencoders","date":"2016-06-24","arxiv_id":"1606.07659","rows_on_this_dataset":4,"code_links":4,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":39,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/a-neural-autoregressive-approach-to","slug":"a-neural-autoregressive-approach-to","title":"A Neural Autoregressive Approach to Collaborative Filtering","date":"2016-05-31","arxiv_id":"1605.09477","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-neural-autoregressive-approach-to#ran","syntology_url":"https://syntology.ai/paper/1605.09477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09477"}}}},{"paper":"/paper/dictionary-learning-for-massive-matrix","slug":"dictionary-learning-for-massive-matrix","title":"Dictionary Learning for Massive Matrix Factorization","date":"2016-05-03","arxiv_id":"1605.00937","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/collaborative-filtering-with-graph","slug":"collaborative-filtering-with-graph","title":"Collaborative Filtering with Graph Information: Consistency and Scalable Methods","date":"2015-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/session-based-recommendations-with-recurrent","slug":"session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","arxiv_id":"1511.06939","rows_on_this_dataset":2,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/session-based-recommendations-with-recurrent#ran","syntology_url":"https://syntology.ai/paper/1511.06939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06939"}}}},{"paper":"/paper/neural-network-matrix-factorization","slug":"neural-network-matrix-factorization","title":"Neural Network Matrix Factorization","date":"2015-11-19","arxiv_id":"1511.06443","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/autorec-autoencoders-meet-collaborative","slug":"autorec-autoencoders-meet-collaborative","title":"AutoRec: Autoencoders Meet Collaborative Filtering","date":"2015-05-18","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/matrix-completion-on-graphs","slug":"matrix-completion-on-graphs","title":"Matrix Completion on Graphs","date":"2014-08-07","arxiv_id":"1408.1717","rows_on_this_dataset":1,"code_links":2,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/ss4rec-continuous-time-sequential","slug":"ss4rec-continuous-time-sequential","title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","date":"2025-02-12","arxiv_id":"2502.08132","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-behavioral-sequential-recommendation","slug":"multi-behavioral-sequential-recommendation","title":"Multi-Behavioral Sequential Recommendation","date":"2024-10-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/tim4rec-an-efficient-sequential","slug":"tim4rec-an-efficient-sequential","title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","date":"2024-09-24","arxiv_id":"2409.16182","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/efficient-retrieval-with-learned-similarities","slug":"efficient-retrieval-with-learned-similarities","title":"Retrieval with Learned Similarities","date":"2024-07-22","arxiv_id":"2407.15462","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hmar-hierarchical-masked-attention-for-multi","slug":"hmar-hierarchical-masked-attention-for-multi","title":"HMAR: Hierarchical Masked Attention for Multi-Behaviour Recommendation","date":"2024-04-29","arxiv_id":"2405.09638","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/actions-speak-louder-than-words-trillion","slug":"actions-speak-louder-than-words-trillion","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","date":"2024-02-27","arxiv_id":"2402.17152","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":42,"samples_ran":15,"samples_constructed":13,"samples_ran_checked":14,"samples_ran_instrument_failed":1,"samples_unverified":27,"pointer_only_for_licence":3,"official":{"repos":["facebookresearch/generative-recommenders"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/actions-speak-louder-than-words-trillion#ran","syntology_url":"https://syntology.ai/paper/2402.17152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17152"}}}},{"paper":"/paper/an-attentive-inductive-bias-for-sequential","slug":"an-attentive-inductive-bias-for-sequential","title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","date":"2023-12-16","arxiv_id":"2312.10325","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}}}},{"paper":"/paper/stec-see-through-transformer-based-encoder","slug":"stec-see-through-transformer-based-encoder","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","date":"2023-08-29","arxiv_id":"2308.15033","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/weighted-multi-level-feature-factorization","slug":"weighted-multi-level-feature-factorization","title":"Weighted Multi-Level Feature Factorization for App ads CTR and installation prediction","date":"2023-08-03","arxiv_id":"2308.02568","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lightgt-a-light-graph-transformer-for","slug":"lightgt-a-light-graph-transformer-for","title":"LightGT: A Light Graph Transformer for Multimedia Recommendation","date":"2023-07-18","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}}}},{"paper":"/paper/a-federated-graph-neural-network-framework","slug":"a-federated-graph-neural-network-framework","title":"A federated graph neural network framework for privacy-preserving personalization","date":"2022-06-02","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/post-processing-recommender-systems-with","slug":"post-processing-recommender-systems-with","title":"Post Processing Recommender Systems with Knowledge Graphs for Recency, Popularity, and Diversity of Explanations","date":"2022-04-24","arxiv_id":"2204.11241","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/context-aware-compilation-of-dnn-training","slug":"context-aware-compilation-of-dnn-training","title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","date":"2021-12-30","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ghrs-graph-based-hybrid-recommendation-system","slug":"ghrs-graph-based-hybrid-recommendation-system","title":"GHRS: Graph-based Hybrid Recommendation System with Application to Movie Recommendation","date":"2021-11-06","arxiv_id":"2111.11293","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/glocal-k-global-and-local-kernels-for","slug":"glocal-k-global-and-local-kernels-for","title":"GLocal-K: Global and Local Kernels for Recommender Systems","date":"2021-08-27","arxiv_id":"2108.12184","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/inductive-matrix-completion-using-graph","slug":"inductive-matrix-completion-using-graph","title":"Inductive Matrix Completion Using Graph Autoencoder","date":"2021-08-25","arxiv_id":"2108.11124","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/deep-variational-autoencoder-with-shallow","slug":"deep-variational-autoencoder-with-shallow","title":"Deep Variational Autoencoder with Shallow Parallel Path for Top-N Recommendation (VASP)","date":"2021-02-10","arxiv_id":"2102.05774","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fedgnn-federated-graph-neural-network-for","slug":"fedgnn-federated-graph-neural-network-for","title":"FedGNN: Federated Graph Neural Network for Privacy-Preserving Recommendation","date":"2021-02-09","arxiv_id":"2102.04925","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/scalable-representation-learning-and","slug":"scalable-representation-learning-and","title":"Lightweight representation learning for efficient and scalable recommendation","date":"2021-01-04","arxiv_id":"2101.00870","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/exploring-the-multimodal-information-from","slug":"exploring-the-multimodal-information-from","title":"The complementarity of a diverse range of deep learning features extracted from video content for video recommendation","date":"2020-11-21","arxiv_id":"2011.10834","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/metapath-and-entity-aware-graph-neural","slug":"metapath-and-entity-aware-graph-neural","title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","date":"2020-10-22","arxiv_id":"2010.11793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/interpretable-recommender-system-with","slug":"interpretable-recommender-system-with","title":"Interpretable Recommender System With Heterogeneous Information: A Geometric Deep Learning Perspective","date":"2020-09-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/disentangled-graph-collaborative-filtering","slug":"disentangled-graph-collaborative-filtering","title":"Disentangled Graph Collaborative Filtering","date":"2020-07-03","arxiv_id":"2007.01764","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":6,"official":{"repos":["xiangwang1223/disentangled_graph_collaborative_filtering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/disentangled-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2007.01764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01764"}}}},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","rows_on_this_dataset":1,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"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":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}}}},{"paper":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}}}},{"paper":"/paper/multi-gradient-descent-for-multi-objective","slug":"multi-gradient-descent-for-multi-objective","title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","date":"2019-12-09","arxiv_id":"2001.00846","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}}}},{"paper":"/paper/enhancing-vaes-for-collaborative-filtering","slug":"enhancing-vaes-for-collaborative-filtering","title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","date":"2019-11-03","arxiv_id":"1911.00936","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mmgcn-multi-modal-graph-convolution-network","slug":"mmgcn-multi-modal-graph-convolution-network","title":"MMGCN: Multi-modal Graph Convolution Network for Personalized Recommendation of Micro-video","date":"2019-10-19","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sse-pt-sequential-recommendation-via","slug":"sse-pt-sequential-recommendation-via","title":"SSE-PT: Sequential Recommendation Via Personalized Transformer","date":"2019-09-25","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/attribute-aware-non-linear-co-embeddings-of","slug":"attribute-aware-non-linear-co-embeddings-of","title":"Attribute-aware non-linear co-embeddings of graph features","date":"2019-09-16","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/scalable-probabilistic-matrix-factorization","slug":"scalable-probabilistic-matrix-factorization","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","date":"2019-08-25","arxiv_id":"1908.09393","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-end-to-end-neighborhood-based-interaction","slug":"an-end-to-end-neighborhood-based-interaction","title":"An End-to-End Neighborhood-based Interaction Model for Knowledge-enhanced Recommendation","date":"2019-08-12","arxiv_id":"1908.04032","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/explainable-knowledge-graph-based","slug":"explainable-knowledge-graph-based","title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","date":"2019-06-22","arxiv_id":"1906.09506","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/hierarchical-gating-networks-for-sequential","slug":"hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","arxiv_id":"1906.09217","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}}}},{"paper":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":7,"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}}}},{"paper":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":6,"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}}}},{"paper":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}}}},{"paper":"/paper/on-the-difficulty-of-evaluating-baselines-a","slug":"on-the-difficulty-of-evaluating-baselines-a","title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","date":"2019-05-04","arxiv_id":"1905.01395","rows_on_this_dataset":5,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}}}},{"paper":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["muhanzhang/IGMC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}}}},{"paper":"/paper/bert4rec-sequential-recommendation-with","slug":"bert4rec-sequential-recommendation-with","title":"BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer","date":"2019-04-14","arxiv_id":"1904.06690","rows_on_this_dataset":2,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["FeiSun/BERT4Rec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert4rec-sequential-recommendation-with#ran","syntology_url":"https://syntology.ai/paper/1904.06690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06690"}}}},{"paper":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}}}},{"paper":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/unifying-knowledge-graph-learning-and","slug":"unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","date":"2019-02-17","arxiv_id":"1902.06236","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sequential-variational-autoencoders-for","slug":"sequential-variational-autoencoders-for","title":"Sequential Variational Autoencoders for Collaborative Filtering","date":"2018-11-25","arxiv_id":"1811.09975","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/hyperbolic-recommender-systems","slug":"hyperbolic-recommender-systems","title":"HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems","date":"2018-09-05","arxiv_id":"1809.01703","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/180809781","slug":"180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","arxiv_id":"1808.09781","rows_on_this_dataset":3,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":8,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/180809781#ran","syntology_url":"https://syntology.ai/paper/1808.09781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09781"}}}},{"paper":"/paper/kernelized-synaptic-weight-matrices","slug":"kernelized-synaptic-weight-matrices","title":"Kernelized Synaptic Weight Matrices","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/180503352","slug":"180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","date":"2018-05-09","arxiv_id":"1805.03352","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/deep-models-of-interactions-across-sets","slug":"deep-models-of-interactions-across-sets","title":"Deep Models of Interactions Across Sets","date":"2018-03-07","arxiv_id":"1803.02879","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":1,"official":{"repos":["dawenl/vae_cf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}}}},{"paper":"/paper/mixture-rank-matrix-approximation-for","slug":"mixture-rank-matrix-approximation-for","title":"Mixture-Rank Matrix Approximation for Collaborative Filtering","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-factorization-machines-for-sparse","slug":"neural-factorization-machines-for-sparse","title":"Neural Factorization Machines for Sparse Predictive Analytics","date":"2017-08-16","arxiv_id":"1708.05027","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/latent-relational-metric-learning-via-memory","slug":"latent-relational-metric-learning-via-memory","title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","date":"2017-07-17","arxiv_id":"1707.05176","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":18,"syntology":null},{"paper":"/paper/graph-convolutional-matrix-completion","slug":"graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","rows_on_this_dataset":4,"code_links":17,"syntology":null},{"paper":"/paper/geometric-matrix-completion-with-recurrent","slug":"geometric-matrix-completion-with-recurrent","title":"Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks","date":"2017-04-22","arxiv_id":"1704.06803","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":23,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":11,"syntology":null},{"paper":"/paper/hybrid-recommender-system-based-on","slug":"hybrid-recommender-system-based-on","title":"Hybrid Recommender System based on Autoencoders","date":"2016-06-24","arxiv_id":"1606.07659","rows_on_this_dataset":4,"code_links":4,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":39,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/a-neural-autoregressive-approach-to","slug":"a-neural-autoregressive-approach-to","title":"A Neural Autoregressive Approach to Collaborative Filtering","date":"2016-05-31","arxiv_id":"1605.09477","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-neural-autoregressive-approach-to#ran","syntology_url":"https://syntology.ai/paper/1605.09477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09477"}}}},{"paper":"/paper/dictionary-learning-for-massive-matrix","slug":"dictionary-learning-for-massive-matrix","title":"Dictionary Learning for Massive Matrix Factorization","date":"2016-05-03","arxiv_id":"1605.00937","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/collaborative-filtering-with-graph","slug":"collaborative-filtering-with-graph","title":"Collaborative Filtering with Graph Information: Consistency and Scalable Methods","date":"2015-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/session-based-recommendations-with-recurrent","slug":"session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","arxiv_id":"1511.06939","rows_on_this_dataset":2,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/session-based-recommendations-with-recurrent#ran","syntology_url":"https://syntology.ai/paper/1511.06939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06939"}}}},{"paper":"/paper/neural-network-matrix-factorization","slug":"neural-network-matrix-factorization","title":"Neural Network Matrix Factorization","date":"2015-11-19","arxiv_id":"1511.06443","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/autorec-autoencoders-meet-collaborative","slug":"autorec-autoencoders-meet-collaborative","title":"AutoRec: Autoencoders Meet Collaborative Filtering","date":"2015-05-18","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/matrix-completion-on-graphs","slug":"matrix-completion-on-graphs","title":"Matrix Completion on Graphs","date":"2014-08-07","arxiv_id":"1408.1717","rows_on_this_dataset":1,"code_links":2,"syntology":null}],"papers_where_code_ran":29,"papers_where_code_ran_first_page":"/dataset/movielens/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/movielens/papers/ran/1","json":"/dataset/movielens/papers/ran/1.json","rows":29}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":29,"samples_harvested":248,"samples_ran":160,"samples_constructed":18,"samples_ran_checked":127,"samples_ran_instrument_failed":33,"samples_unverified":88,"pointer_only_for_licence":56,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":29,"papers_with_a_run_with_no_instrument_failure":29,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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":9,"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/collaborative-filtering-on-movielens-1m","since_archive":"/sota/collaborative-filtering-on-movielens-1m#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/collaborative-filtering-on-movielens-20m","since_archive":"/sota/collaborative-filtering-on-movielens-20m#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/link-prediction-on-movielens-25m","since_archive":"/sota/link-prediction-on-movielens-25m#since-judged","papers_judged":1,"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/collaborative-filtering-on-movielens-1m-1","since_archive":"/sota/collaborative-filtering-on-movielens-1m-1#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/sequential-recommendation-on-movielens-1m","since_archive":"/sota/sequential-recommendation-on-movielens-1m#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/multi-media-recommendation-on-movielens","since_archive":"/sota/multi-media-recommendation-on-movielens#since-judged","papers_judged":2,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"60f6260be985c301854b0605e8d3c9f96d0210cc0f9fa291c06500f5e9045897","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}