Minimum description length revisited (Q4997077)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Minimum description length revisited

scientific article; zbMATH DE number 7363746

Language	Label	Description	Also known as
default for all languages	No label defined
English	Minimum description length revisited	scientific article; zbMATH DE number 7363746

Statements

instance of

scholarly article

0 references

title

Minimum description length revisited (English)

0 references

0 references

0 references

International Journal of Mathematics for Industry

0 references

publication date

28 June 2021

0 references

full work available at URL

https://arxiv.org/abs/1908.08484

0 references

zbMATH Keywords

minimum description length (MDL) principle

0 references

model selection

0 references

penalized estimation

0 references

universal prediction

0 references

describes a project that uses

ElemStatLearn

0 references

Krimp

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Modeling by shortest data description

0 references

Q3995624

0 references

The minimum description length principle in coding and modeling

0 references

An Information Measure for Classification

0 references

Minimum description length induction, Bayesianism, and Kolmogorov complexity

0 references

Bayes Factors

0 references

Q3822087

0 references

Fisher information and stochastic complexity

0 references

Universal coding, information, prediction, and estimation

0 references

Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach

0 references

Counting probability distributions: Differential geometry and model selection

0 references

Q4023085

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

High-dimensional penalty selection via minimum description length principle

0 references

Prediction, Learning, and Games

0 references

The geometry of proper scoring rules

0 references

Understanding machine learning. From theory to algorithms

0 references

Safe probability

0 references

Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation

0 references

Catching up faster by switching sooner: a predictive approach to adaptive estimation with an application to the AIC-BIC dilemma. With discussion and authors' reply

0 references

Almost the best of three worlds: risk, consistency and optional stopping for the switch criterion in nested model selection

0 references

Model selection by sequentially normalized least squares

0 references

Q4473253

0 references

Subset selection in linear regression using sequentially normalized least squares: asymptotic theory

0 references

Achievability of asymptotic minimax regret by horizon-dependent and horizon-independent strategies

0 references

Bayes factors and marginal distributions in invariant situations

0 references

Unified Conditional Frequentist and Bayesian Testing of Composite Hypotheses

0 references

Harold Jeffreys's default Bayes factor hypothesis tests: explanation, extension, and application in psychology

0 references

Probabilistic graphical models.

0 references

Learning Bayesian networks: The combination of knowledge and statistical data

0 references

A linear-time algorithm for computing the multinomial stochastic complexity

0 references

Minimax optimal Bayes mixtures for memoryless sources over large alphabets

0 references

Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets

0 references

On model selection, Bayesian networks, and the Fisher information integral

0 references

Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering

0 references

Asymptotic equivalence of Bayes cross validation and widely applicable information criterion in singular learning theory

0 references

A widely applicable Bayesian information criterion

0 references

Minimum complexity density estimation

0 references

From \(\varepsilon\)-entropy to KL-entropy: analysis of minimum information complexity density estima\-tion

0 references

Information-theoretic upper and lower bounds for statistical estimation

0 references

Finite-Sample Risk Bounds for Maximum Likelihood Estimation With Arbitrary Penalties

0 references

Learning Theory

0 references

Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it

0 references

The safe Bayesian. Learning the learning rate via the mixability gap

0 references

Flat Minima

0 references

PAC-Bayesian stochastic model selection

0 references

PAC-MDL bounds.

0 references

Information and complexity in statistical modeling.

0 references

Krimp: mining itemsets that compress

0 references

Summarizing and understanding large graphs

0 references

Jeffreys versus Shtarkov distributions associated with some natural exponential families

0 references

Relations Between the Conditional Normalized Maximum Likelihood Distributions and the Latent Information Priors

0 references

Identifiers

zbMATH Open document ID

1476.62020

0 references

DOI

10.1142/S2661335219300018

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Minimum description length revisited