Variational inference for approximate reference priors using neural networks

📅 2025-02-04
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
Analytic computation of reference priors—particularly Jeffreys priors—is intractable in small-sample Bayesian inference. Method: This paper proposes a neural variational inference framework that automatically learns parameterized approximations to reference priors. It is the first approach to integrate variational inference with deep neural networks for objective prior approximation; it enforces prior propriety via constrained optimization and enables efficient posterior recovery via MCMC even when the prior density is analytically unavailable. Contribution/Results: Experiments across diverse statistical models demonstrate successful reconstruction of theoretical reference priors, joint optimization of prior and posterior, and substantial improvements in objectivity and accuracy of Bayesian estimation under small-sample regimes.

Technology Category

Machine Learning: Bayesian LearningReasoning under Uncertainty: Relational Probabilistic ModelsSearch and Optimization: Sampling/Simulation-based Search

Application Category

Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphsSearch and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for rankingWeb Mining and Content Analysis: Large pretrained models with web data
📝 Abstract
In Bayesian statistics, the choice of the prior can have an important influence on the posterior and the parameter estimation, especially when few data samples are available. To limit the added subjectivity from a priori information, one can use the framework of reference priors. However, computing such priors is a difficult task in general. We develop in this paper a flexible algorithm based on variational inference which computes approximations of reference priors from a set of parametric distributions using neural networks. We also show that our algorithm can retrieve reference priors when constraints are specified in the optimization problem to ensure the solution is proper. We propose a simple method to recover a relevant approximation of the parametric posterior distribution using Markov Chain Monte Carlo (MCMC) methods even if the density function of the parametric prior is not known in general. Numerical experiments on several statistical models of increasing complexity are presented. We show the usefulness of this approach by recovering the target distribution. The performance of the algorithm is evaluated on the prior distributions as well as the posterior distributions, jointly using variational inference and MCMC sampling.
Problem

Research questions and friction points this paper is trying to address.

Develops a variational inference algorithm using neural networks to approximate objective priors.
Focuses on reference priors, particularly Jeffreys priors, for Bayesian parameter estimation with limited data.
Proposes a method to recover posterior approximations via MCMC when prior densities are unknown.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Variational inference approximates Jeffreys priors via neural networks
Algorithm retrieves modified Jeffreys priors under optimization constraints
MCMC recovers posterior despite unknown parametric prior density
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.