Direct and approximately valid probabilistic inference on a class of statistical functionals
arXiv:2112.10232 · doi:10.1016/j.ijar.2022.09.011
Abstract
Existing frameworks for probabilistic inference assume the quantity of interest is the parameter of a posited statistical model. In machine learning applications, however, often there is no statistical model/parameter; the quantity of interest is a statistical functional, a feature of the underlying distribution. Model-based methods can only handle such problems indirectly, via marginalization from a model parameter to the real quantity of interest. Here we develop a generalized inferential model (IM) framework for direct probabilistic uncertainty quantification on the quantity of interest. In particular, we construct a data-dependent, bootstrap-based possibility measure for uncertainty quantification and inference. We then prove that this new approach provides approximately valid inference in the sense that the plausibility values assigned to hypotheses about the unknowns are asymptotically well-calibrated in a frequentist sense. Among other things, this implies that confidence regions for the underlying functional derived from our proposed IM are approximately valid. The method is shown to perform well in key examples, including quantile regression, and in a personalized medicine application.
32 pages, 5 figures, 1 table. Comments welcome at https://researchers.one/articles/21.12.00004
References in corpus (6)
- Inferential models: A framework for prior-free posterior probabilistic inference
- Validity, consonant plausibility measures, and conformal prediction
- Valid inferential models for prediction in supervised learning problems
- An imprecise-probabilistic characterization of frequentist statistical inference
- Inferential models and possibility measures
- Stochastic optimization for numerical evaluation of imprecise probabilities
Cited by in corpus (4)
- Possibility-theoretic statistical inference offers performance and probativeness assurances
- Asymptotic efficiency of inferential models and a possibilistic Bernstein--von Mises theorem
- Possibilistic inferential models: a review
- Computationally efficient variational-like approximations of possibilistic inferential models