Top-k selection based on adaptive sampling of noisy preferences

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 2131-2139

  Busa Fekete, Róbert ^a,b   Szörényi, Balázs ^b,c   Weng, Paul ^d   Cheng, Weiwei ^a   Hüllermeier, Eyke ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

^b UNIVERSITY OF SZEGED   (Hungary)

^c INRIA   (France)

^d SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

ADAPTIVE SAMPLING; FIXED SIZE; OPTIMAL SUBSETS; RACING ALGORITHMS; RANKING PROCEDURES; SAMPLING SCHEMES; SELECTION BASED; SYNTHETIC DATA;

ALGORITHMS;

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

References (25)

1. Akrour, R., Schoenauer, M., and Sebag, M. Preference-based policy learning. In Proceedings ECMLPKDD 2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 12-27, 2011.
2. Altman, A. and Tennenholtz, M. Axiomatic foundations for ranking systems. Journal of Artificial Intelligence Research, 31(1):473-495, 2008.
3. Aslam, J.A. and Decatur, S.E. General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Inf. Comput., 141(2):85-118, 1998.
4. Audibert, J.Y., Munos, R., and Szepesvari, C. Tuning bandit algorithms in stochastic environments. In Proceedings of the Algorithmic Learning Theory, pp. 150-165, 2007.
5. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002.
6. Brandt, F. and Fischer, F. Pagerank as a weak tournament solution. In Proceedings of the 3rd international conference on Internet and Network Economics, pp. 300-305, 2007.
7. Braverman, Mark and Mossel, Elchanan. Noisy sorting without resampling. In Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete algorithms, pp. 268-276, 2008.
8. Brin, S. and Page, L. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30 (1-7):107-117, 1998.
9. Cheng, W., Fiirnkranz, J., Hiillermeier, E., and Park, S.H. Preference-based policy iteration: Leveraging preference learning for reinforcement learning. In Proceedings ECMLPKDD 2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 414-429, 2011.
10. Even-Dar, E., Mannor, S., and Mansour, Y. PAC bounds for multi-armed bandit and markov decision processes. In Proceedings of the 15th Annual Conference on Computational Learning Theory, pp. 255-270, 2002.
11. Funderlic, R.E. and Meyer, C.D. Sensitivity of the stationary distribution vector for an ergodic markov chain. Linear Algebra and its Applications, 76:1-17, 1986.
12. Fiirnkranz, J. and Hiillermeier, E. (eds.). Preference Learning. Springer-Verlag, 2011.
13. Heidrich-Meisner, V. and Igel, C. Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search. In Proceedings of the 26th International Conference on Machine Learning, pp. 401-408, 2009.
14. Hoeffding, W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
15. Kalyanakrishnan, S., Tewari, A., Auer, P., and Stone, P. Pac subset selection in stochastic multi-armed bandits. In Proceedings of the Twenty-ninth International Conference on Machine Learning (ICML 2012), pp. 655-662, 2012.
16. Kocsor, A., Busa-Fekete, R., and Pongor, S. Protein classification based on propagation on unrooted binary trees. Protein and Peptide Letters, 15(5):428-34, 2008.
17. Langville, A. N and Meyer, C. D. Deeper inside pager-ank. Internet Mathematics, 1(3):335-380, 2004.
18. Maron, O. and Moore, A.W. Hoeffding races: accelerating model selection search for classification and function approximation. In Advances in Neural Information Processing Systems, pp. 59-66, 1994.
19. Maron, O. and Moore, A.W. The racing algorithm: Model selection for lazy learners. Artificial Intelligence Review, 5(1):193-225, 1997.
20. Mnih, V., Szepesvári, C., and Audibert, J.Y. Empirical Bernstein stopping. In Proceedings of the 25th international conference on Machine learning, pp. 672-679, 2008.
21. Moulin, H. Axioms of cooperative decision making. Cambridge University Press, 1988.
22. Negahban, S., Oh, S., and Shah, D. Iterative ranking from pairwise comparisons. In Advances in Neural Information Processing Systems, pp. 2483-2491, 2012.
23. Seneta, E. Sensitivity of finite markov chains under perturbation. Statistics & probability letters, 17(2): 163-168, 1992.
24. Serfling, R.J. Approximation theorems of mathematical statistics, volume 34. Wiley Online Library, 1980.
25. Yue, Y., Broder, J., Kleinberg, R., and Joachims, T. The k-armed dueling bandits problem. Journal of Computer and System Sciences, 78(5):1538-1556, 2012.