On Exact Bayesian Credible Sets for Classification and Pattern Recognition
The current definition of a Bayesian credible set cannot, in general, achieve an arbitrarily preassigned credible level. This drawback is particularly acute for classification problems, where there are only a finite number of achievable credible levels. As a result, there is as of today no general way to construct an exact credible set for classification. In this paper, we introduce a generalized credible set that can achieve any preassigned credible level. The key insight is a simple connection between the Bayesian highest posterior density credible set and the Neyman--Pearson lemma, which, as far as we know, hasn't been noticed before. Using this connection, we introduce a randomized decision rule to fill the gaps among the discrete credible levels. Accompanying this methodology, we also develop the Steering Wheel Plot to represent the credible set, which is useful in visualizing the uncertainty in classification. By developing the exact credible set for discrete parameters, we make the theory of Bayesian inference more complete.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceClassificationLEMMASimilar Papers 제목 키워드 기반
Double Robust Bayesian Inference on Average Treatment Effects
We propose a double robust Bayesian inference procedure on the average treatment effect (ATE) under unconfoundedness. For our new Bayesian approach, we first adjust the prior distributions of the conditional mean functio…
Bayesian InferenceFrequentist coverage and sup-norm convergence rate in Gaussian process regression
Gaussian process (GP) regression is a powerful interpolation technique due to its flexibility in capturing non-linearity. In this paper, we provide a general framework for understanding the frequentist coverage of point-…
regressionOn Gaussian Process Priors in Conditional Moment Restriction Models
This paper studies quasi Bayesian estimation and uncertainty quantification for an unknown function that is identified by a nonparametric conditional moment restriction. We derive contraction rates for a class of Gaussia…
Uncertainty QuantificationGaussian credible intervals in Bayesian nonparametric estimation of the unseen
The unseen-species problem assumes $n\geq1$ samples from a population of individuals belonging to different species, possibly infinite, and calls for estimating the number $K_{n,m}$ of hitherto unseen species that would …
Computational EfficiencyAccurate Uncertainties for Deep Learning Using Calibrated Regression
Methods for reasoning under uncertainty are a key building block of accurate and reliable machine learning systems. Bayesian methods provide a general framework to quantify uncertainty. However, because of model misspeci…
Deep LearningModel-based Reinforcement LearningregressionReinforcement Learning+4