Dynamic Ranking and Translation Synchronization

07/04/2022
βˆ™
by   Ernesto Araya, et al.
βˆ™
0
βˆ™

In many applications, such as sport tournaments or recommendation systems, we have at our disposal data consisting of pairwise comparisons between a set of n items (or players). The objective is to use this data to infer the latent strength of each item and/or their ranking. Existing results for this problem predominantly focus on the setting consisting of a single comparison graph G. However, there exist scenarios (e.g., sports tournaments) where the the pairwise comparison data evolves with time. Theoretical results for this dynamic setting are relatively limited and is the focus of this paper. We study an extension of the translation synchronization problem, to the dynamic setting. In this setup, we are given a sequence of comparison graphs (G_t)_tβˆˆπ’―, where π’―βŠ‚ [0,1] is a grid representing the time domain, and for each item i and time tβˆˆπ’― there is an associated unknown strength parameter z^*_t,iβˆˆβ„. We aim to recover, for tβˆˆπ’―, the strength vector z^*_t=(z^*_t,1,…,z^*_t,n) from noisy measurements of z^*_t,i-z^*_t,j, where {i,j} is an edge in G_t. Assuming that z^*_t evolves smoothly in t, we propose two estimators – one based on a smoothness-penalized least squares approach and the other based on projection onto the low frequency eigenspace of a suitable smoothness operator. For both estimators, we provide finite sample bounds for the β„“_2 estimation error under the assumption that G_t is connected for all tβˆˆπ’―, thus proving the consistency of the proposed methods in terms of the grid size |𝒯|. We complement our theoretical findings with experiments on synthetic and real data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 09/28/2021

Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method

Many applications such as recommendation systems or sports tournaments i...
research
βˆ™ 06/06/2019

Ranking and synchronization from pairwise measurements via SVD

Given a measurement graph G= (V,E) and an unknown signal r ∈R^n, we inve...
research
βˆ™ 12/29/2020

An extension of the angular synchronization problem to the heterogeneous setting

Given an undirected measurement graph G = ([n], E), the classical angula...
research
βˆ™ 10/21/2021

Generalized Results for the Existence and Consistency of the MLE in the Bradley-Terry-Luce Model

Ranking problems based on pairwise comparisons, such as those arising in...
research
βˆ™ 09/07/2023

Improved theoretical guarantee for rank aggregation via spectral method

Given pairwise comparisons between multiple items, how to rank them so t...
research
βˆ™ 04/07/2012

The asymptotics of ranking algorithms

We consider the predictive problem of supervised ranking, where the task...
research
βˆ™ 04/06/2023

Pairwise Ranking with Gaussian Kernels

Regularized pairwise ranking with Gaussian kernels is one of the cutting...

Please sign up or login with your details

Forgot password? Click here to reset