Minimum description length revisited
From MaRDI portal
Publication:4997077
DOI10.1142/S2661335219300018zbMath1476.62020arXiv1908.08484OpenAlexW3098044966WikidataQ109278499 ScholiaQ109278499MaRDI QIDQ4997077
Publication date: 28 June 2021
Published in: International Journal of Mathematics for Industry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.08484
Inference from stochastic processes and prediction (62M20) Foundations and philosophical topics in statistics (62A01) Statistical ranking and selection procedures (62F07) Statistical aspects of information-theoretic topics (62B10)
Related Items
Marginal Likelihood Computation for Model Selection and Hypothesis Testing: An Extensive Review ⋮ Unsupervised discretization by two-dimensional MDL-based histogram ⋮ The no-free-lunch theorems of supervised learning ⋮ Robust subgroup discovery. Discovering subgroup lists using MDL
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Harold Jeffreys's default Bayes factor hypothesis tests: explanation, extension, and application in psychology
- Krimp: mining itemsets that compress
- Jeffreys versus Shtarkov distributions associated with some natural exponential families
- From \(\varepsilon\)-entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- The geometry of proper scoring rules
- Modeling by shortest data description
- PAC-Bayesian stochastic model selection
- High-dimensional penalty selection via minimum description length principle
- On model selection, Bayesian networks, and the Fisher information integral
- Safe probability
- Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it
- Learning Bayesian networks: The combination of knowledge and statistical data
- Model selection by sequentially normalized least squares
- A linear-time algorithm for computing the multinomial stochastic complexity
- Subset Selection in Linear Regression using Sequentially Normalized Least Squares: Asymptotic Theory
- Relations Between the Conditional Normalized Maximum Likelihood Distributions and the Latent Information Priors
- Flat Minima
- The Safe Bayesian
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation
- Information-theoretic upper and lower bounds for statistical estimation
- Universal coding, information, prediction, and estimation
- Minimum complexity density estimation
- Unified Conditional Frequentist and Bayesian Testing of Composite Hypotheses
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- Counting probability distributions: Differential geometry and model selection
- Finite-Sample Risk Bounds for Maximum Likelihood Estimation With Arbitrary Penalties
- Almost the Best of Three Worlds: Risk, Consistency and Optional Stopping for the Switch Criterion in Nested Model Selection
- Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma
- Learning Theory
- The minimum description length principle in coding and modeling
- Bayes Factors
- Fisher information and stochastic complexity
- Summarizing and understanding large graphs
- Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets
- Learning Theory and Kernel Machines
- Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering
- Prediction, Learning, and Games
- Understanding Machine Learning
- An Information Measure for Classification
- The elements of statistical learning. Data mining, inference, and prediction
