{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/collaborative-filtering","name":"Collaborative Filtering","slug":"collaborative-filtering","description_markdown":null,"categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1309,"papers_with_code":461,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":6,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/collaborative-filtering-on-gowalla","slug":"collaborative-filtering-on-gowalla","dataset":"Gowalla","dataset_url":"/dataset/gowalla","rows_in_archive":11,"metrics":["Recall@20","NDCG@20"],"first_row_in_archive_order":{"model":"RLAE-DAN","paper_title":"Why is Normalization Necessary for Linear Recommenders?","paper_url":"/paper/why-is-normalization-necessary-for-linear","paper_date":"2025-04-08","arxiv_id":"2504.05805","code_links":[{"title":"psm1206/dan","url":"https://github.com/psm1206/dan"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-yelp2018","slug":"collaborative-filtering-on-yelp2018","dataset":"Yelp2018","dataset_url":"/dataset/yelp2018","rows_in_archive":9,"metrics":["NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"NESCL","paper_title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","paper_url":"/paper/neighborhood-enhanced-supervised-contrastive","paper_date":"2024-02-18","arxiv_id":"2402.11523","code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neighborhood-enhanced-supervised-contrastive#ran","syntology_url":"https://syntology.ai/paper/2402.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11523"}},"official":null}}},{"leaderboard":"/sota/collaborative-filtering-on-amazon-book","slug":"collaborative-filtering-on-amazon-book","dataset":"Amazon-Book","dataset_url":"/dataset/amazon-book","rows_in_archive":6,"metrics":["Recall@20","NDCG@20"],"first_row_in_archive_order":{"model":"SANSA","paper_title":"Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering","paper_url":"/paper/scalable-approximate-nonsymmetric-autoencoder","paper_date":"2023-09-14","arxiv_id":null,"code_links":[{"title":"glami/sansa","url":"https://github.com/glami/sansa"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m-1","slug":"collaborative-filtering-on-movielens-1m-1","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":4,"metrics":["NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"SimpleX","paper_title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","paper_url":"/paper/simplex-a-simple-and-strong-baseline-for","paper_date":"2021-09-26","arxiv_id":"2109.12613","code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/cf/SimpleX"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/gowalla","name":"Gowalla","full_name":"Gowalla","num_papers_in_archive":203},{"url":"/dataset/yelp2018","name":"Yelp2018","full_name":"Yelp2018","num_papers_in_archive":125},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/amazon-book","name":"Amazon-Book","full_name":"","num_papers_in_archive":18},{"url":"/dataset/genre2movies","name":"Genre2Movies","full_name":"Compositional queries for Movie recommendation","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":14,"rows_per_page":100,"shown":100,"of":1309,"of_with_code":461,"tagged_in_all":1309,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":56,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":56,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/neural-collaborative-filtering","slug":"neural-collaborative-filtering","title":"Neural Collaborative Filtering","date":"2017-08-16","arxiv_id":"1708.05031","repositories_listed":43,"syntology":null},{"url":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","repositories_listed":18,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","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"}},"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"]}}},{"url":"/paper/graph-convolutional-matrix-completion","slug":"graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","repositories_listed":17,"syntology":null},{"url":"/paper/recurrent-neural-networks-with-top-k-gains","slug":"recurrent-neural-networks-with-top-k-gains","title":"Recurrent Neural Networks with Top-k Gains for Session-based Recommendations","date":"2017-06-12","arxiv_id":"1706.03847","repositories_listed":12,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/recurrent-neural-networks-with-top-k-gains#ran","syntology_url":"https://syntology.ai/paper/1706.03847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03847"}},"official":{"repos":["hidasib/GRU4Rec"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/a-contextual-bandit-approach-to-personalized","slug":"a-contextual-bandit-approach-to-personalized","title":"A Contextual-Bandit Approach to Personalized News Article Recommendation","date":"2010-02-28","arxiv_id":"1003.0146","repositories_listed":12,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-contextual-bandit-approach-to-personalized#ran","syntology_url":"https://syntology.ai/paper/1003.0146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1003.0146"}},"official":null}},{"url":"/paper/training-deep-autoencoders-for-collaborative","slug":"training-deep-autoencoders-for-collaborative","title":"Training Deep AutoEncoders for Collaborative Filtering","date":"2017-08-05","arxiv_id":"1708.01715","repositories_listed":10,"syntology":null},{"url":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","repositories_listed":9,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}},"official":null}},{"url":"/paper/ripplenet-propagating-user-preferences-on-the","slug":"ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","arxiv_id":"1803.03467","repositories_listed":9,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ripplenet-propagating-user-preferences-on-the#ran","syntology_url":"https://syntology.ai/paper/1803.03467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03467"}},"official":{"repos":["hwwang55/RippleNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/item2vec-neural-item-embedding-for","slug":"item2vec-neural-item-embedding-for","title":"Item2Vec: Neural Item Embedding for Collaborative Filtering","date":"2016-03-14","arxiv_id":"1603.04259","repositories_listed":7,"syntology":null},{"url":"/paper/mixed-dimension-embeddings-with-application","slug":"mixed-dimension-embeddings-with-application","title":"Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems","date":"2019-09-25","arxiv_id":"1909.11810","repositories_listed":6,"syntology":{"n":26,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":26,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixed-dimension-embeddings-with-application#ran","syntology_url":"https://syntology.ai/paper/1909.11810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11810"}},"official":{"repos":["facebookresearch/dlrm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/towards-an-appropriate-query-key-and-value","slug":"towards-an-appropriate-query-key-and-value","title":"Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracing","date":"2020-02-14","arxiv_id":"2002.07033","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-an-appropriate-query-key-and-value#ran","syntology_url":"https://syntology.ai/paper/2002.07033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07033"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-based","slug":"deep-reinforcement-learning-based","title":"Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling","date":"2018-10-29","arxiv_id":"1810.12027","repositories_listed":5,"syntology":null},{"url":"/paper/180503352","slug":"180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","date":"2018-05-09","arxiv_id":"1805.03352","repositories_listed":5,"syntology":null},{"url":"/paper/collaborative-memory-network-for","slug":"collaborative-memory-network-for","title":"Collaborative Memory Network for Recommendation Systems","date":"2018-04-29","arxiv_id":"1804.10862","repositories_listed":5,"syntology":null},{"url":"/paper/lecf-recommendation-via-learnable-edge","slug":"lecf-recommendation-via-learnable-edge","title":"LECF: Recommendation via Learnable Edge Collaborative Filtering","date":"2021-12-23","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/neural-collaborative-filtering-vs-matrix","slug":"neural-collaborative-filtering-vs-matrix","title":"Neural Collaborative Filtering vs. Matrix Factorization Revisited","date":"2020-05-19","arxiv_id":"2005.09683","repositories_listed":4,"syntology":null},{"url":"/paper/diffnet-a-neural-influence-and-interest","slug":"diffnet-a-neural-influence-and-interest","title":"DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation","date":"2020-01-15","arxiv_id":"2002.00844","repositories_listed":4,"syntology":null},{"url":"/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","repositories_listed":4,"syntology":null},{"url":"/paper/a-bi-step-grounding-paradigm-for-large","slug":"a-bi-step-grounding-paradigm-for-large","title":"A Bi-Step Grounding Paradigm for Large Language Models in Recommendation Systems","date":"2023-08-16","arxiv_id":"2308.08434","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bi-step-grounding-paradigm-for-large#ran","syntology_url":"https://syntology.ai/paper/2308.08434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08434"}},"official":{"repos":["sai990323/grounding4rec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/popularity-bias-in-collaborative-filtering","slug":"popularity-bias-in-collaborative-filtering","title":"Popularity Bias in Collaborative Filtering-Based Multimedia Recommender Systems","date":"2022-03-01","arxiv_id":"2203.00376","repositories_listed":3,"syntology":null},{"url":"/paper/an-evaluation-study-of-generative-adversarial","slug":"an-evaluation-study-of-generative-adversarial","title":"An Evaluation Study of Generative Adversarial Networks for Collaborative Filtering","date":"2022-01-05","arxiv_id":"2201.01815","repositories_listed":3,"syntology":null},{"url":"/paper/pareto-optimality-for-fairness-constrained","slug":"pareto-optimality-for-fairness-constrained","title":"Pareto Optimality for Fairness-constrained Collaborative Filtering","date":"2021-09-17","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":null},{"url":"/paper/federated-reconstruction-partially-local","slug":"federated-reconstruction-partially-local","title":"Federated Reconstruction: Partially Local Federated Learning","date":"2021-02-05","arxiv_id":"2102.03448","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/federated-reconstruction-partially-local#ran","syntology_url":"https://syntology.ai/paper/2102.03448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03448"}},"official":{"repos":["google-research/federated"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-user-representations-with","slug":"learning-user-representations-with","title":"Learning User Representations with Hypercuboids for Recommender Systems","date":"2020-11-11","arxiv_id":"2011.05742","repositories_listed":3,"syntology":null},{"url":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","repositories_listed":3,"syntology":null},{"url":"/paper/neural-collaborative-reasoning","slug":"neural-collaborative-reasoning","title":"Neural Collaborative Reasoning","date":"2020-05-16","arxiv_id":"2005.08129","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/a-deep-learning-system-for-predicting-size","slug":"a-deep-learning-system-for-predicting-size","title":"A Deep Learning System for Predicting Size and Fit in Fashion E-Commerce","date":"2019-07-23","arxiv_id":"1907.09844","repositories_listed":3,"syntology":null},{"url":"/paper/joint-neural-collaborative-filtering-for","slug":"joint-neural-collaborative-filtering-for","title":"Joint Neural Collaborative Filtering for Recommender Systems","date":"2019-07-08","arxiv_id":"1907.03459","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/nais-neural-attentive-item-similarity-model","slug":"nais-neural-attentive-item-similarity-model","title":"NAIS: Neural Attentive Item Similarity Model for Recommendation","date":"2018-09-19","arxiv_id":"1809.07053","repositories_listed":3,"syntology":null},{"url":"/paper/algorithm-selection-for-collaborative","slug":"algorithm-selection-for-collaborative","title":"Algorithm Selection for Collaborative Filtering: the influence of graph metafeatures and multicriteria metatargets","date":"2018-07-23","arxiv_id":"1807.09097","repositories_listed":3,"syntology":null},{"url":"/paper/a-hybrid-variational-autoencoder-for","slug":"a-hybrid-variational-autoencoder-for","title":"A Hybrid Variational Autoencoder for Collaborative Filtering","date":"2018-07-14","arxiv_id":"1808.01006","repositories_listed":3,"syntology":null},{"url":"/paper/time-and-local-popularity-in-top-n","slug":"time-and-local-popularity-in-top-n","title":"Local Popularity and Time in top-N Recommendation","date":"2018-07-11","arxiv_id":"1807.04204","repositories_listed":3,"syntology":null},{"url":"/paper/hybridsvd-when-collaborative-information-is","slug":"hybridsvd-when-collaborative-information-is","title":"HybridSVD: When Collaborative Information is Not Enough","date":"2018-02-18","arxiv_id":"1802.06398","repositories_listed":3,"syntology":null},{"url":"/paper/variational-autoencoders-for-collaborative-1","slug":"variational-autoencoders-for-collaborative-1","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/starspace-embed-all-the-things","slug":"starspace-embed-all-the-things","title":"StarSpace: Embed All The Things!","date":"2017-09-12","arxiv_id":"1709.03856","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/09110460","slug":"09110460","title":"Feature-Weighted Linear Stacking","date":"2009-11-03","arxiv_id":"0911.0460","repositories_listed":3,"syntology":null},{"url":"/paper/personalized-diffusion-model-reshapes-cold","slug":"personalized-diffusion-model-reshapes-cold","title":"Personalized Diffusion Model Reshapes Cold-Start Bundle Recommendation","date":"2025-05-20","arxiv_id":"2505.14901","repositories_listed":2,"syntology":null},{"url":"/paper/unveiling-contrastive-learning-s-capability","slug":"unveiling-contrastive-learning-s-capability","title":"Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering","date":"2025-04-14","arxiv_id":"2504.10113","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-model-empowered-embedding","slug":"large-language-model-empowered-embedding","title":"LLMEmb: Large Language Model Can Be a Good Embedding Generator for Sequential Recommendation","date":"2024-09-30","arxiv_id":"2409.19925","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-empowered-embedding#ran","syntology_url":"https://syntology.ai/paper/2409.19925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19925"}},"official":{"repos":["applied-machine-learning-lab/llmemb","liuqidong07/LLMEmb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/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"}},"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"]}}},{"url":"/paper/towards-graph-aware-diffusion-modeling-for","slug":"towards-graph-aware-diffusion-modeling-for","title":"Graph Signal Diffusion Model for Collaborative Filtering","date":"2023-11-15","arxiv_id":"2311.08744","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-graph-aware-diffusion-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2311.08744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08744"}},"official":{"repos":["hasined/giffcf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/kg4ex-an-explainable-knowledge-graph-based","slug":"kg4ex-an-explainable-knowledge-graph-based","title":"KG4Ex: An Explainable Knowledge Graph-Based Approach for Exercise Recommendation","date":"2023-10-21","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/co-evolving-vector-quantization-for-id-based","slug":"co-evolving-vector-quantization-for-id-based","title":"Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization","date":"2023-08-31","arxiv_id":"2308.16761","repositories_listed":2,"syntology":null},{"url":"/paper/how-expressive-are-graph-neural-networks-in","slug":"how-expressive-are-graph-neural-networks-in","title":"How Expressive are Graph Neural Networks in Recommendation?","date":"2023-08-22","arxiv_id":"2308.11127","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-graph-contrastive-learning-for","slug":"adaptive-graph-contrastive-learning-for","title":"Adaptive Graph Contrastive Learning for Recommendation","date":"2023-05-18","arxiv_id":"2305.10837","repositories_listed":2,"syntology":null},{"url":"/paper/automated-self-supervised-learning-for","slug":"automated-self-supervised-learning-for","title":"Automated Self-Supervised Learning for Recommendation","date":"2023-03-14","arxiv_id":"2303.07797","repositories_listed":2,"syntology":null},{"url":"/paper/hidden-author-bias-in-book-recommendation","slug":"hidden-author-bias-in-book-recommendation","title":"Hidden Author Bias in Book Recommendation","date":"2022-09-01","arxiv_id":"2209.00371","repositories_listed":2,"syntology":null},{"url":"/paper/towards-representation-alignment-and","slug":"towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","arxiv_id":"2206.12811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-representation-alignment-and#ran","syntology_url":"https://syntology.ai/paper/2206.12811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12811"}},"official":{"repos":["thuwangcy/directau"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","repositories_listed":2,"syntology":null},{"url":"/paper/linear-or-non-linear-that-is-the-question","slug":"linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","arxiv_id":"2111.07265","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linear-or-non-linear-that-is-the-question#ran","syntology_url":"https://syntology.ai/paper/2111.07265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07265"}},"official":{"repos":["jeongwhanchoi/HMLET"],"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"]}}},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-the-performance-of-ials-on-item","slug":"revisiting-the-performance-of-ials-on-item","title":"Revisiting the Performance of iALS on Item Recommendation Benchmarks","date":"2021-10-26","arxiv_id":"2110.14037","repositories_listed":2,"syntology":null},{"url":"/paper/dgcn-diversified-recommendation-with-graph","slug":"dgcn-diversified-recommendation-with-graph","title":"DGCN: Diversified Recommendation with Graph Convolutional Networks","date":"2021-08-16","arxiv_id":"2108.06952","repositories_listed":2,"syntology":null},{"url":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}},"official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/selfcf-a-simple-framework-for-self-supervised","slug":"selfcf-a-simple-framework-for-self-supervised","title":"SelfCF: A Simple Framework for Self-supervised Collaborative Filtering","date":"2021-07-07","arxiv_id":"2107.03019","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-filtering-under-model","slug":"collaborative-filtering-under-model","title":"Collaborative Filtering under Model Uncertainty","date":"2020-08-23","arxiv_id":"2008.10117","repositories_listed":2,"syntology":null},{"url":"/paper/disentangled-graph-collaborative-filtering","slug":"disentangled-graph-collaborative-filtering","title":"Disentangled Graph Collaborative Filtering","date":"2020-07-03","arxiv_id":"2007.01764","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/deep-match-to-rank-model-for-personalized","slug":"deep-match-to-rank-model-for-personalized","title":"Deep Match to Rank Model for Personalized Click-Through Rate Prediction","date":"2020-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-based-collaborative","slug":"revisiting-graph-based-collaborative","title":"Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach","date":"2020-01-28","arxiv_id":"2001.10167","repositories_listed":2,"syntology":null},{"url":"/paper/sdm-sequential-deep-matching-model-for-online","slug":"sdm-sequential-deep-matching-model-for-online","title":"SDM: Sequential Deep Matching Model for Online Large-scale Recommender System","date":"2019-09-01","arxiv_id":"1909.00385","repositories_listed":2,"syntology":null},{"url":"/paper/searching-for-interaction-functions-in","slug":"searching-for-interaction-functions-in","title":"Efficient Neural Interaction Function Search for Collaborative Filtering","date":"2019-06-28","arxiv_id":"1906.12091","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-recommender-systems-for-ai-driven","slug":"evaluating-recommender-systems-for-ai-driven","title":"Evaluating recommender systems for AI-driven biomedical informatics","date":"2019-05-22","arxiv_id":"1905.09205","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/relational-collaborative-filteringmodeling","slug":"relational-collaborative-filteringmodeling","title":"Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendation","date":"2019-04-29","arxiv_id":"1904.12796","repositories_listed":2,"syntology":null},{"url":"/paper/a-neural-influence-diffusion-model-for-social","slug":"a-neural-influence-diffusion-model-for-social","title":"A Neural Influence Diffusion Model for Social Recommendation","date":"2019-04-20","arxiv_id":"1904.10322","repositories_listed":2,"syntology":null},{"url":"/paper/deepcf-a-unified-framework-of-representation","slug":"deepcf-a-unified-framework-of-representation","title":"DeepCF: A Unified Framework of Representation Learning and Matching Function Learning in Recommender System","date":"2019-01-15","arxiv_id":"1901.04704","repositories_listed":2,"syntology":null},{"url":"/paper/the-lkpy-package-for-recommender-systems","slug":"the-lkpy-package-for-recommender-systems","title":"LensKit for Python: Next-Generation Software for Recommender System Experiments","date":"2018-09-10","arxiv_id":"1809.03125","repositories_listed":2,"syntology":null},{"url":"/paper/exploring-author-gender-in-book-rating-and","slug":"exploring-author-gender-in-book-rating-and","title":"Exploring Author Gender in Book Rating and Recommendation","date":"2018-08-22","arxiv_id":"1808.07586","repositories_listed":2,"syntology":null},{"url":"/paper/deep-content-user-embedding-model-for-music","slug":"deep-content-user-embedding-model-for-music","title":"Deep Content-User Embedding Model for Music Recommendation","date":"2018-07-18","arxiv_id":"1807.06786","repositories_listed":2,"syntology":null},{"url":"/paper/kernelized-synaptic-weight-matrices","slug":"kernelized-synaptic-weight-matrices","title":"Kernelized Synaptic Weight Matrices","date":"2018-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/indian-regional-movie-dataset-for-recommender","slug":"indian-regional-movie-dataset-for-recommender","title":"Indian Regional Movie Dataset for Recommender Systems","date":"2018-01-07","arxiv_id":"1801.02203","repositories_listed":2,"syntology":null},{"url":"/paper/using-posters-to-recommend-anime-and-mangas","slug":"using-posters-to-recommend-anime-and-mangas","title":"Using Posters to Recommend Anime and Mangas in a Cold-Start Scenario","date":"2017-09-03","arxiv_id":"1709.01584","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-filtering-with-recurrent-neural","slug":"collaborative-filtering-with-recurrent-neural","title":"Collaborative Filtering with Recurrent Neural Networks","date":"2016-08-26","arxiv_id":"1608.07400","repositories_listed":2,"syntology":null},{"url":"/paper/fifty-shades-of-ratings-how-to-benefit-from-a","slug":"fifty-shades-of-ratings-how-to-benefit-from-a","title":"Fifty Shades of Ratings: How to Benefit from a Negative Feedback in Top-N Recommendations Tasks","date":"2016-07-14","arxiv_id":"1607.04228","repositories_listed":2,"syntology":null},{"url":"/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,"repositories_listed":2,"syntology":null},{"url":"/paper/neural-network-matrix-factorization","slug":"neural-network-matrix-factorization","title":"Neural Network Matrix Factorization","date":"2015-11-19","arxiv_id":"1511.06443","repositories_listed":2,"syntology":null},{"url":"/paper/autorec-autoencoders-meet-collaborative","slug":"autorec-autoencoders-meet-collaborative","title":"AutoRec: Autoencoders Meet Collaborative Filtering","date":"2015-05-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/matrix-completion-on-graphs","slug":"matrix-completion-on-graphs","title":"Matrix Completion on Graphs","date":"2014-08-07","arxiv_id":"1408.1717","repositories_listed":2,"syntology":null},{"url":"/paper/latent-dirichlet-allocation","slug":"latent-dirichlet-allocation","title":"Latent Dirichlet Allocation","date":"2003-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/nlgcl-naturally-existing-neighbor-layers","slug":"nlgcl-naturally-existing-neighbor-layers","title":"NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation","date":"2025-07-10","arxiv_id":"2507.07522","repositories_listed":1,"syntology":null},{"url":"/paper/from-id-based-to-id-free-rethinking-id","slug":"from-id-based-to-id-free-rethinking-id","title":"From ID-based to ID-free: Rethinking ID Effectiveness in Multimodal Collaborative Filtering Recommendation","date":"2025-07-08","arxiv_id":"2507.05715","repositories_listed":1,"syntology":null},{"url":"/paper/rag-visualrec-an-open-resource-for-vision-and","slug":"rag-visualrec-an-open-resource-for-vision-and","title":"RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation","date":"2025-06-25","arxiv_id":"2506.20817","repositories_listed":1,"syntology":null},{"url":"/paper/llm2rec-large-language-models-are-powerful","slug":"llm2rec-large-language-models-are-powerful","title":"LLM2Rec: Large Language Models Are Powerful Embedding Models for Sequential Recommendation","date":"2025-06-16","arxiv_id":"2506.21579","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llm2rec-large-language-models-are-powerful#ran","syntology_url":"https://syntology.ai/paper/2506.21579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.21579"}},"official":{"repos":["happypointer/llm2rec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-view-disentangled-multi-intent-learning","slug":"dual-view-disentangled-multi-intent-learning","title":"Dual-View Disentangled Multi-Intent Learning for Enhanced Collaborative Filtering","date":"2025-06-13","arxiv_id":"2506.11538","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-scale-invariant-metric-learning-for","slug":"discrete-scale-invariant-metric-learning-for","title":"Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering","date":"2025-06-11","arxiv_id":"2506.09898","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-in-repeated-implicit-feedback-as","slug":"uncertainty-in-repeated-implicit-feedback-as","title":"Uncertainty in Repeated Implicit Feedback as a Measure of Reliability","date":"2025-05-05","arxiv_id":"2505.02492","repositories_listed":1,"syntology":null},{"url":"/paper/simaug-enhancing-recommendation-with","slug":"simaug-enhancing-recommendation-with","title":"SimAug: Enhancing Recommendation with Pretrained Language Models for Dense and Balanced Data Augmentation","date":"2025-05-03","arxiv_id":"2505.01695","repositories_listed":1,"syntology":null},{"url":"/paper/graph-spectral-filtering-with-chebyshev","slug":"graph-spectral-filtering-with-chebyshev","title":"Graph Spectral Filtering with Chebyshev Interpolation for Recommendation","date":"2025-05-01","arxiv_id":"2505.00552","repositories_listed":1,"syntology":null},{"url":"/paper/retrieval-augmented-generation-with-2","slug":"retrieval-augmented-generation-with-2","title":"Retrieval Augmented Generation with Collaborative Filtering for Personalized Text Generation","date":"2025-04-08","arxiv_id":"2504.05731","repositories_listed":1,"syntology":null},{"url":"/paper/why-is-normalization-necessary-for-linear","slug":"why-is-normalization-necessary-for-linear","title":"Why is Normalization Necessary for Linear Recommenders?","date":"2025-04-08","arxiv_id":"2504.05805","repositories_listed":1,"syntology":null},{"url":"/paper/can-llm-driven-hard-negative-sampling-empower","slug":"can-llm-driven-hard-negative-sampling-empower","title":"Can LLM-Driven Hard Negative Sampling Empower Collaborative Filtering? Findings and Potentials","date":"2025-04-07","arxiv_id":"2504.04726","repositories_listed":1,"syntology":null}],"syntology_records":24,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":6,"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-gowalla","since_archive":"/sota/collaborative-filtering-on-gowalla#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/collaborative-filtering-on-yelp2018","since_archive":"/sota/collaborative-filtering-on-yelp2018#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/collaborative-filtering-on-amazon-book","since_archive":"/sota/collaborative-filtering-on-amazon-book#since-judged","papers_judged":1,"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}]},"papers_where_code_ran":63,"papers_where_code_ran_first_page":"/task/collaborative-filtering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":14,"url":"/task/collaborative-filtering/papers/2","json":"/task/collaborative-filtering/papers/2.json","rows":100},{"order":"archive","page":3,"of":14,"url":"/task/collaborative-filtering/papers/3","json":"/task/collaborative-filtering/papers/3.json","rows":100},{"order":"archive","page":4,"of":14,"url":"/task/collaborative-filtering/papers/4","json":"/task/collaborative-filtering/papers/4.json","rows":100},{"order":"archive","page":5,"of":14,"url":"/task/collaborative-filtering/papers/5","json":"/task/collaborative-filtering/papers/5.json","rows":100},{"order":"archive","page":6,"of":14,"url":"/task/collaborative-filtering/papers/6","json":"/task/collaborative-filtering/papers/6.json","rows":100},{"order":"archive","page":7,"of":14,"url":"/task/collaborative-filtering/papers/7","json":"/task/collaborative-filtering/papers/7.json","rows":100},{"order":"archive","page":8,"of":14,"url":"/task/collaborative-filtering/papers/8","json":"/task/collaborative-filtering/papers/8.json","rows":100},{"order":"archive","page":9,"of":14,"url":"/task/collaborative-filtering/papers/9","json":"/task/collaborative-filtering/papers/9.json","rows":100},{"order":"archive","page":10,"of":14,"url":"/task/collaborative-filtering/papers/10","json":"/task/collaborative-filtering/papers/10.json","rows":100},{"order":"archive","page":11,"of":14,"url":"/task/collaborative-filtering/papers/11","json":"/task/collaborative-filtering/papers/11.json","rows":100},{"order":"archive","page":12,"of":14,"url":"/task/collaborative-filtering/papers/12","json":"/task/collaborative-filtering/papers/12.json","rows":100},{"order":"archive","page":13,"of":14,"url":"/task/collaborative-filtering/papers/13","json":"/task/collaborative-filtering/papers/13.json","rows":100},{"order":"archive","page":14,"of":14,"url":"/task/collaborative-filtering/papers/14","json":"/task/collaborative-filtering/papers/14.json","rows":9},{"order":"ran","page":1,"of":1,"url":"/task/collaborative-filtering/papers/ran/1","json":"/task/collaborative-filtering/papers/ran/1.json","rows":63}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"9c04e5425ef5c31e661019f96af5771ca6b5b8040e57d75cf3f3e6d32c8af882","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}