The Sigma-Max System Induced from Randomness and Fuzziness
- URL: http://arxiv.org/abs/2110.07722v1
- Date: Tue, 12 Oct 2021 15:55:37 GMT
- Title: The Sigma-Max System Induced from Randomness and Fuzziness
- Authors: Wei Mei, Ming Li, Yuanzeng Cheng and Limin Liu
- Abstract summary: This paper induce probability theory (sigma system) and possibility theory (max system) respectively from randomness and fuzziness.
It is claimed that the long-standing problem of lack of consensus to the foundation of possibility theory is well resolved.
- Score: 6.2983831147593685
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper managed to induce probability theory (sigma system) and
possibility theory (max system) respectively from randomness and fuzziness,
through which the premature theory of possibility is expected to be well
founded. Such an objective is achieved by addressing three open key issues: a)
the lack of clear mathematical definitions of randomness and fuzziness; b) the
lack of intuitive mathematical definition of possibility; c) the lack of
abstraction procedure of the axiomatic definitions of probability/possibility
from their intuitive definitions. Especially, the last issue involves the
question why the key axiom of "maxitivity" is adopted for possibility measure.
By taking advantage of properties of the well-defined randomness and fuzziness,
we derived the important conclusion that "max" is the only but un-strict
disjunctive operator that is applicable across the fuzzy event space, and is an
exact operator for fuzzy feature extraction that assures the max inference is
an exact mechanism. It is fair to claim that the long-standing problem of lack
of consensus to the foundation of possibility theory is well resolved, which
would facilitate wider adoption of possibility theory in practice and promote
cross prosperity of the two uncertainty theories of probability and
possibility.
Related papers
- Barycentric bounds on the error exponents of quantum hypothesis exclusion [7.812210699650153]
We study the optimal error probability of quantum state exclusion from an information-theoretic perspective.
We extend our analysis to the more complicated task of quantum channel exclusion.
arXiv Detail & Related papers (2024-07-18T17:27:36Z) - A Semantic Approach to Decidability in Epistemic Planning (Extended
Version) [72.77805489645604]
We use a novel semantic approach to achieve decidability.
Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity.
We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
arXiv Detail & Related papers (2023-07-28T11:26:26Z) - What is \textit{Quantum} in Probabilistic Explanations of the Sure Thing
Principle Violation? [0.0]
The Prisoner's Dilemma game (PDG) is one of the simple test-beds for the probabilistic nature of the human decision-making process.
Quantum probabilistic models can explain this violation as a second-order interference effect.
We discuss the role of other quantum information-theoretical quantities, such as quantum entanglement, in the decision-making process.
arXiv Detail & Related papers (2023-06-21T00:01:01Z) - 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) - 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) - 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 Unreasonable Effectiveness of Deep Evidential Regression [72.30888739450343]
A new approach with uncertainty-aware regression-based neural networks (NNs) shows promise over traditional deterministic methods and typical Bayesian NNs.
We detail the theoretical shortcomings and analyze the performance on synthetic and real-world data sets, showing that Deep Evidential Regression is a quantification rather than an exact uncertainty.
arXiv Detail & Related papers (2022-05-20T10:10:32Z) - Robustness Guarantees for Credal Bayesian Networks via Constraint
Relaxation over Probabilistic Circuits [16.997060715857987]
We develop a method to quantify the robustness of decision functions with respect to credal Bayesian networks.
We show how to obtain a guaranteed upper bound on MARmax in linear time in the size of the circuit.
arXiv Detail & Related papers (2022-05-11T22:37:07Z) - A Logic-based Tractable Approximation of Probability [0.0]
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.
arXiv Detail & Related papers (2022-05-06T13:25:12Z) - 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) - A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
We propose a weaker assumption that we call $2$-adjacency faithfulness.
We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
arXiv Detail & Related papers (2020-10-27T13:04:08Z)
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.