scientific article; zbMATH DE number 4095371
From MaRDI portal
Publication:3822087
Recommendations
- Universal sequential coding of single messages
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- Faster sequential universal coding via block partitioning
- Multi-alphabet universal coding of memoryless sources
- A sequential algorithm for the universal coding of finite memory sources
Cited in
(42)- On some properties of the NML estimator for Bernoulli strings
- NML, Bayes and true distributions: a comment on Karabatsos and Walker (2006)
- Universal sequential coding of single messages
- Stochastic complexity in learning
- High-dimensional penalty selection via minimum description length principle
- Using the Bayesian Shtarkov solution for predictions
- On model selection, Bayesian networks, and the Fisher information integral
- Sequential network change detection with its applications to ad impact relation analysis
- Hierarchical two-part MDL code for multinomial distributions
- Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions
- Multi-alphabet universal coding of memoryless sources
- Price probabilities: a class of Bayesian and non-Bayesian prediction rules
- A universal identifier for communication channels
- Robust subgroup discovery. Discovering subgroup lists using MDL
- The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
- Individual redundancy of adaptive and weighted source coding
- Universal coding algorithm for a family of context Markov sources
- Model selection by sequentially normalized least squares
- Universal coding for memoryless sources with countably infinite alphabets
- Switching discrete sources and its universal encoding
- A linear-time algorithm for computing the multinomial stochastic complexity
- Optimal universal coding with respect to the maximal individual relative redundancy criterion
- Model selection by normalized maximum likelihood
- Information optimality and Bayesian modelling
- scientific article; zbMATH DE number 3427206 (Why is no real title available?)
- Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
- Faster sequential universal coding via block partitioning
- A sequential algorithm for the universal coding of finite memory sources
- Minimum description length revisited
- Graph Summarization with Latent Variable Probabilistic Models
- scientific article; zbMATH DE number 7625180 (Why is no real title available?)
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Jeffreys versus Shtarkov distributions associated with some natural exponential families
- Direct sequential encoding and decoding for discrete sources
- Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests
- Fast and fully-automated histograms for large-scale data sets
- Online prediction for streaming observational data
- A cheat sheet for Bayesian prediction
- Precise minimax regret for logistic regression with categorical feature values
- A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity
- A geometric modeling of Occam's razor in deep learning
- Learning tree-structured distributions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3822087)
