Counting probability distributions: Differential geometry and model selection
From MaRDI portal
Recommendations
Cites work
- Defining the curvature of a statistical problem (with applications to second order efficiency)
- Estimating the dimension of a model
- Fisher information and stochastic complexity
- Information-theoretic asymptotics of Bayes methods
- Logical basis for information theory and probability theory
- Minimum complexity density estimation
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- Model selection based on minimum description length
- On the Length of Programs for Computing Finite Binary Sequences
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- Stochastic complexity and modeling
- Stochastic complexity and the mdl principle
- The importance of complexity in model selection
- Universal coding, information, prediction, and estimation
Cited in
(35)- Avoiding the dangers of averaging across subjects when using multidimensional scaling.
- Regarding the complexity of additive clustering models: comment on Lee (2001).
- The generalized universal law of generalization.
- A tutorial on Fisher information
- A Bayesian analysis of retention functions
- Model selection and local geometry
- Least informative distributions in maximum q-log-likelihood estimation
- State trace analysis: what it can and cannot do
- On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
- An empirical study of minimum description length model selection with infinite parametric complexity
- Bayes factors: Prior sensitivity and model generalizability
- The Fisher-Rao metric for projective transformations of the line
- Information geometric complexity of a trivariate Gaussian statistical model
- Prototypes, exemplars and the response scaling parameter: a Bayes factor perspective
- 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
- Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach
- Statistical model and BPS D4-D2-D0 counting
- A Note on the Applied Use of MDL Approximations
- Maximal relevance and optimal learning machines
- Minimum description length revisited
- Regularized Aggregation of One-Off Probability Predictions
- On the complexity of logistic regression models
- Theoretical investigations of an information geometric approach to complexity
- Length of the state trace: a method for partitioning model complexity
- A tutorial on Bayes factor estimation with the product space method
- The flexibility of models of recognition memory: an analysis by the minimum-description length principle
- A simple probabilistic neural network for machine understanding
- Complexity of quantum-mechanical evolutions from probability amplitudes
- Inherent complexity: a problem for statistical model evaluation
- A geometric modeling of Occam's razor in deep learning
- Application of the Fisher-Rao metric to structure detection
- Computational analysis of CFSE proliferation assay
- The flexibility of models of recognition memory: the case of confidence ratings
This page was built for publication: Counting probability distributions: Differential geometry and model selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528251)
