Nicolas Verzelen

Finding the best arm in a dueling bandit setting gets a serious upgrade: a new algorithm exploits all pairwise comparisons, slashing sample complexity and revealing limitations in existing asymptotic analyses.

Clustering in moderate dimensions isn't just about dimension reduction; it hits a "non-parametric rate" computational barrier, revealed by a new low-degree polynomial lower bound.