Papers › Dynamic Ranking and Translation Synchronization
Dynamic Ranking and Translation Synchronization
Ernesto Araya, Eglantine Karlé, Hemant Tyagi
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 \emph{translation synchronization} problem, to the dynamic setting. In this setup, we are given a sequence of comparison graphs (Gₜ)_(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^*ₜ=(z^*_(t,1),…,z^*_(t,n)) from noisy measurements of z^*_(t,i)-z^*_(t,j), where {i,j} is an edge in Gₜ. Assuming that z^*ₜ 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 ℓ₂ estimation error under the assumption that Gₜ 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections