Active learning ranking from pairwise preferences with almost optimal query complexity

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Ailon, Nir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; ADAPTIVE SAMPLING; ARBITRARY NOISE; OPTIMAL QUERY; PERFORMANCE; QUERY COMPLEXITY; TWO PARAMETER;

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

References (26)

1. Nir Ailon, Ron Begleiter, and Esther Ezra, A new active learning scheme with applications to learning to rank from pairwise preferences, arxiv.org/abs/1110.2136 (2011).
2. Nir Ailon, Moses Charikar, and Alantha Newman, Aggregating inconsistent information: Ranking and clustering, J. ACM 55 (2008), no. 5.
3. Nir Ailon and Mehryar Mohri, Preference based learning to rank, vol. 80, 2010, pp. 189-212.
4. Nir Ailon and Kira Radinsky, Ranking from pairs and triplets: Information quality, evaluation methods and query complexity, WSDM, 2011.
5. Noga Alon, Ranking tournaments, SIAM J. Discret. Math. 20 (2006), no. 1, 137-142.
6. M. F. Balcan, N. Bansal, A. Beygelzimer, D. Coppersmith, J. Langford, and G. B. Sorkin, Robust reductions from ranking to classification, Machine Learning 72 (2008), no. 1-2, 139-153.
7. Maria-Florina Balcan, Alina Beygelzimer, and John Langford, Agnostic active learning, J. Comput. Syst. Sci. 75 (2009), no. 1, 78-89.
8. Maria-Florina Balcan, Steve Hanneke, and Jennifer Vaughan, The true sample complexity of active learning, Machine Learning 80 (2010), 111-139.
9. A. Beygelzimer, J. Langford, and P. Ravikumar, Error-correcting tournaments, ALT, 2009, pp. 247-262.
10. M. Braverman and E. Mossel, Noisy sorting without resampling, SODA: Proceedings of the 19th annual ACM-SIAM symposium on Discrete algorithms, 2008, pp. 268-276.
11. B. Carterette, P. N. Bennett, D. Maxwell Chickering, and S. T. Dumais, Here or there: Preference judgments for relevance, ECIR, 2008.
12. WilliamW. Cohen, Robert E. Schapire, and Yoram Singer, Learning to order things, NIPS '97, 1998, pp. 451-457.
13. D. Cohn, L. Atlas, and R. Ladner, Improving generalization with active learning, Machine Learning 15 (1994), no. 2, 201-221.
14. A. Culotta and A. McCallum, Reducing labeling effort for structured prediction tasks, AAAI: Proceedings of the 20th national conference on Artificial intelligence, 2005, pp. 746-751.
15. S. Dasgupta, Coarse sample complexity bounds for active learning, Advances in Neural Information Processing Systems 18, 2005, pp. 235-242.
16. S. Dasgupta, A. Tauman Kalai, and C. Monteleoni, Analysis of perceptron-based active learning, Journal of Machine Learning Research 10 (2009), 281-299.
17. Sanjoy Dasgupta, Daniel Hsu, and Claire Monteleoni, A general agnostic active learning algorithm, NIPS, 2007.
18. Persi Diaconis and R. L. Graham, Spearman's footrule as a measure of disarray, Journal of the Royal Statistical Society. Series B (Methodological) 39 (1977), no. 2, pp. 262-268.
19. U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Computing with unreliable information, STOC: Proceedings of the 22nd annual ACM symposium on Theory of computing, 1990, pp. 128-137.
20. Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby, Selective sampling using the query by committee algorithm, Mach. Learn. 28 (1997), no. 2-3, 133-168.
21. Steve Hanneke, A bound on the label complexity of agnostic active learning, ICML, 2007, pp. 353-360.
22. Eyke Hüllermeier, Johannes Fürnkranz, Weiwei Cheng, and Klaus Brinker, Label ranking by learning pairwise preferences, Artif. Intell. 172 (2008), no. 16-17, 1897-1916.
23. Claire Kenyon-Mathieu andWarren Schudy, How to rank with few errors, STOC, 2007, pp. 95-103.
24. Dan Roth and Kevin Small, Margin-based active learning for structured output spaces, 2006.
25. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory of Prob. and its Applications 16 (1971), no. 2, 264-280.
26. F. Xia, T-Y Liu, J. Wang, W. Zhang, and H. Li, Listwise approach to learning to rank: theory and algorithm, ICML '08, 2008, pp. 1192-1199.