Algorithmic minimal sufficient statistics: a new approach
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Algorithmic minimal sufficient statistic revisited
- Algorithmic statistics
- Discussion on Kolmogorov Complexity and Statistical Analysis
- Game arguments in computability theory and algorithmic information theory
- Kolmogorov's Structure Functions and Model Selection
- On algorithmic strong sufficient statistics
- Short lists with short programs in short time
Cited in
(10)- scientific article; zbMATH DE number 2080439 (Why is no real title available?)
- 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)