The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Position Bias Estimation for Unbiased Learning to Rank in Personal Search
Open accessAbstract
A well-known challenge in learning from click data is its inherent bias and most notably position bias. Traditional click models aim to extract the ‹query, document› relevance and the estimated bias is usually discarded after relevance is extracted. In contrast, the most recent work on unbiased learning-to-rank can effectively leverage the bias and thus focuses on estimating bias rather than relevance [20, 31]. Existing approaches use search result randomization over a small percentage of production traffic to estimate the position bias. This is not desired because result randomization can negatively impact users' search experience. In this paper, we compare different schemes for result randomization (i.e., RandTopN and RandPair) and show their negative effect in personal search. Then we study how to infer such bias from regular click data without relying on randomization. We propose a regression-based Expectation-Maximization (EM) algorithm that is based on a position bias click model and that can handle highly sparse clicks in personal search. We evaluate our EM algorithm and the extracted bias in the learning-to-rank setting. Our results show that it is promising to extract position bias from regular clicks without result randomization. The extracted bias can improve the learning-to-rank algorithms significantly. In addition, we compare the pointwise and pairwise learning-to-rank models. Our results show that pairwise models are more effective in leveraging the estimated bias.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
The central role of the propensity score in observational studies for causal effects
ROSENBAUM, P. R., & RUBIN, D. B. (1983) · Biometrika · doi:10.1093/biomet/70.1.41 · Cited by 31,241
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Accurately interpreting clickthrough data as implicit feedback
Joachims, T., Granka, L., Pan, B., Hembrooke, H., & Gay, G. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076063 · Cited by 1,408
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
From RankNet to LambdaRank to LambdaMART: An Overview
Burges, C. J. C. (2010) · Cited by 1,011
Recommendations as Treatments: Debiasing Learning and EvaluationPreprint
Schnabel, T., Swaminathan, A., Singh, A., Chandak, N., & Joachims, T. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.05352 · Cited by 950
An experimental comparison of click position-bias models
Craswell, N., Zoeter, O., Taylor, M., & Ramsey, B. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341545 · Cited by 942
Stuff I've Seen: A System for Personal Information Retrieval and Re-Use
Dumais, S., Cutrell, E., Cadiz, J. J., Jancke, G., Sarin, R., & Robbins, D. C. (2016) · ACM SIGIR Forum · doi:10.1145/2888422.2888425 · Cited by 691
A dynamic bayesian network click model for web search ranking
Chapelle, O., & Zhang, Y. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526711 · Cited by 537
Unbiased Learning-to-Rank with Biased Feedback
Joachims, T., Swaminathan, A., & Schnabel, T. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018699 · Cited by 531 · cited 10×
“Among them, the position bias has a strong influence on users’ clicks [20].”
BackgroundMethodInfluentialUnbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Li, L., Chu, W., Langford, J., & Wang, X. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935878 · Cited by 443
Self-citationA user browsing model to predict search engine click data from past observations.
Dupret, G. E., & Piwowarski, B. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390392 · Cited by 442
Chuklin, A., Markov, I., & de Rijke, M. (2015) · Synthesis Lectures on Information Concepts, Retrieval, and Services · doi:10.1007/978-3-031-02294-4 · Cited by 398
Stuff I've seen: a system for personal information retrieval and re-use
Dumais, S., Cutrell, E., Cadiz, J., Jancke, G., Sarin, R., & Robbins, D. C. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860451 · Cited by 381
Doubly Robust Policy Evaluation and Learning
Dudı́k, M., Langford, J. C., & Li, L. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.4601 · Cited by 375
Learning to Rank with Selection Bias in Personal Search
Wang, X., Bendersky, M., Metzler, D., & Najork, M. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911537 · Cited by 284
Self-citationClick chain model in web search
Guo, F., Liu, C., Kannan, A., Minka, T., Taylor, M., Wang, Y.-M., & Faloutsos, C. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526712 · Cited by 219
Batch learning from logged bandit feedback through counterfactual risk minimization
Swaminathan, A., & Joachims, T. (2015) · Journal of Machine Learning Research · Cited by 193
Yue, Y., Patel, R., & Roehrig, H. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772793 · Cited by 186
Kamvar, M., Kellar, M., Patel, R., & Xu, Y. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526817 · Cited by 182
Batch learning from logged bandit feedback through counterfactual risk minimization
SwaminathanAdith, & JoachimsThorsten (2015) · Journal of Machine Learning Research · doi:10.5555/2789272.2886805 · Cited by 110
A novel click model and its applications to online advertising
Allen-Zhu, Z., Chen, W., Minka, T., Zhu, C., & Chen, Z. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718528 · Cited by 102
Counterfactual Estimation and Optimization of Click Metrics in Search Engines
Li, L., Chen, S., Kleban, J., & Gupta, A. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2740908.2742562 · Cited by 82
Situational Context for Ranking in Personal Search
Zamani, H., Bendersky, M., Wang, X., & Zhang, M. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052648 · Cited by 66
Self-citationCharacterizing Email Search using Large-scale Behavioral Logs and Surveys
Ai, Q., Dumais, S., Craswell, N., & Liebling, D. J. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052615 · Cited by 61
Effective Evaluation Using Logged Bandit Feedback from Multiple Loggers
Agarwal, A., Basu, S., Schnabel, T., & Joachims, T. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098155 · Cited by 60
Understanding re-finding behavior in naturalistic email interaction logs
Elsweiler, D., Harvey, M., & Häcker, M. (2011) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2009916.2009925 · Cited by 44
Learning from User Interactions in Personal Search via Attribute Parameterization
Bendersky, M., Wang, X., Metzler, D., & Najork, M. (2017) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3018661.3018712 · Cited by 44
Self-citationAn Introduction to Click Models for Web Search: SIGIR 2015 Tutorial
Chuklin, A., Markov, I., & de Rijke, M. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767881 · Cited by 40
Keane, M. T., & O’Brien, M. (2006) · eScholarship (California Digital Library) · Cited by 32
A Whole Page Click Model to Better Interpret Search Engine Click Data
Chen, W., Ji, Z., Shen, S., & Yang, Q. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.8084 · Cited by 20
Understanding and Modeling Success in Email Search
Kim, J. Y., Craswell, N., Dumais, S., Radlinski, F., & Liu, F. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080837 · Cited by 17
Cited by
Deep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
“(iii) This approach may build upon well-established ranking techniques and theories from areas like learning to rank [85, 87, 158].”
BackgroundJudging LLM-as-a-Judge with MT-Bench and Chatbot Arena
Zheng, L., Chiang, W.-L., Sheng, Y., Zhuang, S., Wu, Z., Zhuang, Y., Lin, Z., Li, Z., Li, D., Xing, E. P., et al. (2023) · arXiv · doi:10.48550/arxiv.2306.05685 · Cited by 1,888
“This bias is not unique to our context and has been seen in human decision-making [3, 29] and other ML domains [18, 35].”
BackgroundBias and Debias in Recommender System: A Survey and Future Directions
Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023) · ACM Transactions on Information Systems · doi:10.1145/3564284 · Cited by 741
Self-citationUnbiased 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
Metadata
- Authors
- Wang, X., Golbandi, N., Bendersky, M., Metzler, D., & Najork, M.
- Venue
- Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining
- Publisher
- ACM
- Published
- 2018-02-02
- Pages
- 610-618
- OpenAlex
- W2769473018
- Cited by
- 268
- References
- 36
- FWCI
- 25.11
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.