Minimax optimal seriation in polynomial time - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2024

Minimax optimal seriation in polynomial time

Abstract

We consider the statistical seriation problem, where the statistician seeks to recover a hidden ordering from a noisy observation of a permuted Robinson matrix. In this paper, we tightly characterize the minimax rate for this problem of matrix reordering when the Robinson matrix is bi-Lipschitz, and we also provide a polynomial time algorithm achieving this rate; thereby answering two open questions of [Giraud et al., 2021]. Our analysis further extends to broader classes of similarity matrices.

Keywords

Fichier principal
Vignette du fichier
seritation_permutation.pdf (781.88 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04575332 , version 1 (14-05-2024)

Identifiers

Cite

Yann Issartel, Christophe Giraud, Nicolas Verzelen. Minimax optimal seriation in polynomial time. 2024. ⟨hal-04575332⟩
0 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More