An empirical study of minimum description length model selection with infinite parametric complexity (Q2507908): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter D. Grünwald / rank
Normal rank
 
Property / author
 
Property / author: Peter D. Grünwald / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmp.2005.11.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973600191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum description length principle in coding and modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chain Rule for use with Determinants and Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic asymptotics of Bayes methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jeffreys' prior is asymptotically least favorable under entropy risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection based on minimum description length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prequential and cross-validated regression estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting probability distributions: Differential geometry and model selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Applied Use of MDL Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling by shortest data description / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal coding, information, prediction, and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Predictive Least-Squares Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher information and stochastic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: MDL denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accumulative prediction error and the selection of time series models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On predictive least squares principles / rank
 
Normal rank

Latest revision as of 21:25, 24 June 2024

scientific article
Language Label Description Also known as
English
An empirical study of minimum description length model selection with infinite parametric complexity
scientific article

    Statements

    An empirical study of minimum description length model selection with infinite parametric complexity (English)
    0 references
    0 references
    0 references
    5 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    model selection
    0 references
    minimum description length
    0 references
    prequential code
    0 references
    coding
    0 references
    parametric complexity
    0 references
    0 references