{"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":"/paper/adversarial-personalized-ranking-for","title":"Adversarial Personalized Ranking for Recommendation","arxiv_id":"1808.03908","date":"2018-08-12","proceeding":null,"authors":["Xiangnan He","Zhankui He","Xiaoyu Du","Tat-Seng Chua"],"abstract":"Item recommendation is a personalized ranking task. To this end, many\nrecommender systems optimize models with pairwise ranking objectives, such as\nthe Bayesian Personalized Ranking (BPR). Using matrix Factorization (MF) ---\nthe most widely used model in recommendation --- as a demonstration, we show\nthat optimizing it with BPR leads to a recommender model that is not robust. In\nparticular, we find that the resultant model is highly vulnerable to\nadversarial perturbations on its model parameters, which implies the possibly\nlarge error in generalization.\n  To enhance the robustness of a recommender model and thus improve its\ngeneralization performance, we propose a new optimization framework, namely\nAdversarial Personalized Ranking (APR). In short, our APR enhances the pairwise\nranking method BPR by performing adversarial training. It can be interpreted as\nplaying a minimax game, where the minimization of the BPR objective function\nmeanwhile defends an adversary, which adds adversarial perturbations on model\nparameters to maximize the BPR objective function. To illustrate how it works,\nwe implement APR on MF by adding adversarial perturbations on the embedding\nvectors of users and items. Extensive experiments on three public real-world\ndatasets demonstrate the effectiveness of APR --- by optimizing MF with APR, it\noutperforms BPR with a relative improvement of 11.2% on average and achieves\nstate-of-the-art performance for item recommendation. Our implementation is\navailable at: https://github.com/hexiangnan/adversarial_personalized_ranking.","url_abs":"http://arxiv.org/abs/1808.03908v1","url_pdf":"http://arxiv.org/pdf/1808.03908v1.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":"adversarial-personalized-ranking-for","repo_url":"https://github.com/hexiangnan/adversarial_personalized_ranking","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"hexiangnan/adversarial_personalized_ranking","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"928f016262de04ed107712bf893c30ede06d4e2e3e6b8f01a9b29d02d279f715","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}