Asymptotic efficiency of inferential models and a possibilistic Bernstein--von Mises theorem
Ryan Martin, Jonathan P. Williams

TL;DR
This paper establishes that inferential models (IMs) can be both finite-sample valid and asymptotically efficient, through a new possibilistic Bernstein--von Mises theorem, aligning IMs with classical efficiency results.
Contribution
It introduces a novel possibilistic Bernstein--von Mises theorem demonstrating IMs' asymptotic efficiency and addresses efficiency in nuisance parameter elimination strategies.
Findings
IMs are asymptotically efficient with finite-sample validity.
The credal set of IMs converges to the Gaussian distribution at the Cramér--Rao bound.
A version of the theorem applies to nuisance parameter elimination, resolving an open question.
Abstract
The inferential model (IM) framework offers an alternative to the classical probabilistic (e.g., Bayesian and fiducial) uncertainty quantification in statistical inference. A key distinction is that classical uncertainty quantification takes the form of precise probabilities and offers only limited large-sample validity guarantees, whereas the IM's uncertainty quantification is imprecise in such a way that exact, finite-sample valid inference is possible. But is the IM's imprecision and finite-sample validity compatible with statistical efficiency? That is, can IMs be both finite-sample valid and asymptotically efficient? This paper gives an affirmative answer to this question via a new possibilistic Bernstein--von Mises theorem that parallels a fundamental Bayesian result. Among other things, our result shows that the IM solution is efficient in the sense that, asymptotically, its…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Neural Networks and Applications · Rough Sets and Fuzzy Logic
