An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 137-164

  Ailon, Nir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Active learning; Pairwise ranking; Preferences; Ranking; Statistical learning theory

Indexed keywords

ACTIVE LEARNING; PAIRWISE RANKING; PREFERENCES; RANKING; STATISTICAL LEARNING THEORY;

LEARNING ALGORITHMS;

OPTIMIZATION;

EID: 84857615668     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. Nir Ailon and Mehryar Mohri. Preference based learning to rank. Machine Learning, 80:189-212, 2010.
2. Nir Ailon and Kira Radinsky. Ranking from pairs and triplets: Information quality, evaluation methods and query complexity. In Proceedings of the 4th ACM International Conference on Web Search and Data Mining (WSDM), 2011.
3. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. Estimating the distance to a monotone function. Random Struct. Algorithms, 31(3):371-383, 2007.
4. Nir Ailon, Moses Charikar, and Alantha Newman. Aggregating inconsistent information: Ranking and clustering. J. ACM, 55(5), 2008a.
5. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. Property-preserving data reconstruction. Algorithmica, 51(2):160-182, 2008b. (Pubitemid 351599089)
6. Nir Ailon, Ron Begleiter, and Esther Ezra. A new active learning scheme with applications to learning to rank from pairwise preferences. arxiv:1110.2136, 2011.
7. Miklos Ajtai, Vitaly Feldman, Avinatan Hassidim, and Jelani Nelson. Sorting and selection with imprecise comparisons. In Automata, Languages and Programming, volume 5555 of Lecture Notes in Computer Science, pages 37-48. Springer Berlin / Heidelberg, 2009.
8. Noga Alon. Ranking tournaments. SIAM J. Discret. Math., 20(1):137-142, 2006. (Pubitemid 46352091)
9. Dana Angluin. Queries revisited. Theor. Comput. Sci., 313(2):175-194, 2004.
10. Les Atlas, David Cohn, Richard Ladner, Mohamed A. El-Sharkawi, and Robert J. Marks. Training connectionist networks with queries and selective sampling. In Proceedings of Advances in Neural Information Processing Systems (NIPS), pages 566-573, 1990.
11. Les Atlas, David Cohn, and Richard Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
12. Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, and Gregory B. Sorkin. Robust reductions from ranking to classification. Machine Learning, 72 (1-2):139-153, 2008.
13. Maria-Florina Balcan, Alina Beygelzimer, and John Langford. Agnostic active learning. J. Comput. Syst. Sci., 75(1):78-89, 2009.
14. Maria-Florina Balcan, Steve Hanneke, and Jennifer Vaughan. The true sample complexity of active learning. Machine Learning, 80:111-139, 2010.
15. Yoram Baram, Ran El-Yaniv, and Kobi Luz. Online choice of active learning algorithms. Journal of Machine Learning Research, 5:255-291, 2004.
16. Ron Begleiter, Ran El-Yaniv, and Dmitry Pechyony. Repairing self-confident active-transductive learners using systematic exploration. Pattern Recognition Letters, 29(9):1245-1251, 2008.
17. Mark Braverman and Elchanan Mossel. Noisy sorting without resampling. In Proceedings of the nineteenth Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pages 268-276, Philadelphia, PA, USA, 2008.
18. Ben Carterette, Paul N. Bennett, David Maxwell Chickering, and Susan T. Here or there: Preference judgments for relevance. In Proceedings of the 30th European Conference on Information Retrieval (ECIR), pages 16-27, 2008. (Pubitemid 351499055)
19. WilliamW. Cohen, Robert E. Schapire, and Yoram Singer. Learning to order things. In Proceedings of the 10th Conference on Advances in Neural Information Processing Systems (NIPS), pages 451-457, 1998.
20. Koby Crammer and Yoram Singer. Pranking with ranking. In Proceedings of the 14th Conference on Advances in Neural Information Processing Systems (NIPS), pages 641-647, 2001.
21. Aron Culotta and Andrew McCallum. Reducing labeling effort for structured prediction tasks. In Proceedings of the 20th Conference on Artificial Intelligence (AAAI), pages 746-751, 2005. (Pubitemid 43006698)
22. Sanjoy Dasgupta. Coarse sample complexity bounds for active learning. In Proceedings of the 18th Conference on Advances in Neural Information Processing Systems (NIPS), pages 235-242, 2005.
23. Sanjoy Dasgupta, Daniel Hsu, and Claire Monteleoni. A general agnostic active learning algorithm. In Proceedings of the 21st Conference on Advances in Neural Information Processing Systems (NIPS), 2007.
24. Sanjoy Dasgupta, Adam Tauman Kalai, and ClaireMonteleoni. Analysis of perceptron-based active learning. Journal of Machine Learning Research, 10:281-299, 2009.
25. Persi Diaconis and Ronald L. Graham. Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B (Methodological), 39(2):pp. 262-268, 1977.
26. Irit Dinur and Shmuel Safra. On the importance of being biased. In Proceedings of the 34th Annual Symposium on the Theory of Computing (STOC), pages 33-42, 2002.
27. Ran El-Yaniv and YairWiener. On the foundations of noise-free selective classification. J. Machine Learning Research, 11:1605-1641, 2010.
28. Uri Feige, David Peleg, Prabhakar Raghavan, and Eli Upfal. Computing with unreliable information. In Proceedings of the 22nd Annual Symposium on the Theory of Computing (STOC), pages 128-137, 2002.
29. Shai Fine, Ran Gilad-Bachrach, and Eli Shamir. Query by committee, linear separation and random walks. Theoretical Computer Science, 284(1):25-51, 2002. (Pubitemid 34661528)
30. Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby. Selective sampling using the query by committee algorithm. Mach. Learn., 28(2-3):133-168, 1997. (Pubitemid 127506338)
31. Eric J. Friedman. Active learning for smooth problems. In Proceedings of the 22nd Annual Conference on Learning Theory (COLT), 2009.
32. Shirley Halevy and Eyal Kushilevitz. Distribution-free property-testing. SIAM J. Comput., 37(4): 1107-1138, 2007.
33. Steve Hanneke. A bound on the label complexity of agnostic active learning. In Proceedings of the 24th International Conference on Machine Learning (ICML), pages 353-360, 2007.
34. Ralf Herbrich, Thore Graepel, and Klaus Obermayer. Advances in LargeMargin Classifiers, chapter 7 (Large Margin Rank Boundaries for Ordinal Regression), pages 115-132. MIT Press, 2000.
35. Eyke Hüllermeier, Johannes Fürnkranz, Weiwei Cheng, and Klaus Brinker. Label ranking by learning pairwise preferences. Artif. Intell., 172(16-17):1897-1916, 2008.
36. Kevin G. Jamieson and Robert D. Nowak. Active ranking using pairwise comparisons. In Proceedings of the 25th Conference on Advances in Neural Information Processing Systems (NIPS), 2011.
37. Thorsten Joachims. Optimizing search engines using clickthrough data. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 133-142, 2002.
38. Richard M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-104. Plenum Press, New York, 1972.
39. Claire Kenyon-Mathieu and Warren Schudy. How to rank with few errors. In Proceedings of the 39th Annual Symposium on the Theory of Computing (STOC), pages 95-103, 2007. (Pubitemid 47630725)
40. Michael Lindenbaum, Shaul Markovitch, and Dmitry Rusakov. Selective sampling for nearest neighbor classifiers. Machine Learning, 54:125-152, 2004.
41. Dan Roth and Kevin Small. Margin-based active learning for structured output spaces. In Proceedings of the European Conference on Machine Learning (ECML), pages 413-424, 2006. (Pubitemid 44618850)
42. Vladimir N. Vapnik and Alexey Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.
43. Kai Yu, Jinbo Bi, and Volker Tresp. Active learning via transductive experimental design. In Proceedings of the 23rd International Conference on Machine Learning (ICML), pages 1081-1088, 2006.