{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PII5Q5WV6SLT4E5T25LCZRGA2A","short_pith_number":"pith:PII5Q5WV","schema_version":"1.0","canonical_sha256":"7a11d876d5f4973e13b3d7562cc4c0d024ea0678b23167d1feb3501d273c707a","source":{"kind":"arxiv","id":"1205.2618","version":1},"attestation_state":"computed","paper":{"title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bayesian Personalized Ranking derives an optimization criterion that directly targets ranking from implicit feedback.","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Christoph Freudenthaler, Lars Schmidt-Thieme, Steffen Rendle, Zeno Gantner","submitted_at":"2012-05-09T18:25:09Z","abstract_excerpt":"Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this paper, we investigate the most common scenario with implicit feedback (e.g. clicks, purchases). There are many methods for item recommendation from implicit feedback like matrix factorization (MF) or adaptive knearest-neighbor (kNN). Even though these methods are designed for the item prediction task of personalized ranking, none of them is directly optimized for ranking. In this paper we present a generic optimization criterion BPR-Opt for personalized ranking that"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"1205.2618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-09T18:25:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a2ae5ee8235f28fc19ef50476f72eb3c83c25f5b36bb5546e91b38660f177512","abstract_canon_sha256":"892b0d523a721ff71fc0c2bb6c9327782bb694b8845a702c7f431065a4578439"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.887260Z","signature_b64":"4w/Q/bjqxMAFcY5Y0G1sghsyhsRFNMvX6wIZUHVm/PDu+zdSOcX9QqoVIGl0paiQmUILNkZgcFpKg+IvdZ1SBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a11d876d5f4973e13b3d7562cc4c0d024ea0678b23167d1feb3501d273c707a","last_reissued_at":"2026-05-18T03:55:47.886750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.886750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bayesian Personalized Ranking derives an optimization criterion that directly targets ranking from implicit feedback.","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Christoph Freudenthaler, Lars Schmidt-Thieme, Steffen Rendle, Zeno Gantner","submitted_at":"2012-05-09T18:25:09Z","abstract_excerpt":"Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this paper, we investigate the most common scenario with implicit feedback (e.g. clicks, purchases). There are many methods for item recommendation from implicit feedback like matrix factorization (MF) or adaptive knearest-neighbor (kNN). Even though these methods are designed for the item prediction task of personalized ranking, none of them is directly optimized for ranking. In this paper we present a generic optimization criterion BPR-Opt for personalized ranking that"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our experiments indicate that for the task of personalized ranking our optimization method outperforms the standard learning techniques for MF and kNN.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that maximizing the BPR-Opt posterior (derived from a Bayesian analysis of pairwise preferences) produces better ranking performance than standard losses when applied to matrix factorization and kNN models.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"BPR-Opt is a maximum posterior estimator for personalized ranking from implicit feedback that, when used to train matrix factorization and adaptive kNN, outperforms standard learning techniques on ranking tasks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bayesian Personalized Ranking derives an optimization criterion that directly targets ranking from implicit feedback.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1fade7c78a7a13333bbfe52711a515728b063f294de5b9ddff19d9e122b420fc"},"source":{"id":"1205.2618","kind":"arxiv","version":1},"verdict":{"id":"11bcfaf3-975b-4df5-8f6c-1fe2fb34c349","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T22:59:32.218731Z","strongest_claim":"Our experiments indicate that for the task of personalized ranking our optimization method outperforms the standard learning techniques for MF and kNN.","one_line_summary":"BPR-Opt is a maximum posterior estimator for personalized ranking from implicit feedback that, when used to train matrix factorization and adaptive kNN, outperforms standard learning techniques on ranking tasks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that maximizing the BPR-Opt posterior (derived from a Bayesian analysis of pairwise preferences) produces better ranking performance than standard losses when applied to matrix factorization and kNN models.","pith_extraction_headline":"Bayesian Personalized Ranking derives an optimization criterion that directly targets ranking from implicit feedback."},"references":{"count":15,"sample":[{"doi":"","year":2005,"title":"C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learn- ing to rank using gradient descent. In ICML ’05: Proceedings of the 22nd international con- ference on Mach","work_id":"d027aa54-31c9-4eeb-8152-9d36137b5e05","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"M. Deshpande and G. Karypis. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems. Springer-Verlag , 22/1, 2004","work_id":"ece2b173-a33f-480e-9292-3e6fe0740d3a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"A. Herschtal and B. Raskutti. Optimising area under the roc curve using gradient descent. In ICML ’04: Proceedings of the twenty-first inter- national conference on Machine learning, page 49, New York,","work_id":"16241d65-2ae4-49a1-a313-d9aebc422590","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"T. Hofmann. Latent semantic models for collabo- rative filtering. ACM Trans. Inf. Syst. , 22(1):89– 115, 2004","work_id":"30cb0301-626d-4e11-8402-99f2239c3cf6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In IEEE International Conference on Data Mining (ICDM 2008), pages 263–272, 2008","work_id":"9e666f2d-7918-4a97-89ba-fd0fb71ea901","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"e84876f435cf0296916d908c4a2ced6cd66a1d998113a001750031c130ceb9eb","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"9fd969aed509e5fd2f0c5f4adec5bf6488d5ed4653ac8733824a800633680c21"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.2618","created_at":"2026-05-18T03:55:47.886833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2618v1","created_at":"2026-05-18T03:55:47.886833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2618","created_at":"2026-05-18T03:55:47.886833+00:00"},{"alias_kind":"pith_short_12","alias_value":"PII5Q5WV6SLT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PII5Q5WV6SLT4E5T","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PII5Q5WV","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":35,"internal_anchor_count":35,"sample":[{"citing_arxiv_id":"2508.13663","citing_title":"Interactive Query Answering on Knowledge Graphs with Soft Entity Constraints","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22924","citing_title":"Building a privacy-preserving Federated Recommender system for mobile devices","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2410.15272","citing_title":"Performance-Driven QUBO for Recommender Systems on Quantum Annealers","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11502","citing_title":"All-domain Moveline Evolution Network for Click-Through Rate Prediction","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2412.18735","citing_title":"Automatic Self-supervised Learning for Social Recommendations","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2502.15699","citing_title":"Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20721","citing_title":"Robust Recommendation from Noisy Implicit Feedback: A GMM-Weighted Bayes-label Transition Matrix Framework","ref_index":60,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15721","citing_title":"Contexting as Recommendation: Evolutionary Collaborative Filtering for Context Engineering","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19651","citing_title":"Divergence Meets Consensus: A Multi-Source Negative Sampling Framework for Sequential Recommendation","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15203","citing_title":"Agent4POI: Agentic Context-Conditioned Affordance Reasoning for Multimodal Point-of-Interest Recommendation","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2507.21563","citing_title":"VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2511.19176","citing_title":"From Raw Features to Effective Embeddings: A Three-Stage Approach for Multimodal Recipe Recommendation","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2512.14047","citing_title":"AsarRec: Adaptive Sequential Augmentation for Robust Self-supervised Sequential Recommendation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2602.12606","citing_title":"RelBench v2: A Large-Scale Benchmark and Repository for Relational Data","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02183","citing_title":"TRU: Targeted Reverse Update for Efficient Multimodal Recommendation Unlearning","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03014","citing_title":"User-Aware Conditional Generative Total Correlation Learning for Multi-Modal Recommendation","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03654","citing_title":"Joint Behavior-guided and Modality-coherence Conditional Graph Diffusion Denoising for Multi Modal Recommendation","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11145","citing_title":"Debiasing Message Passing to Mitigate Popularity Bias in GNN-based Collaborative Filtering","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26247","citing_title":"TimeMM: Time-as-Operator Spectral Filtering for Dynamic Multimodal Recommendation","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08666","citing_title":"The Cancellation Hypothesis in Critic-Free RL: From Outcome Rewards to Token Credits","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08499","citing_title":"Multi-Level Graph Attention Network Contrastive Learning for Knowledge-Aware Recommendation","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25732","citing_title":"Personalized Multi-Interest Modeling for Cross-Domain Recommendation to Cold-Start Users","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25577","citing_title":"The Attention Market: Interpreting Online Fair Re-ranking as Manifold Optimization under Walrasian Equilibrium","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2604.22504","citing_title":"Objective Shaping with Hard Negatives: Windowed Partial AUC Optimization for RL-based LLM Recommenders","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04723","citing_title":"Rethinking Convolutional Networks for Attribute-Aware Sequential Recommendation","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A","json":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A.json","graph_json":"https://pith.science/api/pith-number/PII5Q5WV6SLT4E5T25LCZRGA2A/graph.json","events_json":"https://pith.science/api/pith-number/PII5Q5WV6SLT4E5T25LCZRGA2A/events.json","paper":"https://pith.science/paper/PII5Q5WV"},"agent_actions":{"view_html":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A","download_json":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A.json","view_paper":"https://pith.science/paper/PII5Q5WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2618&json=true","fetch_graph":"https://pith.science/api/pith-number/PII5Q5WV6SLT4E5T25LCZRGA2A/graph.json","fetch_events":"https://pith.science/api/pith-number/PII5Q5WV6SLT4E5T25LCZRGA2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A/action/storage_attestation","attest_author":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A/action/author_attestation","sign_citation":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A/action/citation_signature","submit_replication":"https://pith.science/pith/PII5Q5WV6SLT4E5T25LCZRGA2A/action/replication_record"}},"created_at":"2026-05-18T03:55:47.886833+00:00","updated_at":"2026-05-18T03:55:47.886833+00:00"}