Saved in:
Bibliographic Details
Main Authors: Cella, Leonardo, Martin, Ryan
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2404.19224
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918085530746880
author Cella, Leonardo
Martin, Ryan
author_facet Cella, Leonardo
Martin, Ryan
contents 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 $α\in (0,1)$. 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 $100(1-α)\%$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2404_19224
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Computationally efficient variational-like approximations of possibilistic inferential models
Cella, Leonardo
Martin, Ryan
Computation
Methodology
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 $α\in (0,1)$. 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 $100(1-α)\%$ 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.
title Computationally efficient variational-like approximations of possibilistic inferential models
topic Computation
Methodology
url https://arxiv.org/abs/2404.19224