Stable coactive learning via perturbation

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1874-1882

  Raman, Karthik ^a   Joachims, Thorsten ^a   Shivaswamy, Pannaga ^b   Schnabel, Tobias ^c  

^a School of Operations Research and Information Engineering   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; SEARCH ENGINES;

HUMAN USERS; LEARNING PROCESS; ON-LINE ALGORITHMS; OPERATIONAL USE; REAL-WORLD; USER FEEDBACK; USER STUDY;

LEARNING SYSTEMS;

EID: 84897499816     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002a. (Pubitemid 34126111)
2. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002b.
3. Bartók, Gabór, Pál, Dávid, and Szepesvári, Csaba. Toward a classification of finite partial-monitoring games. In ALT, pp. 224-238, 2010.
4. Cesa-Bianchi, N. and Lugosi, G. Prediction, learning, and games. Cambridge University Press, 2006.
5. Chapelle, O. and Chang, Y. Yahoo! learning to rank challenge overview. JMLR - Proceedings Track, 14:1-24, 2011.
6. Chapelle, O., Joachims, T., Radlinski, F., and Yue, Yisong. Large-scale validation and analysis of interleaved search evaluation. ACM Transactions on Information Systems (TOIS), 30(1):6:1-6:41, 2012.
7. Chen, D. and Xiang, D. The consistency of multicategory support vector machines. Adv. Comput. Math, 24(1-4):155-169, 2006. (Pubitemid 43563917)
8. Chu, W. and Ghahramani, Z. Preference learning with gaussian processes. In ICML, 2005.
9. Collins, M. Discriminative training methods for hidden markov models: theory and experiments with perceptron algorithms. In EMNLP, 2002.
10. Crammer, K. and Singer, Y. Pranking with ranking. In NIPS, 2001.
11. Flaxman, A., Kalai, A. T., and McMahan, H. B. Online convex optimization in the bandit setting: gradient descent without a gradient. In SODA, 2005.
12. Freund, Y., Iyer, R. D., Schapire, R. E., and Singer, Y. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
13. Herbrich, R., Graepel, T., and Obermayer, K. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers. MIT Press, 2000.
14. Joachims, T. Optimizing search engines using clickthrough data. In KDD, 2002.
15. Lee, Yoonkyung, Lin, Yi, and Wahba, Grace. Multicategory support vector machines. Journal of the American Statistical Association, 99(465):67-81, 2004.
16. Lewis, D. D., Yang, Y., Rose, T. G., and Li, F. RCV1: A new benchmark collection for text categorization research. JMLR, 5:361-397, 2004.
17. Liu, T-Y. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3, March 2009.
18. Manning, C., Raghavan, P., and Schütze, H. Introduction to Information Retrieval. Cambridge University Press, 2008.
19. Radlinski, F. and Joachims, T. Minimally invasive randomization for collecting unbiased preferences from clickthrough logs. In AAAI, pp. 1406-1412, 2006.
20. Raman, K., Shivaswamy, P., and Joachims, T. Online learning to diversify from implicit feedback. In KDD, 2012.
21. Shivaswamy, P. and Joachims, T. Online structured prediction via coactive learning. In ICML, 2012.
22. Yue, Y. and Joachims, T. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML, 2009.
23. Yue, Y., Broder, J., Kleinberg, R., and Joachims, T. The k-armed dueling bandits problem. In COLT, 2009.
24. Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003.