An empirical study of minimum description length model selection with infinite parametric complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 45100 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 578421 (Why is no real title available?)
- scientific article; zbMATH DE number 3189754 (Why is no real title available?)
- A Chain Rule for use with Determinants and Permutations
- A Note on the Applied Use of MDL Approximations
- A Predictive Least-Squares Principle
- Accumulative prediction error and the selection of time series models
- Counting probability distributions: Differential geometry and model selection
- Estimating the dimension of a model
- Fisher information and stochastic complexity
- Information-theoretic asymptotics of Bayes methods
- Jeffreys' prior is asymptotically least favorable under entropy risk
- Learning Theory
- MDL denoising
- Model selection based on minimum description length
- Modeling by shortest data description
- On predictive least squares principles
- Prequential and cross-validated regression estimation
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- The minimum description length principle in coding and modeling
- Universal coding, information, prediction, and estimation
Cited in
(4)
This page was built for publication: An empirical study of minimum description length model selection with infinite parametric complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507908)