COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Statistics > Robust ranking, constrained ranking and rank aggregation via eigenvector and semidefinite programming synchronization

## Robust ranking, constrained ranking and rank aggregation via eigenvector and semidefinite programming synchronizationAdd to your list(s) Download to your calendar using vCal - Mihai Cucuringu (Oxford)
- Friday 19 May 2017, 16:00-17:00
- MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge..
If you have a question about this talk, please contact Quentin Berthet. 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, and also discuss an application to extracting leaders and laggers in multivariate time time series data. 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 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. This talk is part of the Statistics series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- DPMMS Lists
- DPMMS info aggregator
- DPMMS lists
- Guy Emerson's list
- MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.
- Machine Learning
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Statistics
- Statistics Group
- rp587
Note that ex-directory lists are not shown. |
## Other listsSoft Condensed MatterTermly Meeting Environment on the Edge Lecture Series Cambridge University Astronomical Society (CUAS)## Other talksOverview of Research Process Synthesising Molecular Function: Shape Matters Adaptive auditory cortical coding of speech Paracelsus' Chickens - Strange Tales from the History of Chemistry "Morality and the Market" Psychology and Suicidal Behaviour |