Learning the distribution of latent variables in paired comparison models with round-robin scheduling
- Others:
- Laboratoire Jean Alexandre Dieudonné (JAD) ; Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)
- Institut Polytechnique de Paris (IP Paris)
- Communications, Images et Traitement de l'Information (CITI) ; Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
- Traitement de l'Information Pour Images et Communications (TIPIC-SAMOVAR) ; Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR) ; Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
- Centre de Recherche en Économie et Statistique (CREST) ; Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-Centre National de la Recherche Scientifique (CNRS)
- Ecole Nationale de la Statistique et de l'Analyse Economique (ENSAE) ; Ecole Nationale de la Statistique et de l'Analyse Economique
- Centre National de la Recherche Scientifique (CNRS)
Description
Paired comparison data considered in this paper originate from the comparison of a large number N of individuals in couples. The dataset is a collection of results of contests between two individuals when each of them has faced n opponents, where n is much larger than N. Individual are represented by independent and identically distributed random parameters characterizing their abilities. The paper studies the maximum likelihood estimator of the parameters distribution. The analysis relies on the construction of a graphical model encoding conditional dependencies of the observations which are the outcomes of the first n contests each individual is involved in. This graphical model allows to prove geometric loss of memory properties and deduce the asymptotic behavior of the likelihood function. This paper sets the focus on graphical models obtained from round-robin scheduling of these contests. Following a classical construction in learning theory, the asymptotic likelihood is used to measure performance of the maximum likelihood estimator. Risk bounds for this estimator are finally obtained by sub-Gaussian deviation results for Markov chains applied to the graphical model.
Additional details
- URL
- https://hal.archives-ouvertes.fr/hal-01552494
- URN
- urn:oai:HAL:hal-01552494v2
- Origin repository
- UNICA