Geodesic
Adaptive compression against a countable alphabet
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) (2012).

Voir la notice de l'article provenant de la source Episciences

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 hazard rate. We prove that the auto-censuring (AC) code introduced by Bontemps (2011) is adaptive with respect to the collection of such classes. The analysis builds on the tight characterization of universal redundancy rate in terms of metric entropy by Haussler and Opper (1997) and on a careful analysis of the performance of the AC-coding algorithm. The latter relies on non-asymptotic bounds for maxima of samples from discrete distributions with finite and non-decreasing hazard rate. 
@article{DMTCS_2012_special_262_a16,
     author = {Bontemps, Dominique and Boucheron, Stephane and Gassiat, Elisabeth},
     title = {Adaptive compression against a countable alphabet},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)},
     year = {2012},
     doi = {10.46298/dmtcs.2995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2995/}
}
TY  - JOUR
AU  - Bontemps, Dominique
AU  - Boucheron, Stephane
AU  - Gassiat, Elisabeth
TI  - Adaptive compression against a countable alphabet
JO  - Discrete mathematics & theoretical computer science
PY  - 2012
VL  - DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2995/
DO  - 10.46298/dmtcs.2995
LA  - en
ID  - DMTCS_2012_special_262_a16
ER  - 
%0 Journal Article
%A Bontemps, Dominique
%A Boucheron, Stephane
%A Gassiat, Elisabeth
%T Adaptive compression against a countable alphabet
%J Discrete mathematics & theoretical computer science
%D 2012
%V DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2995/
%R 10.46298/dmtcs.2995
%G en
%F DMTCS_2012_special_262_a16
Bontemps, Dominique; Boucheron, Stephane; Gassiat, Elisabeth. Adaptive compression against a countable alphabet. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) (2012). doi : 10.46298/dmtcs.2995. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2995/

Cité par Sources :