Peter Grünwald

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The Safe Bayesian - Learning the Learning Rate via the Mixability Gap.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation.

[BibT_eX]

[DOI]

Proceedings of the COLT 2011, 2011

Bounds on Individual Risk for Log-loss Predictors.

[BibT_eX]

[DOI]

Proceedings of the COLT 2011, 2011

Safe Learning: bridging the gap between Bayes, MDL and statistical learning theory via empirical convexity.

[BibT_eX]

[DOI]

Proceedings of the COLT 2011, 2011

Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

Adaptive Hedge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010

Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Following the Flattened Leader.

[BibT_eX]

[DOI]

Proceedings of the COLT 2010, 2010

2009

Regret and Jeffreys Integrals in Exp. Families

[BibT_eX]

[DOI]

Peter Harremoës

CoRR, 2009

Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential families.

[BibT_eX]

[DOI]

Peter Harremoës

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Algorithmic information theory

[BibT_eX]

[DOI]

Paul M. B. Vitányi

CoRR, 2008

Entropy Concentration and the Empirical Coding Game

[BibT_eX]

[DOI]

CoRR, 2008

Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma

[BibT_eX]

[DOI]

Tim van Erven

CoRR, 2008

A Game-Theoretic Analysis of Updating Sets of Probabilities.

[BibT_eX]

[DOI]

Proceedings of the UAI 2008, 2008

The Catch-Up Phenomenon.

[BibT_eX]

[DOI]

Tim van Erven

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

The Catch-Up Phenomenon in Bayesian Inference.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Suboptimal behavior of Bayes and MDL in classification under misspecification.

[BibT_eX]

[DOI]

John Langford

Mach. Learn., 2007

Information Theoretic Methods for Bioinformatics.

[BibT_eX]

[DOI]

EURASIP J. Bioinform. Syst. Biol., 2007

Christopher S. Wallace <i>Statistical and Inductive Inference by Minimum Message Length.</i> Springer (2005), ISBN 038723795X 432 pp, Hardbound.

[BibT_eX]

[DOI]

Comput. J., 2007

Catching Up Faster in Bayesian Model Selection and Model Averaging.

[BibT_eX]

[DOI]

Tim van Erven

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2005

The statistical strength of nonlocality proofs.

[BibT_eX]

[DOI]

Wim van Dam

Richard D. Gill

IEEE Trans. Inf. Theory, 2005

On Discriminative Bayesian Network Classifiers and Logistic Regression.

[BibT_eX]

[DOI]

Mach. Learn., 2005

An Empirical Study of MDL Model Selection with Infinite Parametric Complexity

[BibT_eX]

[DOI]

CoRR, 2005

Generalization to Unseen Cases.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

MDL model selection using the ML plug-in code.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic Log-Loss of Prequential Maximum Likelihood Codes.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

Suboptimal behaviour of Bayes and MDL in classification under misspecification

[BibT_eX]

[DOI]

John Langford

CoRR, 2004

A tutorial introduction to the minimum description length principle

[BibT_eX]

[DOI]

CoRR, 2004

Shannon Information and Kolmogorov Complexity

[BibT_eX]

[DOI]

Paul M. B. Vitányi

CoRR, 2004

When Ignorance is Bliss.

[BibT_eX]

[DOI]

Proceedings of the UAI '04, 2004

2003

Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers.

[BibT_eX]

[DOI]

Paul M. B. Vitányi

J. Log. Lang. Inf., 2003

Updating Probabilities.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2003

When Discriminative Learning of Bayesian Network Parameters Is Easy.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-03, 2003

A Minimum Descriptipn Length Approach to Grammar Inference.

[BibT_eX]

Proceedings of the Workshop and Tutorial on Learning Contex-Free Grammars, 2003

2002

Game theory, maximum generalized entropy, minimum discrepancy, robust Bayes and Pythagoras.

[BibT_eX]

[DOI]

A. Philip Dawid

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001

Strong Entropy Concentration, Game Theory, and Algorithmic Randomness.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2001

2000

On predictive distributions and Bayesian networks.

[BibT_eX]

[DOI]

Stat. Comput., 2000

Maximum Entropy and the Glasses You are Looking Through.

[BibT_eX]

[DOI]

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

1999

Viewing all Models as "Probabilistic".

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Minimum Encoding Approaches for Predictive Modeling.

[BibT_eX]

[DOI]