Fetching the paper…
Reading the bibliography…
In most real-world recommender systems, the observed rating data are subject to selection bias, and the data are thus missing-not-at-random.
Estimating causal effects of treatments in randomized and nonrandomized studies
Donald B Rubin. 1974 · 1974
Earlier work this paper cites.
The central role of the propensity score in observational studies for causal effects
Paul R Rosenbaum and Donald B Rubin. 1983 · 1983
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding. 1994 · 1994
Earlier work this paper cites.
Cumulated gain-based evaluation of IR techniques
Kalervo Järvelin and Jaana Kekäläinen. 2002 · 2002
Earlier work this paper cites.
Analysis of representations for domain adaptation. In Advances in neural information processing systems . 137–144
Shai Ben-David, John Blitzer, Koby Crammer, and Fernando Pereira. 2007 · 2007
Earlier work this paper cites.
Learning classifiers from only positive and unlabeled data. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 213–220
Charles Elkan and Keith Noto. 2008 · 2008
Earlier work this paper cites.
Probabilistic matrix factorization. In Advances in neural information processing systems . 1257–1264
Andriy Mnih and Ruslan R Salakhutdinov. 2008 · 2008
Earlier work this paper cites.
Matrix factorization techniques for recommender systems
Yehuda Koren, Robert Bell, and Chris Volinsky. 2009 · 2009
Earlier work this paper cites.
Collaborative prediction and ranking with non-random missing data. In Proceedings of the third ACM conference on Recommender systems . ACM, 5–12
Benjamin M Marlin and Richard S Zemel. 2009 · 2009
Earlier work this paper cites.
A theory of learning from different domains
Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan. 2010 · 2010
Earlier work this paper cites.
Factorization machines. In 2010 IEEE International Conference on Data Mining . IEEE, 995–1000
Steffen Rendle. 2010 · 2010
Earlier work this paper cites.
Training and testing of recommender systems on data missing not at random. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 713–722
Harald Steck. 2010 · 2010
Earlier work this paper cites.
Doubly Robust Policy Evaluation and Learning
Miroslav Dudík, John Langford, and Lihong Li. 2011 · 2011
Earlier work this paper cites.
Ranking with non-random missing ratings: influence of popularity and positivity on evaluation metrics. In Proceedings of the sixth ACM conference on Recommender systems . ACM, 147–154
Bruno Pradel, Nicolas Usunier, and Patrick Gallinari. 2012 · 2012
Cited alongside, same era.
Probabilistic matrix factorization with non-random missing data. In International Conference on Machine Learning . 1512–1520
José Miguel Hernández-Lobato, Neil Houlsby, and Zoubin Ghahramani. 2014 · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba. 2014 · 2014
Cited alongside, same era.
Neural network matrix factorization
Gintare Karolina Dziugaite and Daniel M Roy. 2015 · 2015
Cited alongside, same era.
More Robust Doubly Robust Off-policy Evaluation. In International Conference on Machine Learning . 1446–1455
Mehrdad Farajtabar, Yinlam Chow, and Mohammad Ghavamzadeh. 2018 · 2018
Later among the works it cites.
Offline a/b testing for recommender systems. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining . ACM, 198–206
Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, and Simon Dollé. 2018 · 2018
Later among the works it cites.
Deep learning with logged bandit feedback
Thorsten Joachims, Adith Swaminathan, and Maarten de Rijke. 2018 · 2018
Later among the works it cites.
Unsupervised Domain Adaptation Based on Source-guided Discrepancy
Seiichi Kuroki, Nontawat Charonenphakdee, Han Bao, Junya Honda, Issei Sato, and Masashi Sugiyama. 2018 · 2018
Later among the works it cites.
Offline evaluation of ranking policies with click models. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 1685–1694
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Unsupervised Domain Adaptation by Backpropagation. In Proceedings of the 32nd International Conference on Machine Learning (Proceedings of Machine Learning Research) , Francis Bach and David Blei (Eds.), Vol. 37. PMLR, Lille, France, 1180–1189
Yaroslav Ganin and Victor Lempitsky. 2015 · 2015
Cited alongside, same era.
Causal inference in statistics, social, and biomedical sciences
Guido W Imbens and Donald B Rubin. 2015 · 2015
Cited alongside, same era.
Doubly Robust Off-policy Value Evaluation for Reinforcement Learning. In International Conference on Machine Learning . 652–661
Nan Jiang and Lihong Li. 2016 · 2016
Cited alongside, same era.
Recommendations as Treatments: Debiasing Learning and Evaluation. In Proceedings of The 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research) , Maria Florina Balcan and Kilian Q. Weinberger (Eds.), Vol. 48. PMLR, New York, New York, USA, 1670–1679
Tobias Schnabel, Adith Swaminathan, Ashudeep Singh, Navin Chandak, and Thorsten Joachims. 2016 · 2016
Cited alongside, same era.
Unbiased learning-to-rank with biased feedback. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining . ACM, 781–789
Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017 · 2017
Cited alongside, same era.
Asymmetric Tri-training for Unsupervised Domain Adaptation. In Proceedings of the 34th International Conference on Machine Learning (Proceedings of Machine Learning Research) , Doina Precup and Yee Whye Teh (Eds.), Vol. 70. PMLR, International Convention Centre, Sydney, Australia, 2988–2997
Kuniaki Saito, Yoshitaka Ushiku, and Tatsuya Harada. 2017 · 2017
Cited alongside, same era.
Optimal and adaptive off-policy evaluation in contextual bandits. In Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 3589–3597
Yu-Xiang Wang, Alekh Agarwal, and Miroslav Dudik. 2017 · 2017
Cited alongside, same era.
Learning optimal policies from observational data
Onur Atan, William R Zame, and Mihaela van der Schaar. 2018 · 2018
Cited alongside, same era.
Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S Muthukrishnan, Vishwa Vinay, and Zheng Wen. 2018 · 2018
Later among the works it cites.
The Deconfounded Recommender: A Causal Inference Approach to Recommendation
Yixin Wang, Dawen Liang, Laurent Charlin, and David M. Blei. 2018b · 2018
Later among the works it cites.
Unbiased Offline Recommender Evaluation for Missing-not-at-random Implicit Feedback. In Proceedings of the 12th ACM Conference on Recommender Systems (Vancouver, British Columbia, Canada) (RecSys ’18) . ACM, New York, NY, USA, 279–287
Longqi Yang, Yin Cui, Yuan Xuan, Chenyang Wang, Serge Belongie, and Deborah Estrin. 2018 · 2018
Later among the works it cites.
Optuna: A next-generation hyperparameter optimization framework. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 2623–2631
Takuya Akiba, Shotaro Sano, Toshihiko Yanase, Takeru Ohta, and Masanori Koyama. 2019 · 2019
Closest in time.
Domain Discrepancy Measure Using Complex Models in Unsupervised Domain Adaptation
Jongyeong Lee, Nontawat Charoenphakdee, Seiichi Kuroki, and Masashi Sugiyama. 2019 · 2019
Closest in time.
Doubly Robust Prediction and Evaluation Methods Improve Uplift Modeling for Observational Data. In Proceedings of the 2019 SIAM International Conference on Data Mining . SIAM, 468–476
Yuta Saito, Hayato Sakata, and Kazuhide Nakata. 2019 · 2019
Closest in time.
Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random. In International Conference on Machine Learning . 6638–6647
Xiaojie Wang, Rui Zhang, Yu Sun, and Jianzhong Qi. 2019 · 2019
Closest in time.
Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback. In Proceedings of the 13th International Conference on Web Search and Data Mining . 501–509
Yuta Saito, Suguru Yaginuma, Yuta Nishino, Hayato Sakata, and Kazuhide Nakata. 2020 · 2020
Closest in time.
Domain-adversarial training of neural networks
Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky. 2016 · 2030
Closest in time.