String Diagrams with Factorized Densities

• URL: http://arxiv.org/abs/2305.02506v5
• Date: Thu, 14 Dec 2023 14:08:07 GMT
• Title: String Diagrams with Factorized Densities
• Authors: Eli Sennesh (Northeastern University), Jan-Willem van de Meent (University of Amsterdam)
• Abstract summary: Both probabilistic programs and causal models define a joint probability density over a set of random variables. This work builds on work on Markov categories of probabilistic mappings to define a category whose morphisms combine a joint density, factorized over each sample space, with a deterministic mapping from samples to return values.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a joint probability density over a set of random variables, and exhibit sparse structure that can be used to reason about causation and conditional independence. This work builds on recent work on Markov categories of probabilistic mappings to define a category whose morphisms combine a joint density, factorized over each sample space, with a deterministic mapping from samples to return values. This is a step towards closing the gap between recent category-theoretic descriptions of probability measures, and the operational definitions of factorized densities that are commonly employed in probabilistic programming and causal inference.

Related papers

• Identifiable Latent Neural Causal Models [82.14087963690561]
  Causal representation learning seeks to uncover latent, high-level causal representations from low-level observed data. We determine the types of distribution shifts that do contribute to the identifiability of causal representations. We translate our findings into a practical algorithm, allowing for the acquisition of reliable latent causal representations.
  arXiv  Detail & Related papers  (2024-03-23T04:13:55Z)
• Cyclic Directed Probabilistic Graphical Model: A Proposal Based on Structured Outcomes [0.0]
  We describe a probabilistic graphical model - probabilistic relation network - that allows the direct capture of directional cyclic dependencies. This model does not violate the probability axioms, and it supports learning from observed data. Notably, it supports probabilistic inference, making it a prospective tool in data analysis and in expert and design-making applications.
  arXiv  Detail & Related papers  (2023-10-25T10:19:03Z)
• Bivariate Causal Discovery using Bayesian Model Selection [11.726586969589]
  We show how to incorporate causal assumptions within the Bayesian framework. This enables us to construct models with realistic assumptions. We then outperform previous methods on a wide range of benchmark datasets.
  arXiv  Detail & Related papers  (2023-06-05T14:51:05Z)
• On the Role of Randomization in Adversarially Robust Classification [13.39932522722395]
  We show that a randomized ensemble outperforms the hypothesis set in adversarial risk. We also give an explicit description of the deterministic hypothesis set that contains such a deterministic classifier.
  arXiv  Detail & Related papers  (2023-02-14T17:51:00Z)
• Identifying Weight-Variant Latent Causal Models [82.14087963690561]
  We find that transitivity acts as a key role in impeding the identifiability of latent causal representations. Under some mild assumptions, we can show that the latent causal representations can be identified up to trivial permutation and scaling. We propose a novel method, termed Structural caUsAl Variational autoEncoder, which directly learns latent causal representations and causal relationships among them.
  arXiv  Detail & Related papers  (2022-08-30T11:12:59Z)
• The d-separation criterion in Categorical Probability [0.0]
  The d-separation criterion detects the compatibility of a joint probability distribution with a directed acyclic graph through certain conditional independences. This work introduces a categorical definition of causal models, a categorical notion of d-separation, and proving an abstract version of the d-separation criterion.
  arXiv  Detail & Related papers  (2022-07-12T17:58:31Z)
• Typing assumptions improve identification in causal discovery [123.06886784834471]
  Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
  arXiv  Detail & Related papers  (2021-07-22T14:23:08Z)
• 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)
• Latent Causal Invariant Model [128.7508609492542]
  Current supervised learning can learn spurious correlation during the data-fitting process. We propose a Latent Causal Invariance Model (LaCIM) which pursues causal prediction.
  arXiv  Detail & Related papers  (2020-11-04T10:00:27Z)
• Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
  Causal inferences can be obtained by standard algorithms for the updating of credal nets. This contribution should be regarded as a systematic approach to represent structural causal models by credal networks. Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
  arXiv  Detail & Related papers  (2020-08-02T11:19:36Z)
• Categorical Stochastic Processes and Likelihood [1.14219428942199]
  We take a Category Theoretic perspective on the relationship between probabilistic modeling and function approximation. We show how these extensions relate to the category Stoch and other Markov Categories. We conclude with a demonstration of how the Maximum Likelihood Estimation procedure defines an identity-on-objects functor from the category of statistical models to the category of learners.
  arXiv  Detail & Related papers  (2020-05-10T18:00:56Z)

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.