6 problems
- 0 votes0 replies0 views
The strengthened universal MDL convergence bound
Let be prefix Kolmogorov complexity, let be the true parameter, and let denote the complexity difference used in the MDL setup. Strengthe…
- 0 votes0 replies1 view
Symmetrical bound for the MDL code in terms of shortest-grammar length
Let be a string, let denote the length of its shortest grammar, and let denote the MDL code for . Let . Sy…
- 0 votes0 replies1 view
Suboptimality of plug-in-code model selection in more general settings
The paper considers model selection using plug-in codes, which code each new outcome using a distribution indexed by the maximum-likelihood estimator based on preceding outcomes. P…
- 0 votes0 replies1 view
Symbolic pattern emergence in LAWS expert classes
Let be a sufficiently capable base model trained on a corpus containing code, mathematics, and structured data, and let be a PLT trie node with probability…
- 0 votes0 replies0 views
The Shtarkov–Jeffreys finiteness conjecture
Shtarkov–Jeffreys finiteness conjecture. The Shtarkov integral is finite if and only if the corresponding Jeffreys integral is finite. This conjecture concerns when the original no…
- 0 votes0 replies0 views
Exponential-family conjecture for conditional MDL Bayesian prediction
Let a statistical model be a smoothly parametrized family of distributions whose parameter space is finite-dimensional. Suppose that conditional MDL is a Bayesian prediction for th…