Bias and debias in recommender system: A survey and future directions

J Chen, H Dong, X Wang, F Feng, M Wang… - ACM Transactions on …, 2023 - dl.acm.org
While recent years have witnessed a rapid growth of research papers on recommender
system (RS), most of the papers focus on inventing machine learning models to better fit …

DRN: A deep reinforcement learning framework for news recommendation

G Zheng, F Zhang, Z Zheng, Y **ang, NJ Yuan… - Proceedings of the …, 2018 - dl.acm.org
In this paper, we propose a novel Deep Reinforcement Learning framework for news
recommendation. Online personalized news recommendation is a highly challenging …

Unbiased learning-to-rank with biased feedback

T Joachims, A Swaminathan, T Schnabel - Proceedings of the tenth …, 2017 - dl.acm.org
Implicit feedback (eg, clicks, dwell times, etc.) is an abundant source of data in human-
interactive systems. While implicit feedback has many advantages (eg, it is inexpensive to …

[PDF][PDF] Batch learning from logged bandit feedback through counterfactual risk minimization

A Swaminathan, T Joachims - The Journal of Machine Learning Research, 2015 - jmlr.org
We develop a learning principle and an efficient algorithm for batch learning from logged
bandit feedback. This learning setting is ubiquitous in online systems (eg, ad placement …

[책][B] Click models for web search

A Chuklin, I Markov, M De Rijke - 2022 - books.google.com
With the rapid growth of web search in recent years the problem of modeling its users has
started to attract more and more attention of the information retrieval community. This has …

Counterfactual risk minimization: Learning from logged bandit feedback

A Swaminathan, T Joachims - International Conference on …, 2015 - proceedings.mlr.press
We develop a learning principle and an efficient algorithm for batch learning from logged
bandit feedback. This learning setting is ubiquitous in online systems (eg, ad placement …

Counterfactual estimation and optimization of click metrics in search engines: A case study

L Li, S Chen, J Kleban, A Gupta - … of the 24th International Conference on …, 2015 - dl.acm.org
Optimizing an interactive system against a predefined online metric is particularly
challenging, especially when the metric is computed from user feedback such as clicks and …

Efficient and effective tree-based and neural learning to rank

S Bruch, C Lucchese, FM Nardini - Foundations and Trends® …, 2023 - nowpublishers.com
As information retrieval researchers, we not only develop algorithmic solutions to hard
problems, but we also insist on a proper, multifaceted evaluation of ideas. The literature on …

Correcting for selection bias in learning-to-rank systems

Z Ovaisi, R Ahsan, Y Zhang, K Vasilaky… - Proceedings of The Web …, 2020 - dl.acm.org
Click data collected by modern recommendation systems are an important source of
observational data that can be utilized to train learning-to-rank (LTR) systems. However …

A survey of query auto completion in information retrieval

F Cai, M De Rijke - Foundations and Trends® in Information …, 2016 - nowpublishers.com
In information retrieval, query auto completion (QAC), also known as typeahead [**ao et al.,
2013, Cai et al., 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the …