Skip to main content
SpringerLink
Log in

On Algorithmic Strong Sufficient Statistics

  • Conference paper
Book cover The Nature of Computation. Logic, Algorithms, Applications (CiE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7921))

Included in the following conference series:

Abstract

The notion of a strong sufficient statistic was introduced in [8]. In this paper, we give a survey of nice properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much larger than complexity of its minimal sufficient statistic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauwens, B., Makhlin, A., Vereshchagin, N., Zimand, M.: Short lists with short programs in short time. ECCC report TR13-007, http://eccc.hpi-web.de/report/2013/007/

  2. Gács, P., Tromp, J., Vitányi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Th. 47(6), 2443–2463 (2001)

    Article  MATH  Google Scholar 

  3. Kolmogorov, A.N.: Talk at the Information Theory Symposium in Tallinn, Estonia (1974)

    Google Scholar 

  4. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)

    Book  MATH  Google Scholar 

  5. Kh, A.: Shen, Discussion on Kolmogorov complexity and statistical analysis. The Computer Journal 42(4), 340–342 (1999)

    Article  Google Scholar 

  6. Shen, A.: Game Arguments in Computability Theory and Algorithmic Information Theory. In: Cooper, S.B., Dawar, A., Löwe, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 655–666. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Vereshchagin, N.K., Vitányi, P.M.B.: Kolmogorov’s structure functions and model selection. IEEE Trans. Information Theory 50(12), 3265–3290 (2004)

    Article  Google Scholar 

  8. Vereshchagin, N.: Algorithmic Minimal Sufficient Statistic Revisited. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 478–487. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Leninskie gory 1, Moscow, 119991, Russia

    Nikolay Vereshchagin

Authors
  1. Nikolay Vereshchagin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento die Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Piazza dell’Ateneo Nuovo 1, 20126, Milan, Italy

    Paola Bonizzoni

  2. Institute for Theoretical Computer Science, Mathematics and Operations Research, Faculty of Computer Science, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, 85577, Neubiberg, Germany

    Vasco Brattka

  3. Institute for Logic, Language and Computation, University of Amsterdam, Postbus 94242, 1090 GE, Amsterdam, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vereshchagin, N. (2013). On Algorithmic Strong Sufficient Statistics. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39053-1_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39052-4

  • Online ISBN: 978-3-642-39053-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation