Logic of subjective probability
- URL: http://arxiv.org/abs/2309.01173v1
- Date: Sun, 3 Sep 2023 13:31:40 GMT
- Title: Logic of subjective probability
- Authors: Vladimir Vovk
- Abstract summary: I discuss both syntax and semantics of subjective probability.
Jeffreys's law states that two successful probability forecasters must issue forecasts that are close to each other.
I will discuss connections between subjective and frequentist probability.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper I discuss both syntax and semantics of subjective probability.
The semantics determines ways of testing probability statements. Among
important varieties of subjective probabilities are intersubjective
probabilities and impersonal probabilities, and I will argue that well-tested
impersonal probabilities acquire features of objective probabilities.
Jeffreys's law, my next topic, states that two successful probability
forecasters must issue forecasts that are close to each other, thus supporting
the idea of objective probabilities. Finally, I will discuss connections
between subjective and frequentist probability.
Related papers
- Can a Bayesian Oracle Prevent Harm from an Agent? [48.12936383352277]
We consider estimating a context-dependent bound on the probability of violating a given safety specification.
Noting that different plausible hypotheses about the world could produce very different outcomes, we derive on the safety violation probability predicted under the true but unknown hypothesis.
We consider two forms of this result, in the iid case and in the non-iid case, and conclude with open problems towards turning such results into practical AI guardrails.
arXiv Detail & Related papers (2024-08-09T18:10:42Z) - How Does Bayes Error Limit Probabilistic Robust Accuracy [3.350980549219263]
Adversarial examples pose a security threat to many critical systems built on neural networks.
Probability of having same label with a vicinity is $ge 1-kappa$.
Training methods for probabilistic robustness still experience non-trivial accuracy loss.
arXiv Detail & Related papers (2024-05-23T17:51:36Z) - BIRD: A Trustworthy Bayesian Inference Framework for Large Language Models [52.46248487458641]
Predictive models often need to work with incomplete information in real-world tasks.
Current large language models (LLM) are insufficient for such accurate estimations.
We propose BIRD, a novel probabilistic inference framework.
arXiv Detail & Related papers (2024-04-18T20:17:23Z) - Reconciling Individual Probability Forecasts [78.0074061846588]
We show that two parties who agree on the data cannot disagree on how to model individual probabilities.
We conclude that although individual probabilities are unknowable, they are contestable via a computationally and data efficient process.
arXiv Detail & Related papers (2022-09-04T20:20:35Z) - Combining Predictions under Uncertainty: The Case of Random Decision
Trees [2.322689362836168]
A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class.
In this paper, we investigate a number of alternative prediction methods.
Our methods are inspired by the theories of probability, belief functions and reliable classification.
arXiv Detail & Related papers (2022-08-15T18:36:57Z) - Uncertainty estimation of pedestrian future trajectory using Bayesian
approximation [137.00426219455116]
Under dynamic traffic scenarios, planning based on deterministic predictions is not trustworthy.
The authors propose to quantify uncertainty during forecasting using approximation which deterministic approaches fail to capture.
The effect of dropout weights and long-term prediction on future state uncertainty has been studied.
arXiv Detail & Related papers (2022-05-04T04:23:38Z) - Bayesianism, Conditional Probability and Laplace Law of Succession in
Quantum Mechanics [0.0]
We show that as with the classical probability, all these issues can be resolved affirmatively in the quantum probability.
This implies that the relation between the Bayesian probability and the relative frequency in quantum mechanics is the same as that in the classical probability theory.
arXiv Detail & Related papers (2021-12-16T04:55:10Z) - 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) - Multivariate Probabilistic Regression with Natural Gradient Boosting [63.58097881421937]
We propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution.
Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches.
arXiv Detail & Related papers (2021-06-07T17:44:49Z) - Handling Epistemic and Aleatory Uncertainties in Probabilistic Circuits [18.740781076082044]
We propose an approach to overcome the independence assumption behind most of the approaches dealing with a large class of probabilistic reasoning.
We provide an algorithm for Bayesian learning from sparse, albeit complete, observations.
Each leaf of such circuits is labelled with a beta-distributed random variable that provides us with an elegant framework for representing uncertain probabilities.
arXiv Detail & Related papers (2021-02-22T10:03:15Z)
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.