Online structured prediction via coactive learning

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1431-1438

  Shivaswamy, Pannaga ^a   Joachims, Thorsten ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

HUMAN USERS; ONLINE LEARNING; STRUCTURED PREDICTION; USER BEHAVIORS;

BEHAVIORAL RESEARCH; LEARNING SYSTEMS; SEARCH ENGINES; WORLD WIDE WEB;

LEARNING ALGORITHMS;

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

References (19)

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.
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. Bakir, G.H., Hofmann, T., Schölkopf, B., Smola, A.J., Taskar, B., and Vishwanathan, S.V.N. (eds.). Predicting Structured Data. The MIT Press, 2007.
4. Bell, R. M. and Koren, Y. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In ICDM, 2007.
5. Cesa-Bianchi, N. and Lugosi, G. Prediction, learning, and games. Cambridge University Press, 2006.
6. Chapelle, O. and Chang, Y. Yahoo! learning to rank challenge overview. JMLR - Proceedings Track, 14:1-24, 2011.
7. Chu, W. and Ghahramani, Z. Preference learning with gaussian processes. In ICML, 2005.
8. Crammer, K. and Singer, Y. Pranking with ranking. In NIPS, 2001.
9. Flaxman, A., Kalai, A. T., and McMahan, H. B. Online convex optimization in the bandit setting: gradient descent without a gradient. In SODA, 2005.
10. 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.
11. Herbrich, R., Graepel, T., and Obermayer, K. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers. MIT Press, 2000.
12. Joachims, T., Granka, L., Pan, Bing, Hembrooke, H., Radlinski, F., and Gay, G. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Systems (TOIS), 25(2), April 2007.
13. Jones, R. and Klinkner, K. Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In CIKM, 2008.
14. Liu, T-Y. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3, March 2009.
15. Manning, C., Raghavan, P., and Schütze, H. Introduction to Information Retrieval. Cambridge University Press, 2008.
16. Shivaswamy, P. and Joachims, T. Online structured prediction via coactive learning. arXiv.1205.4213, 2012.
17. Yue, Y. and Joachims, T. Interactively optimizing information retrieval systems as a dueling bandits problem. In ICML, 2009.
18. Yue, Y., Broder, J., Kleinberg, R., and Joachims, T. The k-armed dueling bandits problem. In COLT, 2009.
19. Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003.