Peter Grünwald

Orcid: 0000-0001-9832-9936

Affiliations:
  • National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands


According to our database1, Peter Grünwald authored at least 79 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Minimax Risk Classifiers with 0-1 Loss.
J. Mach. Learn. Res., 2023

Universal Reverse Information Projections and Optimal E-statistics.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Safe Sequential Testing and Effect Estimation in Stratified Count Data.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Log-optimal anytime-valid E-values.
Int. J. Approx. Reason., 2022

Robust subgroup discovery.
Data Min. Knowl. Discov., 2022

Game-theoretic statistics and safe anytime-valid inference.
CoRR, 2022

The no-free-lunch theorems of supervised learning.
CoRR, 2022

2021
Safe Tests and Always-Valid Confidence Intervals for contingency tables and beyond.
CoRR, 2021

The Safe Logrank Test: Error Control under Optional Stopping, Continuation and Prior Misspecification.
Proceedings of AAAI Symposium on Survival Prediction, 2021

PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes.
Proceedings of the Conference on Learning Theory, 2021

2020
Fast Rates for General Unbounded Loss Functions: From ERM to Generalized Bayes.
J. Mach. Learn. Res., 2020

Discovering Outstanding Subgroup Lists for Numeric Targets Using MDL.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Safe Testing.
Proceedings of the Information Theory and Applications Workshop, 2020

Safe-Bayesian Generalized Linear Regression.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Minimum Description Length Revisited.
CoRR, 2019

PAC-Bayes Un-Expected Bernstein Inequality.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2019

A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity.
Proceedings of the Algorithmic Learning Theory, 2019

2018
Optional Stopping with Bayes Factors: a categorization and extension of folklore results, with an application to invariant situations.
CoRR, 2018

2016
Explicit Bounds for Entropy Concentration Under Linear Constraints.
IEEE Trans. Inf. Theory, 2016

Robust probability updating.
Int. J. Approx. Reason., 2016

Fast Rates with Unbounded Losses.
CoRR, 2016

Safe Probability.
CoRR, 2016

Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Fast rates in statistical and online learning.
J. Mach. Learn. Res., 2015

Worst-case Optimal Probability Updating.
CoRR, 2015

Conference on Learning Theory 2015: Preface.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Follow the leader if you can, hedge if you must.
J. Mach. Learn. Res., 2014

Learning the Learning Rate for Prediction with Expert Advice.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

RealKrimp - Finding Hyperintervals that Compress with MDL for Real-Valued Data.
Proceedings of the Advances in Intelligent Data Analysis XIII, 2014

2013
Safe Probability: Restricted Conditioning and Extended Marginalization.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families.
Proceedings of the COLT 2013, 2013

2012
Commentary on "The Optimality of Jeffreys Prior for Online Density Estimation and the Asymptotic Normality of Maximum Likelihood Estimators".
Proceedings of the COLT 2012, 2012

Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (2010)
CoRR, 2012

Mixability in Statistical Learning.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Sequential normalized maximum likelihood in log-loss prediction.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The Safe Bayesian - Learning the Learning Rate via the Mixability Gap.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation.
Proceedings of the COLT 2011, 2011

Bounds on Individual Risk for Log-loss Predictors.
Proceedings of the COLT 2011, 2011

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

Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration.
J. Artif. Intell. Res., 2011

Adaptive Hedge.
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.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Following the Flattened Leader.
Proceedings of the COLT 2010, 2010

2009
Regret and Jeffreys Integrals in Exp. Families
CoRR, 2009

Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential families.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Algorithmic information theory
CoRR, 2008

Entropy Concentration and the Empirical Coding Game
CoRR, 2008

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

A Game-Theoretic Analysis of Updating Sets of Probabilities.
Proceedings of the UAI 2008, 2008

The Catch-Up Phenomenon.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

The Catch-Up Phenomenon in Bayesian Inference.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Suboptimal behavior of Bayes and MDL in classification under misspecification.
Mach. Learn., 2007

Information Theoretic Methods for Bioinformatics.
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.
Comput. J., 2007

Catching Up Faster in Bayesian Model Selection and Model Averaging.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2005
The statistical strength of nonlocality proofs.
IEEE Trans. Inf. Theory, 2005

On Discriminative Bayesian Network Classifiers and Logistic Regression.
Mach. Learn., 2005

An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
CoRR, 2005

MDL model selection using the ML plug-in code.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic Log-Loss of Prequential Maximum Likelihood Codes.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Generalization to Unseen Cases.
Proceedings of the BNAIC 2005, 2005

2004
Suboptimal behaviour of Bayes and MDL in classification under misspecification
CoRR, 2004

A tutorial introduction to the minimum description length principle
CoRR, 2004

Shannon Information and Kolmogorov Complexity
CoRR, 2004

When Ignorance is Bliss.
Proceedings of the UAI '04, 2004

2003
Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers.
J. Log. Lang. Inf., 2003

Updating Probabilities.
J. Artif. Intell. Res., 2003

When Discriminative Learning of Bayesian Network Parameters Is Easy.
Proceedings of the IJCAI-03, 2003

A Minimum Descriptipn Length Approach to Grammar Inference.
Proceedings of the Workshop and Tutorial on Learning Contex-Free Grammars, 2003

2002
Game theory, maximum generalized entropy, minimum discrepancy, robust Bayes and Pythagoras.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
Strong Entropy Concentration, Game Theory, and Algorithmic Randomness.
Proceedings of the Computational Learning Theory, 2001

2000
On predictive distributions and Bayesian networks.
Stat. Comput., 2000

Maximum Entropy and the Glasses You are Looking Through.
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".
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
Minimum Encoding Approaches for Predictive Modeling.
Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Bayesian and Information-Theories Priors for Bayesian Network Parameters.
Proceedings of the Machine Learning: ECML-98, 1998

1997
Causation and Nonmonotonic Temporal Reasoning.
Proceedings of the KI-97: Advances in Artificial Intelligence, 1997

1995
A minimum description length approach to grammar inference.
Proceedings of the Connectionist, 1995


  Loading...