Publications

Filter by type:
(2017). Concentration inequalities in the infinite urn scheme foroccupancy counts and the missing mass, with applications. Bernoulli.

PDF DOI

(2015). Tail index estimation, concentration and adaptivity. Electron. J. Stat..

PDF DOI

(2015). About adaptive coding on countable alphabets: max-stableenvelope classes. IEEE Trans. Inform. Theory.

PDF DOI

(2014). About adaptive coding on countable alphabets. IEEE Trans. Inform. Theory.

PDF DOI

(2013). Concentration inequalities.

PDF DOI

(2012). Sharp threshold for percolation on expanders. Ann. Probab..

PDF DOI

(2012). Concentration inequalities for order statistics. Electron. Commun. Probab..

PDF DOI

(2012). Adaptive compression against a countable alphabet. 23rd Intern. Meeting on Probabilistic, Combinatorial,and Asymptotic Methods for the Analysis of Algorithms(AofA’12).

(2011). A high-dimensional Wilks phenomenon. Probab. Theory Related Fields.

PDF DOI

(2009). On concentration of self-bounding functions. Electron. J. Probab..

PDF DOI

(2009). Coding on countably infinite alphabets. IEEE Trans. Inform. Theory.

PDF DOI

(2009). A Bernstein-von Mises theorem for discrete probabilitydistributions. Electron. J. Stat..

PDF DOI

(2006). Error exponents for AR order testing. IEEE Trans. Inform. Theory.

PDF DOI

(2005). Theory of classification: a survey of some recent advances. ESAIM Probab. Stat..

PDF DOI

(2005). Moment inequalities for functions of independent randomvariables. Ann. Probab..

PDF DOI

(2003). Optimal error exponents in hidden Markov models orderestimation. IEEE Trans. Inform. Theory.

PDF DOI

(2003). Introduction to Statistical Learning Theory. Advanced Lectures on Machine Learning, ML Summer Schools 2003, Canberra,Australia, February 2-14, 2003, Tübingen, Germany, August4-16, 2003, Revised Lectures.

PDF DOI

(2003). Concentration inequalities using the entropy method. Ann. Probab..

PDF DOI

(2003). Concentration Inequalities. Advanced Lectures on Machine Learning, ML Summer Schools 2003, Canberra,Australia, February 2-14, 2003, Tübingen, Germany, August4-16, 2003, Revised Lectures.

PDF DOI

(2002). On a square packing problem. Combin. Probab. Comput..

PDF DOI

(2002). Model Selection and Error Estimation. Machine Learning.

PDF DOI

(2002). Bins and balls: large deviations of the empirical occupancyprocess. Ann. Appl. Probab..

PDF DOI

(2001). Problèmes d'informatique fondamentale. Voyages au pays de l'informatique fondamentale au gré de problm̀es de concours..

(2001). On the independence number of random interval graphs. Combin. Probab. Comput..

PDF DOI

(2000). On the fluctuations of the giant component. Combin. Probab. Comput..

PDF DOI

(2000). Model Selection and Error Estimation. Proceedings of the Thirteenth Annual Conference on Computational LearningTheory (COLT 2000), June 28 - July 1, 2000, Palo Alto, California,USA.

(2000). Loss patterns and loss resilient codes over the Internet. Proceedings of textscalgotel 2000.

(2000). About priority encoding transmission. IEEE Trans. Inform. Theory.

PDF DOI

(2000). A sharp concentration inequality with applications. Random Structures Algorithms.

PDF DOI

(1999). Coding exponents for some Markov channels. Actes du $17^texteme$ textscgretsi.

(1997). Codage à Protections Inégales et Diffusion. Actes du $16^texteme$ textscgretsi.

(1997). Noise Injection: Theoretical Prospects. Neural Computation.

PDF DOI

(1997). An urn model from learning theory. Random Structures Algorithms.

PDF DOI

(1995). De la représentation à la validation~: lagénéralisation dans les réseaux de neurones. Actes des $5^mboxscriptsize ième$ journées nationales du PRC Intelligence Artificielle.

(1995). Control of complexity in learning with perturbed inputs. ESANN 1995, 3rd European Symposium on Artificial Neural Networks,Brussels, Belgium, April 19-21, 1995, Proceedings.

PDF

(1994). Sur les traces de l'apprentissage. $9^m̊ ème$ Congrès RFIA.

(1992). Algorithmique parallèle.

(1990). Message Passing Architectures.

(1989). Some remarks about space-complexity of learning, & circuitcomplexity of recognizing. Proceedings of the 1988 Workshop on ComputationalLearning Theory (Cambridge, MA, 1988).

(1988). Apprentissage et calculs.

(1988). Learnability in the presence of noise. Proceedings of the $3^mboxscriptsize rd$ European Working Session on Learning.

(1988). Some remarks on space complexity of learning and circuit complexity of recognizing. Proceedings of COLT 1988.

(1988). Bruit et apprentissage. Actes des troisièmes Journées françaises de l’apprentissage.

(1988). Some Remarks About Space-Complexity of Learning, and Circuit Complexityof Recognizing. Proceedings of the First Annual Workshop on Computational LearningTheory, COLT ‘88, Cambridge, MA, USA, August 3-5, 1988..

PDF

(1988). Learnability in the Presence of Noise. Proceedings of the Third European Working Session on Learning, EWSL1988, Turing Institute, Glasgow, UK, October 3-5, 1988.

(1988). Apprentissage et calculs.

PDF