Borkar, Vivek S. ; Karamchandani, Nikhil ; Mirani, Sharad (2016) Randomized Kaczmarz for rank aggregation from pairwise comparisons In: 2016 IEEE Information Theory Workshop (ITW), 11-14 Sept 2016, Cambridge, UK.
Full text not available from this repository.
Official URL: http://doi.org/10.1109/ITW.2016.7606862
Related URL: http://dx.doi.org/10.1109/ITW.2016.7606862
Abstract
We revisit the problem of inferring the overall ranking among entities in the framework of Bradley-Terry-Luce (BTL) model, based on available empirical data on pairwise preferences. By a simple transformation, we can cast the problem as that of solving a noisy linear system, for which a ready algorithm is available in the form of the randomized Kaczmarz method. This scheme is provably convergent and has excellent empirical performance. Convergence, convergence rate, and error analysis of the proposed algorithm are presented and several numerical experiments are conducted whose results validate our theoretical findings.
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Source: | Copyright of this article belongs to IEEE. |
| ID Code: | 135192 |
| Deposited On: | 20 Jan 2023 05:49 |
| Last Modified: | 20 Jan 2023 05:49 |
Repository Staff Only: item control page
