Discussion of "Frequentist of Coverage of Adaptive Nonparametric Bayesian Credible Sets
Penn collection
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract
The focus of the present paper is on constructing l2 balls as confidence sets. There are some advantages that come with the focus on balls for confidence sets. For bands results in Low (1997) rule out the possibility of adaptation over even a pair of Lipschitz or Sobolev spaces at least for confidence bands that have a guaranteed coverage level. On the other hand, fully rate adaptive confidence balls which do maintain coverage probability can be constructed over Sobolev smoothness levels that range over an interval [α, 2α]. However, this range of models where such adaptation is possible is still quite limited and here the authors develop a theory that applies over a broader class of models. The approach taken, following Gin´e and Nickl (2010) and Bull (2012), is to focus on parameters that are in some sense typical and removing a set of parameter values that cause difficulties at least when constructing adaptive sets. The goal is then to construct fully adaptive confidence sets over the remaining collection of parameter values. In the present paper the parameter values that are kept belong to a class of parameters that they call polished tail sequences and the authors develop results that show that a particular empirical Bayes credible ball is both honest when restricted to such sequences and adaptive in size.