Judicious Judgment Meets Unsettling Updating: Dilation, Sure Loss, and Simpson's Paradox
Not on the map. Why?
Abstract (arXiv)
Statistical learning using imprecise probabilities is gaining more attention because it presents an alternative strategy for reducing irreplicable findings by freeing the user from the task of making up unwarranted high-resolution assumptions. However, model updating as a mathematical operation is inherently exact, hence updating imprecise models requires the user's judgment in choosing among competing updating rules. These rules often lead to incompatible inferences, and can exhibit unsettling phenomena like dilation, contraction and sure loss, which cannot occur with the Bayes rule and precise probabilities. We revisit a number of famous "paradoxes", including the three prisoners/Monty Hall problem, revealing that a logical fallacy arises from a set of marginally plausible yet jointly incommensurable assumptions when updating the underlying imprecise model. We establish an equivalence between Simpson's paradox and an implicit adoption of a pair of aggregation rules that induce sure loss. We also explore behavioral discrepancies between the generalized Bayes rule, Dempster's rule and the Geometric rule as alternative posterior updating rules for Choquet capacities of order 2. We show that both the generalized Bayes rule and Geometric rule are incapable of updating without prior information regardless of how strong the information in our data is, and that Dempster's rule and the Geometric rule can mathematically contradict each other with respect to dilation and contraction. Our findings show that unsettling updates reflect a collision between the rules' assumptions and the inexactness allowed by the model itself, highlighting the invaluable role of judicious judgment in handling low-resolution information, and the care we must take when applying learning rules to update imprecise probabilities.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Dec 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 2; 2025: 1; 2026: 2.
8 papers.
- 2023Credal Bayesian Deep Learningcited by 45
- 2024Credal Learning Theorycited by 30
- 2023A Novel Bayes' Theorem for Upper Probabilitiescited by 13
- 2023Distributionally Robust Statistical Verification with Imprecise Neural Networkscited by 12
- 2025Conformal Prediction Regions are Imprecise Highest Density Regionscited by 7
- 2024Optimal Transport for ε-Contaminated Credal Sets: To the Memory of Sayan Mukherjeecited by 0
- 2026Robust Predictive Uncertainty and Double Descent in Contaminated Bayesian Random Featurescited by 0
- 2026Binary Expansion Group Intersection Networkcited by 0
- 2026Binary Expansion Group Intersection Network25 Mar 2026
- 2026Robust Predictive Uncertainty and Double Descent in Contaminated Bayesian Random Features22 Feb 2026
- 2025Conformal Prediction Regions are Imprecise Highest Density Regions10 Feb 2025
- 2024Optimal Transport for ε-Contaminated Credal Sets: To the Memory of Sayan Mukherjee4 Oct 2024
- 2024Credal Learning Theory1 Feb 2024
- 2023Distributionally Robust Statistical Verification with Imprecise Neural Networks28 Aug 2023
- 2023A Novel Bayes' Theorem for Upper Probabilities13 Jul 2023
- 2023Credal Bayesian Deep Learning19 Feb 2023