A category theoretical argument for causal inference

• URL: http://arxiv.org/abs/2004.09999v2
• Date: Sun, 14 Jun 2020 21:43:32 GMT
• Title: A category theoretical argument for causal inference
• Authors: R\'emy Tuy\'eras
• Abstract summary: The goal of this paper is to design a causal inference method accounting for complex interactions between causal factors. The proposed method relies on a category theoretical reformulation of the definitions of dependent variables, independent variables and latent variables. As an application, we show how the proposed method can be used to design a genome-wide association algorithm for the field of genetics.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The goal of this paper is to design a causal inference method accounting for complex interactions between causal factors. The proposed method relies on a category theoretical reformulation of the definitions of dependent variables, independent variables and latent variables in terms of products and arrows in the category of unlabeled partitions. Throughout the paper, we demonstrate how the proposed method accounts for possible hidden variables, such as environmental variables or noise, and how it can be interpreted statistically in terms of $p$-values. This interpretation, from category theory to statistics, is implemented through a collection of propositions highlighting the functorial properties of ANOVA. We use these properties in combination with our category theoretical framework to provide solutions to causal inference problems with both sound algebraic and statistical properties. As an application, we show how the proposed method can be used to design a combinatorial genome-wide association algorithm for the field of genetics.

Related papers

• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Enriching Disentanglement: From Logical Definitions to Quantitative Metrics [59.12308034729482]
  Disentangling the explanatory factors in complex data is a promising approach for data-efficient representation learning. We establish relationships between logical definitions and quantitative metrics to derive theoretically grounded disentanglement metrics. We empirically demonstrate the effectiveness of the proposed metrics by isolating different aspects of disentangled representations.
  arXiv  Detail & Related papers  (2023-05-19T08:22:23Z)
• String Diagrams with Factorized Densities [0.0]
  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.
  arXiv  Detail & Related papers  (2023-05-04T02:30:44Z)
• SARAH-based Variance-reduced Algorithm for Stochastic Finite-sum Cocoercive Variational Inequalities [137.6408511310322]
  We consider the problem of finite-sum cocoercive variational inequalities. For strongly monotone problems it is possible to achieve linear convergence to a solution using this method.
  arXiv  Detail & Related papers  (2022-10-12T08:04:48Z)
• Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
  We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing. We study the case where probability distributions are not known a priori but need to be estimated from data.
  arXiv  Detail & Related papers  (2022-08-29T16:16:22Z)
• Cluster-based Regression using Variational Inference and Applications in Financial Forecasting [0.0]
  This paper describes an approach to simultaneously identify clusters and estimate cluster-specific regression parameters from the given data. The proposed approach is well-suited for financial forecasting where markets have different regimes (or clusters) with different patterns and correlations of market changes in each regime. Due to the broad applicability of the problem, its elegant theoretical solution, and the computational efficiency of the proposed algorithm, the approach may be useful in a number of areas extending beyond the financial domain.
  arXiv  Detail & Related papers  (2022-05-02T01:19:37Z)
• Variance Minimization in the Wasserstein Space for Invariant Causal Prediction [72.13445677280792]
  In this work, we show that the approach taken in ICP may be reformulated as a series of nonparametric tests that scales linearly in the number of predictors. Each of these tests relies on the minimization of a novel loss function that is derived from tools in optimal transport theory. We prove under mild assumptions that our method is able to recover the set of identifiable direct causes, and we demonstrate in our experiments that it is competitive with other benchmark causal discovery algorithms.
  arXiv  Detail & Related papers  (2021-10-13T22:30:47Z)
• On the Use of Minimum Penalties in Statistical Learning [2.1320960069210475]
  We propose a framework to simultaneously estimate regression coefficients associated with a multivariate regression model and relationships between outcome variables. An iterative algorithm that generalizes current state art methods is proposed as a solution. We extend the proposed MinPen framework to other exponential family loss functions, with a specific focus on multiple binomial responses.
  arXiv  Detail & Related papers  (2021-06-09T16:15:46Z)
• Modelling Heterogeneity Using Bayesian Structured Sparsity [0.0]
  How to estimate the effect of some variable differing across observations is a key question in political science. This paper allows a common way of simplifying complex phenomenon (placing observations with similar effects into discrete groups) to be integrated into regression analysis.
  arXiv  Detail & Related papers  (2021-03-29T19:54:25Z)
• 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)
• Latent Instrumental Variables as Priors in Causal Inference based on Independence of Cause and Mechanism [2.28438857884398]
  We study the role of latent variables such as latent instrumental variables and hidden common causes in the causal graphical structures. We derive a novel algorithm to infer causal relationships between two variables.
  arXiv  Detail & Related papers  (2020-07-17T08:18:19Z)

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.