Probability Bracket Notation: Multivariable Systems and Static Bayesian Networks

• URL: http://arxiv.org/abs/1207.5293v3
• Date: Sat, 08 Mar 2025 18:18:20 GMT
• Title: Probability Bracket Notation: Multivariable Systems and Static Bayesian Networks
• Authors: Xing M. Wang,
• Abstract summary: The Probability Bracket Notation (PBN) is used to analyze multiple discrete random variables in static Bayesian Networks.<n>We briefly introduce the definitions of probability distributions in multivariable systems and their presentations using PBN.<n>We show the reasoning capabilities of the Student BN using bottom-up and top-down approaches, validated by Elvira software.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Probability Bracket Notation (PBN) is used to analyze multiple discrete random variables in static Bayesian Networks (BN) through probabilistic graphical models. We briefly introduce the definitions of probability distributions in multivariable systems and their presentations using PBN, then explore the well-known student BN. Our analysis includes calculating various joint, marginal, intermediate, and conditional probability distributions, completing homework assignments, examining relationships between variables (dependence, independence, and conditional independence), and disclosing the power of and restrictions on inserting P-identity operators. We also show the reasoning capabilities of the Student BN using bottom-up and top-down approaches, validated by Elvira software. In the last section, we discuss BNs with continuous variables. After reviewing linear Gaussian networks, we introduce a customized Healthcare BN that includes continuous and discrete random variables, incorporates user-specific data, and offers tailored predictions through discrete-display (DD) nodes, serving as proxies for their continuous variable parents. Our investigation demonstrates that the PBN delivers a reliable and efficient approach for managing multiple variables in static Bayesian networks, a crucial aspect of Machine Learning (ML) and Artificial Intelligence (AI).

Related papers

• Probabilistic Graphical Models: A Concise Tutorial [67.95025153592505]
  Probabilistic graphical modeling is a branch of machine learning that uses probability distributions to describe the world.<n>This tutorial provides a concise introduction to the formalisms, methods, and applications of this modeling framework.
  arXiv  Detail & Related papers  (2025-07-23T01:36:44Z)
• Probability Bracket Notation for Probability Modeling [0.0]
  We propose the Bracket Notation (PBN) by defining a probability-bra (P-bra), P-ket, P-bracket, P-identity, etc.<n>Using the PBN, many formulae, such as normalizations and expectations in systems of one or more random variables, can now be written in abstract basis-independent expressions.
  arXiv  Detail & Related papers  (2025-02-06T17:42:53Z)
• Structural Entropy Guided Probabilistic Coding [52.01765333755793]
  We propose a novel structural entropy-guided probabilistic coding model, named SEPC.<n>We incorporate the relationship between latent variables into the optimization by proposing a structural entropy regularization loss.<n> Experimental results across 12 natural language understanding tasks, including both classification and regression tasks, demonstrate the superior performance of SEPC.
  arXiv  Detail & Related papers  (2024-12-12T00:37:53Z)
• $χ$SPN: Characteristic Interventional Sum-Product Networks for Causal Inference in Hybrid Domains [19.439265962277716]
  We propose aCharacteristic Interventional Sum-Product Network ($chi$SPN) that is capable of estimating interventional distributions in presence of random variables. $chi$SPN uses characteristic functions in the leaves of an interventional SPN (iSPN) thereby providing a unified view for discrete and continuous random variables. A neural network is used to estimate the parameters of the learned iSPN using the intervened data.
  arXiv  Detail & Related papers  (2024-08-14T13:31:32Z)
• A Note on Bayesian Networks with Latent Root Variables [56.86503578982023]
  We show that the marginal distribution over the remaining, manifest, variables also factorises as a Bayesian network, which we call empirical. A dataset of observations of the manifest variables allows us to quantify the parameters of the empirical Bayesian net.
  arXiv  Detail & Related papers  (2024-02-26T23:53:34Z)
• Gaussian Mixture Models for Affordance Learning using Bayesian Networks [50.18477618198277]
  Affordances are fundamental descriptors of relationships between actions, objects and effects. This paper approaches the problem of an embodied agent exploring the world and learning these affordances autonomously from its sensory experiences.
  arXiv  Detail & Related papers  (2024-02-08T22:05:45Z)
• Human Trajectory Forecasting with Explainable Behavioral Uncertainty [63.62824628085961]
  Human trajectory forecasting helps to understand and predict human behaviors, enabling applications from social robots to self-driving cars. Model-free methods offer superior prediction accuracy but lack explainability, while model-based methods provide explainability but cannot predict well. We show that BNSP-SFM achieves up to a 50% improvement in prediction accuracy, compared with 11 state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-07-04T16:45:21Z)
• Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks [25.132159381873656]
  We introduce Graph-Induced Sum-Product Networks (GSPNs), a new probabilistic framework for graph representation learning. We show the model's competitiveness on scarce supervision scenarios, under missing data, and for graph classification in comparison to popular neural models.
  arXiv  Detail & Related papers  (2023-05-17T20:02:08Z)
