资源分类
》 资源 》论文》The Limits of Maxing, Ranking, and Preference Learning

The Limits of Maxing, Ranking, and Preference Learning

2020-03-19 | |  94 |   34 |   0

Abstract

We present a comprehensive understanding of three important problems in PAC preference learning: maximum selection (maxing), ranking, and estimating all pairwise preference probabilities, in the adaptive setting. With just Weak Stochastic Transitivity, we show that maxing requires Ω(图片.png) comparisons and with slightly more restrictive Medium Stochastic Transitivity, we present a linear complexity maxing algorithm. With Strong Stochastic Transitivity and Stochastic Triangle Inequality, we derive a ranking algorithm with optimal O(n log n) complexity and an optimal algorithm that estimates all pairwise preference probabilities.

上一篇：Functional Gradient Boosting based on Residual Network Perception

下一篇：Fairness Without Demographics in Repeated Loss Minimization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...