{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/setrank-a-setwise-bayesian-approach-for","title":"SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback","arxiv_id":"2002.09841","date":"2020-02-23","proceeding":null,"authors":["Chao Wang","HengShu Zhu","Chen Zhu","Chuan Qin","Hui Xiong"],"abstract":"The recent development of online recommender systems has a focus on collaborative ranking from implicit feedback, such as user clicks and purchases. Different from explicit ratings, which reflect graded user preferences, the implicit feedback only generates positive and unobserved labels. While considerable efforts have been made in this direction, the well-known pairwise and listwise approaches have still been limited by various challenges. Specifically, for the pairwise approaches, the assumption of independent pairwise preference is not always held in practice. Also, the listwise approaches cannot efficiently accommodate \"ties\" due to the precondition of the entire list permutation. To this end, in this paper, we propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to inherently accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons and can be implemented with matrix factorization and neural networks. Meanwhile, we also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $\\sqrt{M/N}$, where $M$ and $N$ are the numbers of items and users, respectively. Finally, extensive experiments on four real-world datasets clearly validate the superiority of SetRank compared with various state-of-the-art baselines.","url_abs":"https://arxiv.org/abs/2002.09841v1","url_pdf":"https://arxiv.org/pdf/2002.09841v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"setrank-a-setwise-bayesian-approach-for","repo_url":"https://github.com/chadwang2012/SetRank","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"collaborative-ranking","task_name":"Collaborative Ranking"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.09841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09841"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/chadwang2012/SetRank","reach":null}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"360be7356cb2129b","entry":"DataSet","repo":"chadwang2012/SetRank","repo_kind":"official","path":"sparse-Deep-SetRank.py","file_url":"https://github.com/chadwang2012/SetRank/blob/HEAD/sparse-Deep-SetRank.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"360be7356cb2129b"}},{"code_sha256_prefix":"b64210f41455e8b5","entry":"Model","repo":"chadwang2012/SetRank","repo_kind":"official","path":"sparse-Deep-SetRank.py","file_url":"https://github.com/chadwang2012/SetRank/blob/HEAD/sparse-Deep-SetRank.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b64210f41455e8b5"}},{"code_sha256_prefix":"6224fad646592bac","entry":"sparse_dropout","repo":"chadwang2012/SetRank","repo_kind":"official","path":"sparse-Deep-SetRank.py","file_url":"https://github.com/chadwang2012/SetRank/blob/HEAD/sparse-Deep-SetRank.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6224fad646592bac"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}