# Learning Approximately Objective Priors

arXiv: https://arxiv.org/abs/1704.01168 · HTML: https://mlsanity.com/paper/1704.01168/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Apr 2017.

## Built on by (most cited first, 3 of 3)

- [A Generative Model of Symmetry Transformations](https://mlsanity.com/paper/2403.01946/) (2024)
- [Far from Asymptopia](https://mlsanity.com/paper/2205.03343/) (2022)
- [Minimum Description Length Control](https://mlsanity.com/paper/2207.08258/) (2022)

## Abstract (arXiv)

Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques for learning reference prior approximations: we select a parametric family and optimize a black-box lower bound on the reference prior objective to find the member of the family that serves as a good approximation. We experimentally demonstrate the method's effectiveness by recovering Jeffreys priors and learning the Variational Autoencoder's reference prior.