Stochastic iterative methods for online rank aggregation from pairwise comparisons

DOI10.1007/S10543-024-01024-XMaRDI QIDQ6579315zbMATH OpenFDO

Authors Benjamin Jarman, Lara Kassab, D. Needell, Alexander Sietsema

Publication date 25 July 2024

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10543-024-01024-X

zbMATH Keywords

inconsistent dataKaczmarz methodpairwise comparisonsrank aggregation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

Recommendations

• Rank Centrality: Ranking from Pairwise Comparisons
• The asymptotics of ranking algorithms
• Ranking recovery from limited pairwise comparisons using low-rank matrix completion
• Spectral ranking using seriation
• Simple, Robust and Optimal Ranking from Pairwise Comparisons

Cites work

• A randomized Kaczmarz algorithm with exponential convergence
• A sampling Kaczmarz-Motzkin algorithm for linear feasibility
• Convergence properties of the heterogeneous Deffuant-Weisbuch model
• Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
• Faster randomized block Kaczmarz algorithms
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• New characterizations of Hoffman constants for systems of linear constraints
• On Adaptive Sketch-and-Project for Solving Linear Systems
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Quantile-based iterative methods for corrupted systems of linear equations
• Randomized extended Kaczmarz for solving least squares
• Randomized iterative methods for linear systems
• Randomized Kaczmarz solver for noisy linear systems
• Randomized methods for linear constraints: convergence rates and conditioning
• The Relaxation Method for Linear Inequalities

This page was built for publication: Stochastic iterative methods for online rank aggregation from pairwise comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579315)