{"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/causal-embeddings-for-recommendation","title":"Causal Embeddings for Recommendation","arxiv_id":"1706.07639","date":"2017-06-23","proceeding":null,"authors":["Stephen Bonner","Flavian vasile"],"abstract":"Many current applications use recommendations in order to modify the natural\nuser behavior, such as to increase the number of sales or the time spent on a\nwebsite. This results in a gap between the final recommendation objective and\nthe classical setup where recommendation candidates are evaluated by their\ncoherence with past user behavior, by predicting either the missing entries in\nthe user-item matrix, or the most likely next event. To bridge this gap, we\noptimize a recommendation policy for the task of increasing the desired outcome\nversus the organic user behavior. We show this is equivalent to learning to\npredict recommendation outcomes under a fully random recommendation policy. To\nthis end, we propose a new domain adaptation algorithm that learns from logged\ndata containing outcomes from a biased recommendation policy and predicts\nrecommendation outcomes according to random exposure. We compare our method\nagainst state-of-the-art factorization methods and new approaches of causal\nrecommendation and show significant improvements.","url_abs":"http://arxiv.org/abs/1706.07639v5","url_pdf":"http://arxiv.org/pdf/1706.07639v5.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":"causal-embeddings-for-recommendation","repo_url":"https://github.com/criteo-research/CausE","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.07639","atlas_url":"https://app.syntology.ai/?focus=1706.07639","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1706.07639"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.07639\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.07639"},"call":"get_concepts_for_paper(arxiv_id=\"1706.07639\")"}],"by_repo":[{"repo":"criteo-research/CausE","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":"f8a4aa96a0822ba9aa4e135a9f9c57479e3bfda2064e5df92083ac0abe214014","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}