Reusing historical interaction data for faster online learning to rank for IR

WSDM 2013 - Proceedings of the 6th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2013, Pages 183-192

  Hofmann, Katja ^a   Schuth, Anne ^a   Whiteson, Shimon ^a   De Rijke, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

information retrieval; interleaved comparison; learning to rank

Indexed keywords

HISTORICAL DATA; INTERLEAVED COMPARISON; LARGE AMOUNTS; LEARNING TO RANK; ON-LINE PERFORMANCE; ONLINE LEARNING; PRE-SELECTION; RANKING FUNCTIONS; RETRIEVAL SYSTEMS; SELF-LEARNING; SPEED UP; USER FEEDBACK; USER INTERACTION; WEB SEARCHES;

DATA MINING; INFORMATION RETRIEVAL; SEARCH ENGINES; WEBSITES;

E-LEARNING;

EID: 84874275961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2433396.2433419     Document Type: Conference Paper

References (29)

1. D. Agarwal, B. Chen, P. Elango, N. Motgi, S. Park, R. Ramakrishnan, S. Roy, and J. Zachariah. Online models for content optimization. In NIPS'08, pages 17-24, 2008.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, May 2002. (Pubitemid 34126111)
3. A. G. Barto, R. S. Sutton, and P. S. Brouwer. Associative search network: A reinforcement learning associative memory. IEEE Trans. Syst., Man, and Cybern., 40:201-211, 1981.
4. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In ICML '05, pages 89-96, 2005.
5. O. Chapelle, T. Joachims, F. Radlinski, and Y. Yue. Large-scale validation and analysis of interleaved search evaluation. ACM Trans. Inf. Syst., 30(1):6:1-6:41, 2012.
6. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM '08, pages 87-94, 2008.
7. F. Graybill and R. Deal. Combining unbiased estimators. Biometrics, 15(4):543-550, 1959.
8. F. Guo, C. Liu, and Y. M. Wang. Efficient multiple-click models in web search. In WSDM '09, pages 124-131, 2009.
9. K. Hofmann, S. Whiteson, and M. de Rijke. A probabilistic method for inferring preferences from clicks. In CIKM '11, pages 249-258, 2011.
10. K. Hofmann, S. Whiteson, and M. de Rijke. Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval. Information Retrieval, 2012. doi: 10.1007/s10791-012-9197-9.
11. K. Hofmann, S. Whiteson, and M. de Rijke. Estimating interleaved comparison outcomes from historical click data. In CIKM '12, 2012.
12. K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst., 20(4):422-446, October 2002.
13. T. Joachims. Optimizing search engines using clickthrough data. In KDD '02, pages 133-142, 2002.
14. T. Joachims. Evaluating retrieval performance using clickthrough data. In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining, pages 79-96. Physica/Springer, 2003.
15. J. Langford, A. Strehl, and J. Wortman. Exploration scavenging. In ICML '08, pages 528-535, 2008.
16. L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In WWW '10, pages 661-670, 2010.
17. L. Li, W. Chu, J. Langford, and X. Wang. Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In WSDM '11, pages 297-306, 2011.
18. T. Y. Liu. Learning to rank for information retrieval. Found. and Trends in Inf. Retr., 3(3):225-331, 2009.
19. D. Precup, R. Sutton, and S. Singh. Eligibility traces for off-policy policy evaluation. In ICML'00, pages 759-766, 2000.
20. F. Radlinski and N. Craswell. Comparing the sensitivity of information retrieval metrics. In SIGIR '10, pages 667-674, 2010.
21. F. Radlinski, M. Kurup, and T. Joachims. How does clickthrough data reflect retrieval quality? In CIKM '08, pages 43-52, 2008.
22. M. Sanderson. Test collection based evaluation of information retrieval systems. Found. and Trends in Inf. Retr., 4(4):247-375, 2010.
23. D. Schuurmans. Greedy importance sampling. In NIPS '99, 1999.
24. A. Strehl, C. Mesterharm, M. Littman, and H. Hirsh. Experience-efficient learning in associative bandit problems. In ICML '06, pages 889-896, 2006.
25. R. S. Sutton and A. G. Barto. Reinforcement learning: An introduction. MIT Press, Cambridge, MA, USA, 1998.
26. M. Szummer and E. Yilmaz. Semi-supervised learning to rank with preference regularization. In CIKM '11, pages 269-278, 2011.
27. D. Xu, Y. Liu, M. Zhang, S. Ma, and L. Ru. Incorporating revisiting behaviors into click models. In WSDM '12, pages 303-312, 2012.
28. Y. Yue and T. Joachims. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML'09, pages 1201-1208, 2009.
29. Y. Yue, J. Broder, R. Kleinberg, and T. Joachims. The k-armed dueling bandits problem. Journal of Computer and System Sciences, 78(5):1538-1556, 2012.