Infinitesimal Causality

• URL: http://arxiv.org/abs/2606.24621v1
• Date: Tue, 23 Jun 2026 14:20:20 GMT
• Title: Infinitesimal Causality
• Abstract summary: IDC captures the infinitesimal layer in which interventions act as tangent deformations of copy/discard structure.<n>Key observation is that for structural causal models, infinitesimal causality is most naturally formulated in the slice of deterministic mechanisms over visible kernels.
• Score: 1.3295383263113112
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces a categorical account of infinitesimal causality in Frobenius Markov categories equipped with tangent-bundle semantics. IDC captures the infinitesimal layer in which interventions act as tangent deformations of copy/discard structure. Two distinct Frobenius structures interact: (1) the categorical Frobenius algebra on classical variables encoding copying, comparing, and discarding; and (2) the geometric Frobenius integrability condition, namely involutive closure of the intervention distribution, distinct from the algebraic Frobenius structure. Categorical causal sufficiency is defined as the compatibility of these two notions. A key observation is that, for structural causal models, infinitesimal causality is most naturally formulated in the slice of deterministic mechanisms over exogenous variables, with visible stochastic kernels obtained only after pushforward. Interventions are tangent vectors that deform the Frobenius copy/discard operations; their Lie brackets measure whether this deformation preserves classical information-flow structure. Pearl's do-calculus is used as a guiding example of intervention identities: ignoring irrelevant interventions corresponds to counit invariance, action/observation exchange to coproduct compatibility with pushforward, and independence to involutive bracket closure of the visible intervention distribution.

Related papers

• Contraction Analysis of Holomorphic Dynamical Systems via the Intrinsic Kobayashi Metric [0.0]
  This paper studies incremental stability of holomorphic dynamical systems through the infinitesimal Kobayashi metric.<n>Contraction is formalized as an upper Dini-derivative inequality on the Kobayashi metric along trajectories.
  arXiv  Detail & Related papers  (2026-08-01T17:06:21Z)
• Learning Bidirectional Causal Interactions with Heteroscedastic Neural Networks [1.0356094515229846]
  This paper proposes SEM-DNN, a heteroscedastic neural simultaneous-equation estimator.<n>It learns reciprocal structural interactions without external instruments.<n>An application to ready-to-eat cereal scanner data illustrates how the method can study contemporaneous price-sales feedback.
  arXiv  Detail & Related papers  (2026-07-24T13:53:58Z)
• A cubical formalisation of topos causal models: intervention, sheaf gluing, and the intuitionistic do-calculus [5.076419064097734]
  We give the first machine-checked account of a 1-topos core, in Cubical Agda.<n>We show that interventions and Pearl's rules are stable under every topology.<n>We add a phenomenon the programme does not consider: a machine-checked contextuality obstruction.
  arXiv  Detail & Related papers  (2026-07-17T05:05:31Z)
• Defect Holonomy Near Rank-Deficient Mixed States [2.679171884680826]
  We investigate the geometry of mixed quantum states near rank-changing points.<n>We show that rank-deficient states form singular boundary strata where the bundle structure degenerates.<n>By restricting to a punctured state manifold that excludes the singular set, we obtain a well-defined gauge structure.
  arXiv  Detail & Related papers  (2026-06-01T14:51:19Z)
• Deconfounding Scores and Representation Learning for Causal Effect Estimation with Weak Overlap [75.41420283374737]
  Overlap is a key condition for causal treatment effect estimation.<n>We propose a class of feature representations called deconfounding scores.<n>We show that prognostic scores are overlap-optimal within this class.
  arXiv  Detail & Related papers  (2026-04-01T12:19:42Z)
• The Minary Primitive of Computational Autopoiesis [0.0]
  We introduce Minary, a computational framework designed as a candidate for the first formally provable autopoietic primitive.<n>We derive exact formulas for the mean and variance of the normalized consensus conditioned on the activation of a given semantic dimension.<n>We argue that Minary is organizationally closed yet operationally open in the sense of Maturana and Varela.
  arXiv  Detail & Related papers  (2026-01-08T02:12:04Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• Multivariate Bernoulli Hoeffding Decomposition: From Theory to Sensitivity Analysis [2.762021507766656]
  This work focuses on the case of Bernoulli inputs and provides a complete analytical characterization of the decomposition.<n>We show that, in this discrete setting, the associated subspaces are one-dimensional and that the decomposition admits a closed-form representation.<n>The paper concludes with perspectives on extending the methodology to high-dimensional settings and to models involving inputs with finite, non-binary support.
  arXiv  Detail & Related papers  (2025-10-08T14:46:20Z)
• 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)
• Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks [3.566568169425391]
  We show that with increased depth, node representations become dominated by a low-dimensional subspace that depends on the aggregation function but not on the feature transformations. For all aggregation functions, the rank of the node representations collapses, resulting in over-smoothing for particular aggregation functions.
  arXiv  Detail & Related papers  (2023-08-31T15:22:31Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• Score-based Causal Representation Learning with Interventions [54.735484409244386]
  This paper studies the causal representation learning problem when latent causal variables are observed indirectly. The objectives are: (i) recovering the unknown linear transformation (up to scaling) and (ii) determining the directed acyclic graph (DAG) underlying the latent variables.
  arXiv  Detail & Related papers  (2023-01-19T18:39:48Z)
• An Indirect Rate-Distortion Characterization for Semantic Sources: General Model and the Case of Gaussian Observation [83.93224401261068]
  Source model is motivated by the recent surge of interest in the semantic aspect of information. intrinsic state corresponds to the semantic feature of the source, which in general is not observable. Rate-distortion function is the semantic rate-distortion function of the source.
  arXiv  Detail & Related papers  (2022-01-29T02:14:24Z)

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.