{"url":"/task/collaborative-ranking","name":"Collaborative Ranking","slug":"collaborative-ranking","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":25,"papers_with_code":8,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"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":8,"of":8,"tagged_in_all":25,"items":[{"url":"/paper/temporal-collaborative-ranking-via","title":"Temporal Collaborative Ranking Via Personalized Transformer","date":"2019-08-15","arxiv_id":"1908.05435","repositories_listed":3,"syntology":null},{"url":"/paper/shallow-deep-collaborative-learning-for","title":"Shallow-Deep Collaborative Learning for Unsupervised Visible-Infrared Person Re-Identification","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-explainable-1-bit-matrix","title":"Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning","date":"2021-05-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/advances-in-collaborative-filtering-and","title":"Advances in Collaborative Filtering and Ranking","date":"2020-02-27","arxiv_id":"2002.12312","repositories_listed":1,"syntology":null},{"url":"/paper/setrank-a-setwise-bayesian-approach-for","title":"SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback","date":"2020-02-23","arxiv_id":"2002.09841","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":3}},{"url":"/paper/sql-rank-a-listwise-approach-to-collaborative","title":"SQL-Rank: A Listwise Approach to Collaborative Ranking","date":"2018-02-28","arxiv_id":"1803.00114","repositories_listed":1,"syntology":null},{"url":"/paper/latent-relational-metric-learning-via-memory","title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","date":"2017-07-17","arxiv_id":"1707.05176","repositories_listed":1,"syntology":null},{"url":"/paper/preference-completion-large-scale","title":"Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons","date":"2015-07-16","arxiv_id":"1507.04457","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}}],"syntology_records":2,"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"}}