
TL;DR
This paper surveys various updating (conditioning) methods, emphasizing their practical interpretation and illustrating their differences through an example, highlighting that no single rule is universally best.
Contribution
It provides a practical perspective on multiple updating schemes, clarifying their meanings and applications through an illustrative example, complementing existing mathematical surveys.
Findings
Different updating schemes have distinct practical implications.
No single updating rule is universally optimal.
An illustrative example clarifies the differences among conditioning methods.
Abstract
Survey of several forms of updating, with a practical illustrative example. We study several updating (conditioning) schemes that emerge naturally from a common scenarion to provide some insights into their meaning. Updating is a subtle operation and there is no single method, no single 'good' rule. The choice of the appropriate rule must always be given due consideration. Planchet (1989) presents a mathematical survey of many rules. We focus on the practical meaning of these rules. After summarizing the several rules for conditioning, we present an illustrative example in which the various forms of conditioning can be explained.
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
TopicsConstraint Satisfaction and Optimization
