93 citations · 244 across the 9 of their papers we have counts for
10 papers
Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets
Anna Ben-Hamou, Stephane Boucheron, Elisabeth Gassiat
Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a si…
Tail index estimation, concentration and adaptivity
Stéphane Boucheron, Maud Thomas
This paper presents an adaptive version of the Hill estimator based on Lespki's model selection method. This simple data-driven index selection method is shown to satisfy an oracle…
Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications
Anna Ben-Hamou, Stéphane Boucheron, Mesrob I. Ohannessian
An infinite urn scheme is defined by a probability mass function over positive integers. A random allocation consists of a sample of independent drawings accor…
About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes
Boucheron Stephane, Elisabeth Gassiat, Mesrob I. Ohannessian
In this paper, we study the problem of lossless universal source coding for stationary memoryless sources on countably infinite alphabets. This task is generally not achievable wit…
Concentration inequalities for order statistics
Stephane Boucheron, Maud Thomas
This note describes non-asymptotic variance and tail bounds for order statistics of samples of independent identically distributed random variables. Those bounds are checked to be…
About adaptive coding on countable alphabets
Dominique Bontemps, Stéphane Boucheron, Elisabeth Gassiat
This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing ha…