Betting on what is neither verifiable nor falsifiable
- URL: http://arxiv.org/abs/2402.14021v1
- Date: Mon, 29 Jan 2024 17:30:34 GMT
- Title: Betting on what is neither verifiable nor falsifiable
- Authors: Abhimanyu Pallavi Sudhir, Long Tran-Thanh
- Abstract summary: We propose an approach to betting on such events via options, or equivalently as bets on the outcome of a "verification-falsification game"
Our work thus acts as an alternative to the existing framework of Garrabrant induction for logical uncertainty, and relates to the stance known as constructivism in the philosophy of mathematics.
- Score: 18.688474183114085
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Prediction markets are useful for estimating probabilities of claims whose
truth will be revealed at some fixed time -- this includes questions about the
values of real-world events (i.e. statistical uncertainty), and questions about
the values of primitive recursive functions (i.e. logical or algorithmic
uncertainty). However, they cannot be directly applied to questions without a
fixed resolution criterion, and real-world applications of prediction markets
to such questions often amount to predicting not whether a sentence is true,
but whether it will be proven. Such questions could be represented by countable
unions or intersections of more basic events, or as First-Order-Logic sentences
on the Arithmetical Hierarchy (or even beyond FOL, as hyperarithmetical
sentences). In this paper, we propose an approach to betting on such events via
options, or equivalently as bets on the outcome of a
"verification-falsification game". Our work thus acts as an alternative to the
existing framework of Garrabrant induction for logical uncertainty, and relates
to the stance known as constructivism in the philosophy of mathematics;
furthermore it has broader implications for philosophy and mathematical logic.
Related papers
- Local Reasoning about Probabilistic Behaviour for Classical-Quantum
Programs [3.871660145364189]
We propose a new quantum Hoare logic for local reasoning about probabilistic behaviour.
We show that the proof rules in the logic are sound with respect to a denotational semantics.
We formally verify the correctness of non-trivial quantum algorithms including the HHL and Shor's algorithms.
arXiv Detail & Related papers (2023-08-09T07:23:22Z) - Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
We propose a framework for efficient and effective counterfactual inference implemented with neural networks.
The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data.
Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
arXiv Detail & Related papers (2023-06-09T08:30:51Z) - A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality.
Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
arXiv Detail & Related papers (2023-05-19T13:15:48Z) - Logical Satisfiability of Counterfactuals for Faithful Explanations in
NLI [60.142926537264714]
We introduce the methodology of Faithfulness-through-Counterfactuals.
It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation.
It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
arXiv Detail & Related papers (2022-05-25T03:40:59Z) - Attainability and Optimality: The Equalized Odds Fairness Revisited [8.44348159032116]
We consider the attainability of the Equalized Odds notion of fairness.
For classification, we prove that compared to enforcing fairness by post-processing, one can always benefit from exploiting all available features.
While performance prediction can attain Equalized Odds with theoretical guarantees, we also discuss its limitation and potential negative social impacts.
arXiv Detail & Related papers (2022-02-24T01:30:31Z) - 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) - Non-ground Abductive Logic Programming with Probabilistic Integrity
Constraints [2.624902795082451]
In this paper, we consider a richer logic language, coping with probabilistic abduction with variables.
We first present the overall abductive language, and its semantics according to the Distribution Semantics.
We then introduce a proof procedure, obtained by extending one previously presented, and prove its soundness and completeness.
arXiv Detail & Related papers (2021-08-06T10:22:12Z) - Nested Counterfactual Identification from Arbitrary Surrogate
Experiments [95.48089725859298]
We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments.
Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
arXiv Detail & Related papers (2021-07-07T12:51:04Z) - Logical Neural Networks [51.46602187496816]
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning)
Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation.
Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
arXiv Detail & Related papers (2020-06-23T16:55:45Z) - Logic, Probability and Action: A Situation Calculus Perspective [12.47276164048813]
The unification of logic and probability is a long-standing concern in AI.
We explore recent results pertaining to the integration of logic, probability and actions in the situation calculus.
Results are motivated in the context of cognitive robotics.
arXiv Detail & Related papers (2020-06-17T13:49:53Z)
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.