A Logic-based Tractable Approximation of Probability
- URL: http://arxiv.org/abs/2205.03198v1
- Date: Fri, 6 May 2022 13:25:12 GMT
- Title: A Logic-based Tractable Approximation of Probability
- Authors: Paolo Baldi and Hykel Hosni
- Abstract summary: We identify the conditions under which propositional probability functions can be approximated by a hierarchy of depth-bounded Belief functions.
We show that our approximations of probability lead to uncertain reasoning which, under the usual assumptions in the field, qualifies as tractable.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We provide a logical framework in which a resource-bounded agent can be seen
to perform approximations of probabilistic reasoning. Our main results read as
follows. First we identify the conditions under which propositional probability
functions can be approximated by a hierarchy of depth-bounded Belief functions.
Second we show that under rather palatable restrictions, our approximations of
probability lead to uncertain reasoning which, under the usual assumptions in
the field, qualifies as tractable.
Related papers
- Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution.
Our method consistently outperforms existing approaches in terms of conditional coverage.
arXiv Detail & Related papers (2024-07-01T20:44:48Z) - $\omega$PAP Spaces: Reasoning Denotationally About Higher-Order,
Recursive Probabilistic and Differentiable Programs [64.25762042361839]
$omega$PAP spaces are spaces for reasoning denotationally about expressive differentiable and probabilistic programming languages.
Our semantics is general enough to assign meanings to most practical probabilistic and differentiable programs.
We establish the almost-everywhere differentiability of probabilistic programs' trace density functions.
arXiv Detail & Related papers (2023-02-21T12:50:05Z) - Relative Probability on Finite Outcome Spaces: A Systematic Examination
of its Axiomatization, Properties, and Applications [0.0]
This work proposes a view of probability as a relative measure rather than an absolute one.
We focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative probability functions.
arXiv Detail & Related papers (2022-12-30T05:16:57Z) - Probabilistic Deduction: an Approach to Probabilistic Structured
Argumentation [1.027974860479791]
Probabilistic Deduction (PD) is an approach to probabilistic structured argumentation.
PD provides a framework to unify probabilistic reasoning with argumentative reasoning.
This is the first work in probabilistic structured argumentation where the joint distribution is not assumed form external sources.
arXiv Detail & Related papers (2022-09-01T03:58:38Z) - Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing.
We study the case where probability distributions are not known a priori but need to be estimated from data.
arXiv Detail & Related papers (2022-08-29T16:16:22Z) - Bounding Counterfactuals under Selection Bias [60.55840896782637]
We propose a first algorithm to address both identifiable and unidentifiable queries.
We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
arXiv Detail & Related papers (2022-07-26T10:33:10Z) - The intersection probability: betting with probability intervals [7.655239948659381]
We propose the use of the intersection probability, a transform derived originally for belief functions in the framework of the geometric approach to uncertainty.
We outline a possible decision making framework for probability intervals, analogous to the Transferable Belief Model for belief functions.
arXiv Detail & Related papers (2022-01-05T17:35:06Z) - Logical Credal Networks [87.25387518070411]
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability.
We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
arXiv Detail & Related papers (2021-09-25T00:00:47Z) - Preferential Structures for Comparative Probabilistic Reasoning [2.0646127669654826]
We show that a natural modification of the preferential approach yields exactly the same logical system as a probabilistic approach.
The same preferential structures used in the study of non-monotonic logics and belief revision may be used in the study of comparative probabilistic reasoning.
arXiv Detail & Related papers (2021-04-06T05:00:20Z) - Invariant Rationalization [84.1861516092232]
A typical rationalization criterion, i.e. maximum mutual information (MMI), finds the rationale that maximizes the prediction performance based only on the rationale.
We introduce a game-theoretic invariant rationalization criterion where the rationales are constrained to enable the same predictor to be optimal across different environments.
We show both theoretically and empirically that the proposed rationales can rule out spurious correlations, generalize better to different test scenarios, and align better with human judgments.
arXiv Detail & Related papers (2020-03-22T00:50:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.