{"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/relevance-matrix-factorization","title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","arxiv_id":"1909.03601","date":"2019-09-09","proceeding":null,"authors":["Yuta Saito","Suguru Yaginuma","Yuta Nishino","Hayato Sakata","Kazuhide Nakata"],"abstract":"Recommender systems widely use implicit feedback such as click data because of its general availability. Although the presence of clicks signals the users' preference to some extent, the lack of such clicks does not necessarily indicate a negative response from the users, as it is possible that the users were not exposed to the items (positive-unlabeled problem). This leads to a difficulty in predicting the users' preferences from implicit feedback. Previous studies addressed the positive-unlabeled problem by uniformly upweighting the loss for the positive feedback data or estimating the confidence of each data having relevance information via the EM-algorithm. However, these methods failed to address the missing-not-at-random problem in which popular or frequently recommended items are more likely to be clicked than other items even if a user does not have a considerable interest in them. To overcome these limitations, we first define an ideal loss function to be optimized to realize recommendations that maximize the relevance and propose an unbiased estimator for the ideal loss. Subsequently, we analyze the variance of the proposed unbiased estimator and further propose a clipped estimator that includes the unbiased estimator as a special case. We demonstrate that the clipped estimator is expected to improve the performance of the recommender system, by considering the bias-variance trade-off. We conduct semi-synthetic and real-world experiments and demonstrate that the proposed method largely outperforms the baselines. In particular, the proposed method works better for rare items that are less frequently observed in the training data. The findings indicate that the proposed method can better achieve the objective of recommending items with the highest relevance.","url_abs":"https://arxiv.org/abs/1909.03601v3","url_pdf":"https://arxiv.org/pdf/1909.03601v3.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":"relevance-matrix-factorization","repo_url":"https://github.com/usaito/unbiased-implicit-rec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"relevance-matrix-factorization","repo_url":"https://github.com/usaito/unbiased-implicit-rec-real","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"causal-inference","task_name":"Causal Inference"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1909.03601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03601"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/usaito/unbiased-implicit-rec-real","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/usaito/unbiased-implicit-rec","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":13},"by_repo_kind":{"official":{"samples":13,"ran":0,"repositories":2}},"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":0,"samples":[{"code_sha256_prefix":"7975cad450f46fde","entry":"a_row_batch","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/models/expomf.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/models/expomf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"7975cad450f46fde"}},{"code_sha256_prefix":"e91e3631a47d3246","entry":"average_precision_at_k","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"e91e3631a47d3246"}},{"code_sha256_prefix":"d45b396101abb598","entry":"average_precision_at_k","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/evaluate/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/evaluate/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d45b396101abb598"}},{"code_sha256_prefix":"d7a1c19d49666f27","entry":"dcg_at_k","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d7a1c19d49666f27"}},{"code_sha256_prefix":"5c67f0bf32203ff5","entry":"dcg_at_k","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/evaluate/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/evaluate/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"5c67f0bf32203ff5"}},{"code_sha256_prefix":"9be5e439e2a3c849","entry":"generate_sys_data","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/data_generator.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/data_generator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"9be5e439e2a3c849"}},{"code_sha256_prefix":"6119496ab503be16","entry":"get_row","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/models/expomf.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/models/expomf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"6119496ab503be16"}},{"code_sha256_prefix":"bd43d52fb94a700e","entry":"load_movielens","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/data_generator.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/data_generator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"bd43d52fb94a700e"}},{"code_sha256_prefix":"67693b649c55a340","entry":"precision_at_k","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"67693b649c55a340"}},{"code_sha256_prefix":"e58bf635478c876d","entry":"recall_at_k","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/evaluate/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/evaluate/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"e58bf635478c876d"}},{"code_sha256_prefix":"1ec2f637ffe2951a","entry":"recompute_factors","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/models/expomf.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/models/expomf.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"1ec2f637ffe2951a"}},{"code_sha256_prefix":"ebaf172fd8f34860","entry":"sigmoid","repo":"usaito/unbiased-implicit-rec","repo_kind":"official","path":"src/utils/data_generator.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/data_generator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ebaf172fd8f34860"}},{"code_sha256_prefix":"193158bf5121b5b3","entry":"tocsr","repo":"usaito/unbiased-implicit-rec-real","repo_kind":"official","path":"src/trainer.py","file_url":"https://github.com/usaito/unbiased-implicit-rec-real/blob/HEAD/src/trainer.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"193158bf5121b5b3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}