Algorithmic minimal sufficient statistics: a new approach

DOI10.1007/S00224-014-9605-1zbMATH Open1339.68128OpenAlexW2021631302MaRDI QIDQ285518FDOQ285518

Authors: Nikolai K. Vereshchagin 

Publication date: 19 May 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9605-1

Recommendations

• On algorithmic strong sufficient statistics
• Algorithmic minimal sufficient statistic revisited
• Algorithmic statistics
• scientific article; zbMATH DE number 2080439
• Meaningful Information

zbMATH Keywords

denoisingalgorithmic statisticsminimum description lengthrandomness deficiencysufficient statistic

Mathematics Subject Classification ID

Sufficient statistics and fields (62B05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Title not available (Why is that?)
• Short lists with short programs in short time
• Game arguments in computability theory and algorithmic information theory
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic minimal sufficient statistic revisited
• Algorithmic statistics
• Discussion on Kolmogorov Complexity and Statistical Analysis
• On algorithmic strong sufficient statistics

Cited In (10)

• Title not available (Why is that?)
• Algorithmic statistics
• Effective algorithms for solving trace minimization problem in multivariate statistics
• Computational implications of reducing data to sufficient statistics
• Short lists with short programs in short time
• Algorithmic minimal sufficient statistic revisited
• On algorithmic strong sufficient statistics
• Correction to "Algorithmic statistics"
• Algorithmic statistics: forty years later
• Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets

This page was built for publication: Algorithmic minimal sufficient statistics: a new approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285518)