Stéphane Boucheron

Orcid: 0000-0003-4647-7181

According to our database1, Stéphane Boucheron authored at least 20 papers between 1988 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets.
CoRR, 2016

2015
About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes.
IEEE Trans. Inf. Theory, 2015

2014
About Adaptive Coding on Countable Alphabets.
IEEE Trans. Inf. Theory, 2014

2013
Concentration Inequalities - A Nonasymptotic Theory of Independence.
Oxford University Press, ISBN: 978-0-19-953525-5, 2013

2009
Coding on Countably Infinite Alphabets.
IEEE Trans. Inf. Theory, 2009

2006
Error exponents for AR order testing.
IEEE Trans. Inf. Theory, 2006

2003
Optimal error exponents in hidden Markov models order estimation.
IEEE Trans. Inf. Theory, 2003

Introduction to Statistical Learning Theory.
Proceedings of the Advanced Lectures on Machine Learning, 2003

Concentration Inequalities.
Proceedings of the Advanced Lectures on Machine Learning, 2003

2002
Model Selection and Error Estimation.
Mach. Learn., 2002

On A Square Packing Problem.
Comb. Probab. Comput., 2002

2001
On The Independence Number Of Random Interval Graphs.
Comb. Probab. Comput., 2001

2000
About priority encoding transmission.
IEEE Trans. Inf. Theory, 2000

A sharp concentration inequality with applications.
Random Struct. Algorithms, 2000

On The Fluctuations Of The Giant Component.
Comb. Probab. Comput., 2000

1997
An urn model from learning theory.
Random Struct. Algorithms, 1997

Noise Injection: Theoretical Prospects.
Neural Comput., 1997

1995
Control of complexity in learning with perturbed inputs.
Proceedings of the 3rd European Symposium on Artificial Neural Networks, 1995

1988
Learnability in the Presence of Noise.
Proceedings of the Third European Working Session on Learning, 1988

Some Remarks About Space-Complexity of Learning, and Circuit Complexity of Recognizing.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988


  Loading...