2 papers
stat.OT2026
Deepest voting on rankings
Jean-Baptiste Aubin, Antoine Rolland, Ioana Gavra +2
This article aims to present a unified framework for ranking-based voting rules based on the use of depth functions on permutations, as a counterpart of deepest voting rules on eva…
math.ST2024
A non-asymptotic upper bound in prediction for the PLS estimator
Luca Castelli, Irène Gannaz, Clément Marteau
We investigate the theoretical performances of the Partial Least Square (PLS) algorithm in a high dimensional context. We provide upper bounds on the risk in prediction for the sta…