Peter Grünwald heads the machine learning group at CWI in Amsterdam, the Netherlands. He is also full professor of Statistical Learning at the mathematical institute of Leiden University. He is currently President of the Association for Computational Learning, the organization running COLT, the world’s prime annual conference on machine learning theory. He was co-program chair of COLT in 2015 and also chaired UAI – another top ML conference – in 2010/2011. Apart from publishing at ML venues like NIPS, COLT and UAI, he also regularly contributes to top statistics journals such as the Annals of Statistics. He is the author of the book The Minimum Description Length Principle, (MIT Press, 2007), which has become the standard reference for the MDL approach to learning from data. In 2010 he was co-awarded the Van Dantzig prize, the highest Dutch award in statistics and operations research. He received NWO VIDI (2005), VICI (2010) and TOP-1 (2016) grants.
His research currently focuses on Safety and Luckiness. The basic idea is to make sure that inference from data is done in – indeed – a safer way! Most recent publications/preprints in this direction:
- (safety) P.D. Grünwald and R. de Heide and W. Koolen. Safe Testing. arXiv preprint https://arxiv.org/abs/1906.07801, 2019. A paper that proposes (no less than) a new approach to hypothesis testing, unifying and extending both Bayes factor and frequentist account – the p-value gets replaced by an S-value…
- (safety) J. ter Schure and P. Grünwald, 2019. Accumulation Bias in meta-analysis: the need to consider time in error control. F1000Research 2019, 8:962 (https://doi.org/10.12688/f1000research.19375.1)
- (safety) P.D. Grünwald and T. van Ommen. Inconsistency of Bayesian Inference for Misspecified Linear Models, and a Proposal for Repairing It . Bayesian Analysis, 2017, pp. 1069-1103.
- (safety) P.D. Grünwald. Safe Probability. Journal of Statistical Planning and Inference 195, 2018, pp. 47-63. See also http://arxiv.org/abs/1604.01785.
- (luckiness) P.D. Grünwald and N. Mehta, Proceedings ALT (Algorithmic Learning Theory) 2019. A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity.