The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Causal embeddings for recommendation
Open accessAbstract
Many current applications use recommendations in order to modify the natural user behavior, such as to increase the number of sales or the time spent on a website. This results in a gap between the final recommendation objective and the classical setup where recommendation candidates are evaluated by their coherence with past user behavior, by predicting either the missing entries in the user-item matrix, or the most likely next event. To bridge this gap, we optimize a recommendation policy for the task of increasing the desired outcome versus the organic user behavior. We show this is equivalent to learning to predict recommendation outcomes under a fully random recommendation policy. To this end, we propose a new domain adaptation algorithm that learns from logged data containing outcomes from a biased recommendation policy and predicts recommendation outcomes according to random exposure. We compare our method against state-of-the-art factorization methods, in addition to new approaches of causal recommendation and show significant improvements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Estimating causal effects of treatments in randomized and nonrandomized studies
Rubin, D. B. (1974) · Journal of Educational Psychology · doi:10.1037/h0037350 · Cited by 9,436
Learning Representations for Counterfactual Inference
Johansson, F. D., Shalit, U., & Sontag, D. (2016) · arXiv · doi:10.48550/arxiv.1605.03661 · Cited by 396
Cited by
Yao, L., Chu, Z., Li, S., Li, Y., Gao, J., & Zhang, A. (2021) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3444944 · Cited by 478
Causal Intervention for Leveraging Popularity Bias in Recommendation
Zhang, Y., Feng, F., He, X., Wei, T., Song, C., Ling, G., & Zhang, Y. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462875 · Cited by 443
Disentangling User Interest and Conformity for Recommendation with Causal Embedding
Zheng, Y., Gao, C., Li, X., He, X., Li, Y., & Jin, D. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449788 · Cited by 356
“Data Preprocessing In order tomeasure the performance of causal learning under non-IID circumstances, intervened test sets are needed, and thus all datasets are transformed following the standard protocol introduced in related literatures [9, 30].”
BackgroundMethodInfluentialUnbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback
Saito, Y., Yaginuma, S., Nishino, Y., Sakata, H., & Nakata, K. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371783 · Cited by 295
Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System
Wei, T., Feng, F., Chen, J., Wu, Z., Yi, J., & He, X. (2021) · Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining · doi:10.1145/3447548.3467289 · Cited by 274
Metadata
- Authors
- Bonner, S., & Vasile, F.
- Venue
- Proceedings of the 12th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2018-09-27
- Pages
- 104-112
- OpenAlex
- W2629213068
- Cited by
- 234
- References
- 2
- FWCI
- 9.57
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Causal embeddings for recommendation. https://app.cochat.ai/papers/10.1145/3240323.3240360
- The paper
- Bonner, S., & Vasile, F. (2018). Causal embeddings for recommendation. Proceedings of the 12th ACM Conference on Recommender Systems. https://doi.org/10.1145/3240323.3240360
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.