paper-with-me

홈 › Papers

Sync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronization

2015-04-05 · Mihai Cucuringu

We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine learning. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations, whose usefulness has been demonstrated in numerous applications in recent years. Its least squares solution can be approximated by either a spectral or a semidefinite programming (SDP) relaxation, followed by a rounding procedure. We perform extensive numerical simulations on both synthetic and real-world data sets, showing that our proposed method compares favorably to other algorithms from the recent literature. Existing theoretical guarantees on the group synchronization problem imply lower bounds on the largest amount of noise permissible in the ranking data while still achieving exact recovery. We propose a similar synchronization-based algorithm for the rank-aggregation problem, which integrates in a globally consistent ranking pairwise comparisons given by different rating systems on the same set of items. We also discuss the problem of semi-supervised ranking when there is available information on the ground truth rank of a subset of players, and propose an algorithm based on SDP which recovers the ranks of the remaining players. Finally, synchronization-based ranking, combined with a spectral technique for the densest subgraph problem, allows one to extract locally-consistent partial rankings, in other words, to identify the rank of a small subset of players whose pairwise comparisons are less noisy than the rest of the data, which other methods are not able to identify.

📄 PDF Abstract BibTeX arXiv:1504.01070

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Impact of Rankings and Personalized Recommendations in Marketplaces

2025-06-03 · Omar Besbes, Yash Kanoria, Akshit Kumar

Individuals often navigate several options with incomplete knowledge of their own preferences. Information provisioning tools such as public rankings and personalized recommendations have become central to helping indivi…

Navigate

A theoretical guarantee for SyncRank

2025-09-26 · Yang Rao arxiv

We present a theoretical and empirical analysis of the SyncRank algorithm for recovering a global ranking from noisy pairwise comparisons. By adopting a complex-valued data model where the true ranking is encoded in the …

Ranking and synchronization from pairwise measurements via SVD

2019-06-06 · Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi

Given a measurement graph $G= (V,E)$ and an unknown signal $r \in \mathbb{R}^n$, we investigate algorithms for recovering $r$ from pairwise measurements of the form $r_i - r_j$; $\{i,j\} \in E$. This problem arises in a …

End-to-end Learning for Fair Ranking Systems

2021-11-21 · James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, Ziwei Zhu

The learning-to-rank problem aims at ranking items to maximize exposure of those most relevant to a user query. A desirable property of such ranking systems is to guarantee some notion of fairness among specified item gr…

FairnessLearning-To-Rank

Rank Aggregation for Course Sequence Discovery

2016-03-03 · Mihai Cucuringu, Charlie Marshak, Dillon Montag, Puck Rombach

In this work, we adapt the rank aggregation framework for the discovery of optimal course sequences at the university level. Each student provides a partial ranking of the courses taken throughout his or her undergraduat…