Computationally efficient variational-like approximations of possibilistic inferential models
arXiv:2404.19224 · doi:10.1016/j.ijar.2025.109506
Abstract
Inferential models (IMs) offer provably reliable, data-driven, possibilistic statistical inference. But despite the IM framework's theoretical and foundational advantages, efficient computation is a challenge. This paper presents a simple yet powerful numerical strategy for approximating the IM's possibility contour, or at least its -cut for a specified . Our proposal starts with the specification of a parametric family that, in a certain sense, approximately covers the credal set associated with the IM's possibility measure. Akin to variational inference, we then propose to tune the parameters of that parametric family so that its credible set roughly matches the IM contour's -cut. This parametric -cut matching strategy implies a full approximation to the IM's possibility contour at a fraction of the computational cost associated with previous strategies.
References in corpus (15)
- Variational Inference: A Review for Statisticians
- A General Framework for Updating Belief Distributions
- Inferential models: A framework for prior-free posterior probabilistic inference
- Calibrating general posterior credible regions
- Marginal inferential models: prior-free probabilistic inference on interest parameters
- Conditional inferential models: combining information for prior-free probabilistic inference
- Fast Rates for General Unbounded Loss Functions: from ERM to Generalized Bayes
- False confidence, non-additive beliefs, and valid statistical inference
- Plausibility functions and exact frequentist inference
- On an inferential model construction using generalized associations
- Stochastic Approximation and Newton's Estimate of a Mixing Distribution
- Valid inferential models for prediction in supervised learning problems
- Direct and approximately valid probabilistic inference on a class of statistical functionals
- Possibility-theoretic statistical inference offers performance and probativeness assurances
- Asymptotic efficiency of inferential models and a possibilistic Bernstein--von Mises theorem