activity
20202026
most citedOptimal Permutation Estimation in Crowd-Sourcing problems

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DC2026

High-Performance Portable GPU Primitives for Arbitrary Types and Operators in Julia

Emmanuel Pilliat

Portable GPU frameworks such as Kokkos and RAJA reduce the burden of cross-architecture development but typically incur measurable overhead on fundamental parallel primitives relat…

math.ST2025

Adaptive Algorithms for Infinitely Many-Armed Bandits: A Unified Framework

Emmanuel Pilliat

We consider a bandit problem where the buget is smaller than the number of arms, which may be infinite. In this regime, the usual objective in the literature is to minimize simple…

math.ST2024

On Sparsity and Sub-Gaussianity in the Johnson-Lindenstrauss Lemma

Aurélien Garivier, Emmanuel Pilliat

We provide a simple proof of the Johnson-Lindenstrauss lemma for sub-Gaussian variables. We extend the analysis to identify how sparse projections can be, and what the cost of spar…

math.ST2023

Optimal rates for ranking a permuted isotonic matrix in polynomial time

Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen

We consider a ranking problem where we have noisy observations from a matrix with isotonic columns whose rows have been permuted by some permutation *. This encompasses many mo…

math.ST2022★ 1 cited

Optimal Permutation Estimation in Crowd-Sourcing problems

Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen

Motivated by crowd-sourcing applications, we consider a model where we have partial observations from a bivariate isotonic n x d matrix with an unknown permutation * acting on…

math.ST2020

Optimal multiple change-point detection for high-dimensional data

Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen

This manuscript makes two contributions to the field of change-point detection. In a generalchange-point setting, we provide a generic algorithm for aggregating local homogeneity t…