{"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/movie-recommendation","name":"Movie Recommendation","slug":"movie-recommendation","description_markdown":"Evaluates the ability of language models to propose relevant movie recommendations with collaborative filtering data.\r\n\r\nSource: [BIG-bench](https://github.com/google/BIG-bench/tree/main/bigbench/benchmark_tasks/movie_recommendation)","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":113,"papers_with_code":29,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":2,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/movie-recommendation-on-movielens-1m","slug":"movie-recommendation-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":5,"metrics":["NDCG","RMSE"],"first_row_in_archive_order":{"model":"BPR","paper_title":"Post Processing Recommender Systems with Knowledge Graphs for Recency, Popularity, and Diversity of Explanations","paper_url":"/paper/post-processing-recommender-systems-with","paper_date":"2022-04-24","arxiv_id":"2204.11241","code_links":[{"title":"giacoballoccu/explanation-quality-recsys","url":"https://github.com/giacoballoccu/explanation-quality-recsys"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/genre2movies","name":"Genre2Movies","full_name":"Compositional queries for Movie recommendation","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/general-knowledge","name":"General Knowledge"}],"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":2,"rows_per_page":100,"shown":100,"of":113,"of_with_code":29,"tagged_in_all":113,"counts":{"archive_papers_tagged":113,"with_a_code_link":29,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":113,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","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/llamarec-two-stage-recommendation-using-large","slug":"llamarec-two-stage-recommendation-using-large","title":"LlamaRec: Two-Stage Recommendation using Large Language Models for Ranking","date":"2023-10-25","arxiv_id":"2311.02089","repositories_listed":2,"syntology":null},{"url":"/paper/bloomberggpt-a-large-language-model-for","slug":"bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","arxiv_id":"2303.17564","repositories_listed":2,"syntology":null},{"url":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":3,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}},"official":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/ducho-meets-elliot-large-scale-benchmarks-for-1","slug":"ducho-meets-elliot-large-scale-benchmarks-for-1","title":"Ducho meets Elliot: Large-scale Benchmarks for Multimodal Recommendation","date":"2024-09-24","arxiv_id":"2409.15857","repositories_listed":1,"syntology":null},{"url":"/paper/harm-mitigation-in-recommender-systems-under","slug":"harm-mitigation-in-recommender-systems-under","title":"Harm Mitigation in Recommender Systems under User Preference Dynamics","date":"2024-06-14","arxiv_id":"2406.09882","repositories_listed":1,"syntology":null},{"url":"/paper/practical-0-385-approximation-for-submodular","slug":"practical-0-385-approximation-for-submodular","title":"Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint","date":"2024-05-22","arxiv_id":"2405.13994","repositories_listed":1,"syntology":null},{"url":"/paper/lfg-a-generative-network-for-real-time","slug":"lfg-a-generative-network-for-real-time","title":"LFG: A Generative Network for Real-Time Recommendation","date":"2023-10-31","arxiv_id":"2310.20189","repositories_listed":1,"syntology":null},{"url":"/paper/on-generative-agents-in-recommendation","slug":"on-generative-agents-in-recommendation","title":"On Generative Agents in Recommendation","date":"2023-10-16","arxiv_id":"2310.10108","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-generative-agents-in-recommendation#ran","syntology_url":"https://syntology.ai/paper/2310.10108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10108"}},"official":{"repos":["LehengTHU/Agent4Rec"],"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":["official"]}}},{"url":"/paper/obeying-the-order-introducing-ordered","slug":"obeying-the-order-introducing-ordered","title":"Obeying the Order: Introducing Ordered Transfer Hyperparameter Optimisation","date":"2023-06-29","arxiv_id":"2306.16916","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-in-streaming-submodular-maximization-1","slug":"fairness-in-streaming-submodular-maximization-1","title":"Fairness in Streaming Submodular Maximization over a Matroid Constraint","date":"2023-05-24","arxiv_id":"2305.15118","repositories_listed":1,"syntology":null},{"url":"/paper/attention-based-ingredient-phrase-parser","slug":"attention-based-ingredient-phrase-parser","title":"Attention-based Ingredient Phrase Parser","date":"2022-10-05","arxiv_id":"2210.02535","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-attentional-neural-network","slug":"knowledge-aware-attentional-neural-network","title":"Knowledge-aware attentional neural network for review-based movie recommendation with explanations","date":"2022-09-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learning-propagating-features-on-the","slug":"jointly-learning-propagating-features-on-the","title":"Jointly Learning Propagating Features on the Knowledge Graph for Movie Recommendation","date":"2022-08-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/interactive-combinatorial-bandits-balancing","slug":"interactive-combinatorial-bandits-balancing","title":"Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback","date":"2022-07-07","arxiv_id":"2207.03091","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/you-sound-like-someone-who-watches-drama","slug":"you-sound-like-someone-who-watches-drama","title":"You Sound Like Someone Who Watches Drama Movies: Towards Predicting Movie Preferences from Conversational Interactions","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simulating-user-satisfaction-for-the","slug":"simulating-user-satisfaction-for-the","title":"Simulating User Satisfaction for the Evaluation of Task-oriented Dialogue Systems","date":"2021-05-08","arxiv_id":"2105.03748","repositories_listed":1,"syntology":null},{"url":"/paper/bias-in-knowledge-graphs-an-empirical-study","slug":"bias-in-knowledge-graphs-an-empirical-study","title":"Bias in Knowledge Graphs -- an Empirical Study with Movie Recommendation and Different Language Editions of DBpedia","date":"2021-05-03","arxiv_id":"2105.00674","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-in-streaming-submodular-maximization","slug":"fairness-in-streaming-submodular-maximization","title":"Fairness in Streaming Submodular Maximization: Algorithms and Hardness","date":"2020-10-14","arxiv_id":"2010.07431","repositories_listed":1,"syntology":null},{"url":"/paper/inspired-toward-sociable-recommendation","slug":"inspired-toward-sociable-recommendation","title":"INSPIRED: Toward Sociable Recommendation Dialog Systems","date":"2020-09-29","arxiv_id":"2009.14306","repositories_listed":1,"syntology":null},{"url":"/paper/the-adapter-bot-all-in-one-controllable","slug":"the-adapter-bot-all-in-one-controllable","title":"The Adapter-Bot: All-In-One Controllable Conversational Model","date":"2020-08-28","arxiv_id":"2008.12579","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-adapter-bot-all-in-one-controllable#ran","syntology_url":"https://syntology.ai/paper/2008.12579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12579"}},"official":null}},{"url":"/paper/streaming-submodular-maximization-under-a-k","slug":"streaming-submodular-maximization-under-a-k","title":"Streaming Submodular Maximization under a $k$-Set System Constraint","date":"2020-02-09","arxiv_id":"2002.03352","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/streaming-submodular-maximization-under-a-k#ran","syntology_url":"https://syntology.ai/paper/2002.03352","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03352"}},"official":null}},{"url":"/paper/no-regret-learning-in-unknown-games-with","slug":"no-regret-learning-in-unknown-games-with","title":"No-Regret Learning in Unknown Games with Correlated Payoffs","date":"2019-09-18","arxiv_id":"1909.08540","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/no-regret-learning-in-unknown-games-with#ran","syntology_url":"https://syntology.ai/paper/1909.08540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08540"}},"official":null}},{"url":"/paper/mira-a-computational-neuro-based-cognitive","slug":"mira-a-computational-neuro-based-cognitive","title":"MIRA: A Computational Neuro-Based Cognitive Architecture Applied to Movie Recommender Systems","date":"2019-02-25","arxiv_id":"1902.09291","repositories_listed":1,"syntology":null},{"url":"/paper/movie-recommendation-system-using-sentiment","slug":"movie-recommendation-system-using-sentiment","title":"Movie Recommendation System using Sentiment Analysis from Microblogging Data","date":"2018-11-27","arxiv_id":"1811.10804","repositories_listed":1,"syntology":null},{"url":null,"slug":"a-language-driven-framework-for-improving","title":"A Language-Driven Framework for Improving Personalized Recommendations: Merging LLMs with Traditional Algorithms","date":"2025-07-09","arxiv_id":"2507.07251","repositories_listed":0,"syntology":null},{"url":null,"slug":"lumicrs-asymmetric-contrastive-prototype","title":"LumiCRS: Asymmetric Contrastive Prototype Learning for Long-Tail Conversational Movie Recommendation","date":"2025-07-07","arxiv_id":"2507.04722","repositories_listed":0,"syntology":null},{"url":null,"slug":"tell-me-the-good-stuff-user-preferences-in","title":"Tell Me the Good Stuff: User Preferences in Movie Recommendation Explanations","date":"2025-05-06","arxiv_id":"2505.03376","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-selection-for-recommendation-systems","title":"Multi-Selection for Recommendation Systems","date":"2025-04-10","arxiv_id":"2504.07403","repositories_listed":0,"syntology":null},{"url":null,"slug":"movie-recommendation-using-web-crawling","title":"Movie Recommendation using Web Crawling","date":"2024-12-14","arxiv_id":"2412.10714","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-bandits-with-arm-request-costs-and","title":"Contextual Bandits with Arm Request Costs and Delays","date":"2024-10-17","arxiv_id":"2410.13109","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-narrative-driven","title":"Large Language Models as Narrative-Driven Recommenders","date":"2024-10-17","arxiv_id":"2410.13604","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-estimation-and-tuning-free-rank","title":"Bayesian Estimation and Tuning-Free Rank Detection for Probability Mass Function Tensors","date":"2024-10-08","arxiv_id":"2410.06329","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-overflow-language-model-input-blur","title":"Attention Overflow: Language Model Input Blur during Long-Context Missing Items Recommendation","date":"2024-07-18","arxiv_id":"2407.13481","repositories_listed":0,"syntology":null},{"url":null,"slug":"movie-recommendation-with-poster-attention","title":"Movie Recommendation with Poster Attention via Multi-modal Transformer Feature Fusion","date":"2024-07-12","arxiv_id":"2407.09157","repositories_listed":0,"syntology":null},{"url":null,"slug":"transforming-movie-recommendations-with","title":"Transforming Movie Recommendations with Advanced Machine Learning: A Study of NMF, SVD,and K-Means Clustering","date":"2024-07-12","arxiv_id":"2407.08916","repositories_listed":0,"syntology":null},{"url":null,"slug":"cherryrec-enhancing-news-recommendation","title":"CherryRec: Enhancing News Recommendation Quality via LLM-driven Framework","date":"2024-06-18","arxiv_id":"2406.12243","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-recommender-systems","title":"Large Language Models as Recommender Systems: A Study of Popularity Bias","date":"2024-06-03","arxiv_id":"2406.01285","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-offline-data-in-linear-latent","title":"Leveraging Offline Data in Linear Latent Bandits","date":"2024-05-27","arxiv_id":"2405.17324","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-channel-emotion-analysis-for-consensus","title":"Multi-channel Emotion Analysis for Consensus Reaching in Group Movie Recommendation Systems","date":"2024-04-21","arxiv_id":"2404.13778","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-movie-selection-using-multi-channel","title":"Group Movie Selection using Multi-channel Emotion Recognition","date":"2024-03-11","arxiv_id":"2403.12087","repositories_listed":0,"syntology":null},{"url":null,"slug":"recmind-japanese-movie-recommendation","title":"RecMind: Japanese Movie Recommendation Dialogue with Seeker's Internal State","date":"2024-02-21","arxiv_id":"2402.13522","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-bias-in-fairness-evaluations-of","title":"Unveiling Bias in Fairness Evaluations of Large Language Models: A Critical Literature Review of Music and Movie Recommendation Systems","date":"2024-01-08","arxiv_id":"2401.04057","repositories_listed":0,"syntology":null},{"url":null,"slug":"break-out-of-a-pigeonhole-a-unified-framework","title":"Break Out of a Pigeonhole: A Unified Framework for Examining Miscalibration, Bias, and Stereotype in Recommender Systems","date":"2023-12-29","arxiv_id":"2312.17443","repositories_listed":0,"syntology":null},{"url":null,"slug":"potential-factors-leading-to-popularity","title":"Potential Factors Leading to Popularity Unfairness in Recommender Systems: A User-Centered Analysis","date":"2023-10-04","arxiv_id":"2310.02961","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-maximization-under-the","title":"Submodular Maximization under the Intersection of Matroid and Knapsack Constraints","date":"2023-07-18","arxiv_id":"2307.09487","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-user-behavior-in-carousel","title":"Understanding User Behavior in Carousel Recommendation Systems for Click Modeling and Learning to Rank","date":"2023-07-04","arxiv_id":"2307.01866","repositories_listed":0,"syntology":null},{"url":null,"slug":"eye-tracking-as-a-source-of-implicit-feedback","title":"Eye Tracking as a Source of Implicit Feedback in Recommender Systems: A Preliminary Analysis","date":"2023-05-12","arxiv_id":"2305.07516","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-end-to-end-training-improves-1","title":"Multi-Task End-to-End Training Improves Conversational Recommendation","date":"2023-05-08","arxiv_id":"2305.06218","repositories_listed":0,"syntology":null},{"url":null,"slug":"excalibr-expected-calibration-of","title":"ExCalibR: Expected Calibration of Recommendations","date":"2023-04-24","arxiv_id":"2304.12311","repositories_listed":0,"syntology":null},{"url":null,"slug":"movie-recommendation-system-using-composite","title":"Movie Recommendation System using Composite Ranking","date":"2022-11-30","arxiv_id":"2212.00139","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-economics-of-recommender-systems-evidence","title":"The Informational Role of Online Recommendations: Evidence from a Field Experiment","date":"2022-11-25","arxiv_id":"2211.14219","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-stable-graph-neural-networks-via","title":"Learning Stable Graph Neural Networks via Spectral Regularization","date":"2022-11-13","arxiv_id":"2211.06966","repositories_listed":0,"syntology":null},{"url":null,"slug":"mts-kion-implicit-contextualised-sequential","title":"MTS Kion Implicit Contextualised Sequential Dataset for Movie Recommendation","date":"2022-09-01","arxiv_id":"2209.00325","repositories_listed":0,"syntology":null},{"url":null,"slug":"pepper-empowering-user-centric-recommender","title":"PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning","date":"2022-08-09","arxiv_id":"2208.05320","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-commonality-in-recommendation-of","title":"Measuring Commonality in Recommendation of Cultural Content: Recommender Systems to Enhance Cultural Citizenship","date":"2022-08-02","arxiv_id":"2208.01696","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-matrix-decomposition-model-based-on-feature","title":"A Matrix Decomposition Model Based on Feature Factors in Movie Recommendation System","date":"2022-06-12","arxiv_id":"2206.05654","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-bias-variance-characteristics-of-lime","title":"On the Bias-Variance Characteristics of LIME and SHAP in High Sparsity Movie Recommendation Explanation Tasks","date":"2022-06-09","arxiv_id":"2206.04784","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-source-graph-representation-of-the","title":"A Multi-source Graph Representation of the Movie Domain for Recommendation Dialogues Analysis","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-user-and-item-reviews-in-deep","title":"Integrating User and Item Reviews in Deep Cooperative Neural Networks for Movie Recommendation","date":"2022-05-12","arxiv_id":"2205.06296","repositories_listed":0,"syntology":null},{"url":null,"slug":"construction-of-hierarchical-structured","title":"Construction of Hierarchical Structured Knowledge-based Recommendation Dialogue Dataset and Dialogue System","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"moviemat-context-aware-movie-recommendation","title":"MovieMat: Context-aware Movie Recommendation with Matrix Factorization by Matrix Fitting","date":"2022-04-27","arxiv_id":"2204.13003","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-data-based-trailer-inception","title":"Edge Data Based Trailer Inception Probabilistic Matrix Factorization for Context-Aware Movie Recommendation","date":"2022-02-16","arxiv_id":"2202.10236","repositories_listed":0,"syntology":null},{"url":null,"slug":"vrconvmf-visual-recurrent-convolutional","title":"VRConvMF: Visual Recurrent Convolutional Matrix Factorization for Movie Recommendation","date":"2022-02-16","arxiv_id":"2202.10241","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-partial-monotonicity-in-submodular","title":"Using Partial Monotonicity in Submodular Maximization","date":"2022-02-07","arxiv_id":"2202.03051","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-item-recommendation-in-the-moba","title":"Sequential Item Recommendation in the MOBA Game Dota 2","date":"2022-01-17","arxiv_id":"2201.08724","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-movie-recommendation-system","title":"Comprehensive Movie Recommendation System","date":"2021-12-23","arxiv_id":"2112.12463","repositories_listed":0,"syntology":null},{"url":null,"slug":"transferability-properties-of-graph-neural","title":"Transferability Properties of Graph Neural Networks","date":"2021-12-09","arxiv_id":"2112.04629","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-data-teaching-strategies-via","title":"Learning Data Teaching Strategies Via Knowledge Tracing","date":"2021-11-13","arxiv_id":"2111.07083","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-end-to-end-training-improves","title":"Multi-Task End-to-End Training Improves Conversational Recommendation","date":"2021-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"language-models-as-recommender-systems","title":"Language Models as Recommender Systems: Evaluations and Limitations","date":"2021-09-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"wide-and-deep-graph-neural-network-with","title":"Wide and Deep Graph Neural Network with Distributed Online Learning","date":"2021-07-19","arxiv_id":"2107.09203","repositories_listed":0,"syntology":null},{"url":null,"slug":"thematic-recommendations-on-knowledge-graphs","title":"Thematic recommendations on knowledge graphs using multilayer networks","date":"2021-05-12","arxiv_id":"2105.05733","repositories_listed":0,"syntology":null},{"url":null,"slug":"deux-an-attribute-guided-framework-for","title":"DEUX: An Attribute-Guided Framework for Sociable Recommendation Dialog Systems","date":"2021-04-16","arxiv_id":"2105.00825","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-subsampling-in-submodular","title":"The Power of Subsampling in Submodular Maximization","date":"2021-04-06","arxiv_id":"2104.02772","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-bandit-algorithms-with-sublinear-time","title":"Linear Bandit Algorithms with Sublinear Time Complexity","date":"2021-03-03","arxiv_id":"2103.02729","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-and-utilizing-user-s-internal-state","title":"Modeling and Utilizing User's Internal State in Movie Recommendation Dialogue","date":"2020-12-05","arxiv_id":"2012.03118","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-and-graphon-neural-network-stability","title":"Graph and graphon neural network stability","date":"2020-10-23","arxiv_id":"2010.12529","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-monotone-submodular-maximization","title":"Submodular Maximization in Clean Linear Time","date":"2020-06-16","arxiv_id":"2006.09327","repositories_listed":0,"syntology":null},{"url":null,"slug":"i-know-why-you-like-this-movie-interpretable","title":"I know why you like this movie: Interpretable Efficient Multimodal Recommender","date":"2020-06-09","arxiv_id":"2006.09979","repositories_listed":0,"syntology":null},{"url":null,"slug":"thompson-sampling-for-combinatorial-semi-2","title":"Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints","date":"2020-05-14","arxiv_id":"2005.06725","repositories_listed":0,"syntology":null},{"url":null,"slug":"anchor-transform-learning-sparse-1","title":"Anchor & Transform: Learning Sparse Embeddings for Large Vocabularies","date":"2020-03-18","arxiv_id":"2003.08197","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-maximization-through-barrier","title":"Submodular Maximization Through Barrier Functions","date":"2020-02-10","arxiv_id":"2002.03523","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-long-and-short-term-information-in-1","title":"Leveraging Long and Short-Term Information in Content-Aware Movie Recommendation via Adversarial Training","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-submodular-maximization-under-a-k-1","title":"Streaming Submodular Maximization under a k-Set System Constraint","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-of-graph-neural-networks-to","title":"Stability of Graph Neural Networks to Relative Perturbations","date":"2019-10-21","arxiv_id":"1910.09655","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-processing-via-lda-topic","title":"Natural Language Processing via LDA Topic Model in Recommendation Systems","date":"2019-09-20","arxiv_id":"1909.09551","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-forgetful-novelty-seeking-movie","title":"A Deep, Forgetful Novelty-Seeking Movie Recommender Model","date":"2019-09-02","arxiv_id":"1909.01811","repositories_listed":0,"syntology":null},{"url":null,"slug":"190600365","title":"User Profile Feature-Based Approach to Address the Cold Start Problem in Collaborative Filtering for Personalized Movie Recommendation","date":"2019-06-02","arxiv_id":"1906.00365","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-collaborative-filtering-with","title":"Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization","date":"2019-05-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-meets-hybrid-a-synthetic-approach","title":"Transfer Meets Hybrid: A Synthetic Approach for Cross-Domain Collaborative Filtering with Text","date":"2019-01-22","arxiv_id":"1901.07199","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fairness-aware-hybrid-recommender-system","title":"A Fairness-aware Hybrid Recommender System","date":"2018-09-13","arxiv_id":"1809.09030","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-empirical-bayes-with-reversible-jump","title":"A novel Empirical Bayes with Reversible Jump Markov Chain in User-Movie Recommendation system","date":"2018-08-15","arxiv_id":"1808.05480","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-long-and-short-term-information-in","title":"Leveraging Long and Short-term Information in Content-aware Movie Recommendation","date":"2018-06-26","arxiv_id":"1712.09059","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-submodular-bandit","title":"Interactive Submodular Bandit","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensors-learning-and-kolmogorov-extension-for","title":"Tensors, Learning, and 'Kolmogorov Extension' for Finite-alphabet Random Vectors","date":"2017-12-01","arxiv_id":"1712.00205","repositories_listed":0,"syntology":null}],"syntology_records":5,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/task/movie-recommendation/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":2,"url":"/task/movie-recommendation/papers/2","json":"/task/movie-recommendation/papers/2.json","rows":13},{"order":"ran","page":1,"of":1,"url":"/task/movie-recommendation/papers/ran/1","json":"/task/movie-recommendation/papers/ran/1.json","rows":5}],"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":"c640ef354e9da80e6ebc7590af9a835e16cd56afe1c7352cc58a0c63ca665066","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}