Optimal sampling of parametric families: implications for machine learning
From MaRDI portal
Recommendations
Cites work
- A strong version of the redundancy-capacity theorem of universal coding
- Fisher information and stochastic complexity
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1150732 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Information and complexity in statistical modeling.
- Nonparametric risk bounds for time-series forecasting
- Predictors for the first-order autoregressive process
- Properties of Predictors for Autoregressive Time Series
- The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem
- Theory of statistical inference and information. Transl. from the Slovak by the author
- Universal coding, information, prediction, and estimation
- Universal prediction
Cited in
(2)
This page was built for publication: Optimal sampling of parametric families: implications for machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131174)