• On the Foundations of Cycles in Bayesian Networks [4.312746668772342]
  We present a foundational study regarding semantics for cyclic BNs that are generic and conservatively extend the cycle-free setting. First, we propose constraint-based semantics that specify requirements for full joint distributions over a BN to be consistent with the local conditional probabilities and independencies. Second, two kinds of limit semantics that formalize infinite unfolding approaches are introduced and shown to be computable by a Markov chain construction.
  arXiv  Detail & Related papers  (2023-01-20T14:40:17Z)
• Distributional Gradient Boosting Machines [77.34726150561087]
  Our framework is based on XGBoost and LightGBM. We show that our framework achieves state-of-the-art forecast accuracy.
  arXiv  Detail & Related papers  (2022-04-02T06:32:19Z)
• Hybrid Bayesian network discovery with latent variables by scoring multiple interventions [5.994412766684843]
  We present the hybrid mFGS-BS (majority rule and Fast Greedy equivalence Search with Bayesian Scoring) algorithm for structure learning from discrete data. The algorithm assumes causal insufficiency in the presence of latent variables and produces a Partial Ancestral Graph (PAG) Experimental results show that mFGS-BS improves structure learning accuracy relative to the state-of-the-art and it is computationally efficient.
  arXiv  Detail & Related papers  (2021-12-20T14:54:41Z)
• Recursive Bayesian Networks: Generalising and Unifying Probabilistic Context-Free Grammars and Dynamic Bayesian Networks [0.0]
  Probabilistic context-free grammars (PCFGs) and dynamic Bayesian networks (DBNs) are widely used sequence models with complementary strengths and limitations. We present Recursive Bayesian Networks (RBNs), which generalise and unify PCFGs and DBNs, combining their strengths and containing both as special cases.
  arXiv  Detail & Related papers  (2021-11-02T19:21:15Z)
• Probabilistic Gradient Boosting Machines for Large-Scale Probabilistic Regression [51.770998056563094]
  Probabilistic Gradient Boosting Machines (PGBM) is a method to create probabilistic predictions with a single ensemble of decision trees. We empirically demonstrate the advantages of PGBM compared to existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-03T08:32:13Z)
• 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)
• Probabilistic Generating Circuits [50.98473654244851]
  We propose probabilistic generating circuits (PGCs) for their efficient representation. PGCs are not just a theoretical framework that unifies vastly different existing models, but also show huge potential in modeling realistic data. We exhibit a simple class of PGCs that are not trivially subsumed by simple combinations of PCs and DPPs, and obtain competitive performance on a suite of density estimation benchmarks.
  arXiv  Detail & Related papers  (2021-02-19T07:06:53Z)
• Deep Archimedean Copulas [98.96141706464425]
  ACNet is a novel differentiable neural network architecture that enforces structural properties. We show that ACNet is able to both approximate common Archimedean Copulas and generate new copulas which may provide better fits to data.
  arXiv  Detail & Related papers  (2020-12-05T22:58:37Z)
• Probabilistic Circuits for Variational Inference in Discrete Graphical Models [101.28528515775842]
  Inference in discrete graphical models with variational methods is difficult. Many sampling-based methods have been proposed for estimating Evidence Lower Bound (ELBO) We propose a new approach that leverages the tractability of probabilistic circuit models, such as Sum Product Networks (SPN) We show that selective-SPNs are suitable as an expressive variational distribution, and prove that when the log-density of the target model is aweighted the corresponding ELBO can be computed analytically.
  arXiv  Detail & Related papers  (2020-10-22T05:04:38Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processes [32.02612871707347]
  We propose ConvNP, which endows Neural Processes (NPs) with translation equivariance and extends convolutional conditional NPs to allow for dependencies in the predictive distribution. We demonstrate the strong performance and generalization capabilities of ConvNPs on 1D, regression image completion, and various tasks with real-world-temporal data.
  arXiv  Detail & Related papers  (2020-07-02T18:25:27Z)
• Sum-product networks: A survey [0.0]
  A sum-product network (SPN) is a probabilistic model, based on a rooted acyclic directed graph. This paper offers a survey of SPNs, including their definition, the main algorithms for inference and learning from data, the main applications, a brief review of software libraries, and a comparison with related models.
  arXiv  Detail & Related papers  (2020-04-02T17:46:29Z)
• GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences [70.30467057209405]
  Generative Adversarial Networks (GANs) are modern methods to learn the underlying distribution of a data set. GANs are designed in a model-free fashion where no additional information about the underlying distribution is available. We propose a principled design of a model-based GAN that uses a set of simple discriminators on the neighborhoods of the Bayes-net/MRF.
  arXiv  Detail & Related papers  (2020-03-02T04:31:22Z)

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.