{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":29,"of":29,"tagged_in_all":113,"items":[{"url":"/paper/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","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","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","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","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_unverified":3,"n_pointer_only":4}},{"url":"/paper/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","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","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","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","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","title":"On Generative Agents in Recommendation","date":"2023-10-16","arxiv_id":"2310.10108","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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","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","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","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","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","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","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","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","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_unverified":1,"n_pointer_only":5}},{"url":"/paper/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_unverified":1,"n_pointer_only":3}},{"url":"/paper/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_unverified":2,"n_pointer_only":3}},{"url":"/paper/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","title":"Movie Recommendation System using Sentiment Analysis from Microblogging Data","date":"2018-11-27","arxiv_id":"1811.10804","repositories_listed":1,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}