Jeffrey's update rule as a minimizer of Kullback-Leibler divergence
Carlos Pinz\'on, Catuscia Palamidessi

TL;DR
This paper provides a concise proof that Jeffrey's update rule minimizes the Kullback-Leibler divergence between observations and predictions in Bayesian updating, enhancing theoretical understanding of its optimality.
Contribution
It offers a simplified, high-level proof of Jeffrey's rule as a divergence minimizer, improving clarity over previous derivations.
Findings
Jeffrey's update reduces Kullback-Leibler divergence.
The proof is more concise and high-level than previous versions.
Supports Jeffrey's rule as an optimal Bayesian update method.
Abstract
In this paper, we show a more concise and high level proof than the original one, derived by researcher Bart Jacobs, for the following theorem: in the context of Bayesian update rules for learning or updating internal states that produce predictions, the relative entropy between the observations and the predictions is reduced when applying Jeffrey's update rule to update the internal state.
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
MethodsAttention Is All You Need · Refunds@Expedia|||How do I get a full refund from Expedia? · Linear Layer · Layer Normalization · Byte Pair Encoding · Dense Connections · Residual Connection · Multi-Head Attention · Adam · Softmax
