Counting probability distributions: Differential geometry and model selection

DOI10.1073/pnas.170283897zbMath0997.62099DBLPjournals/pnas/MyungBP00OpenAlexW2169966170WikidataQ35255594 ScholiaQ35255594MaRDI QIDQ4528251

Mark A. Pitt, Vijay Balasubramanian, In Jae Myung

Publication date: 31 January 2001

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.170283897

zbMATH Keywords

minimum description lengthgoodness of fitgeneralizabilitygeometric complexityBayesian selection methods

Mathematics Subject Classification ID

Applications of statistics (62P99) Psychophysics and psychophysiology; perception (91E30) Differential geometry (53-XX)

Related Items (29)

Information geometric complexity of a trivariate Gaussian statistical model ⋮ Prototypes, exemplars and the response scaling parameter: a Bayes factor perspective ⋮ Regularized Aggregation of One-Off Probability Predictions ⋮ Application of the Fisher-Rao metric to structure detection ⋮ Least informative distributions in maximum \(q\)-log-likelihood estimation ⋮ State trace analysis: what it can and cannot do ⋮ A Note on the Applied Use of MDL Approximations ⋮ Computational analysis of CFSE proliferation assay ⋮ A tutorial on Fisher information ⋮ Avoiding the dangers of averaging across subjects when using multidimensional scaling. ⋮ The flexibility of models of recognition memory: the case of confidence ratings ⋮ Length of the state trace: a method for partitioning model complexity ⋮ Regarding the complexity of additive clustering models: comment on Lee (2001). ⋮ The generalized universal law of generalization. ⋮ Theoretical investigations of an information geometric approach to complexity ⋮ A tutorial on Bayes factor estimation with the product space method ⋮ Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach ⋮ The flexibility of models of recognition memory: an analysis by the minimum-description length principle ⋮ On sampling and modeling complex systems ⋮ Information geometric analysis of phase transitions in complex patterns: the case of the Gray-Scott reaction–diffusion model ⋮ Sparse model selection in the highly under-sampled regime ⋮ A Bayesian analysis of retention functions ⋮ An empirical study of minimum description length model selection with infinite parametric complexity ⋮ Bayes factors: Prior sensitivity and model generalizability ⋮ On the Complexity of Logistic Regression Models ⋮ On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model ⋮ Maximal relevance and optimal learning machines ⋮ Minimum description length revisited ⋮ The Fisher-Rao metric for projective transformations of the line

Cites Work

• Stochastic complexity and modeling
• Defining the curvature of a statistical problem (with applications to second order efficiency)
• Estimating the dimension of a model
• Model selection based on minimum description length
• The importance of complexity in model selection
• Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
• Information-theoretic asymptotics of Bayes methods
• Universal coding, information, prediction, and estimation
• Minimum complexity density estimation
• Minimum description length induction, Bayesianism, and Kolmogorov complexity
• Fisher information and stochastic complexity
• On the Length of Programs for Computing Finite Binary Sequences
• Logical basis for information theory and probability theory
• Stochastic complexity and the mdl principle

This page was built for publication: Counting probability distributions: Differential geometry and model selection