Reasoning About Causal Models With Infinitely Many Variables

• URL: http://arxiv.org/abs/2112.11362v1
• Date: Tue, 21 Dec 2021 17:03:45 GMT
• Title: Reasoning About Causal Models With Infinitely Many Variables
• Abstract summary: We provide a sound and complete axiomatization of causal reasoning in GSEMs. Considering GSEMs helps clarify what properties Halpern's axioms capture.
• Score: 14.505867475659274
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generalized structural equations models (GSEMs) [Peters and Halpern 2021], are, as the name suggests, a generalization of structural equations models (SEMs). They can deal with (among other things) infinitely many variables with infinite ranges, which is critical for capturing dynamical systems. We provide a sound and complete axiomatization of causal reasoning in GSEMs that is an extension of the sound and complete axiomatization provided by Halpern [2000] for SEMs. Considering GSEMs helps clarify what properties Halpern's axioms capture.

Related papers

• OMNIFLOW: A Physics-Grounded Multimodal Agent for Generalized Scientific Reasoning [51.33849811496781]
  Large Language Models (LLMs) have demonstrated exceptional logical reasoning capabilities but frequently struggle with the continuous dynamics by Partial Differential Equations (PDEs)<n>We propose OMNIFLOW, a multimodal-symbolic architecture designed to ground frozen LLMs in fundamental physical laws without requiring domain-specific parameter updates.<n>We evaluate it on a benchmark spanning microscopic turbulence, theoretical Navier-Stokes, and macroscopic global weather forecasting.
  arXiv  Detail & Related papers  (2026-03-16T18:29:01Z)
• Operational reconstruction of Feynman rules for quantum amplitudes via composition algebras [0.0]
  We revisit an operational model presented in "Origin of complex quantum amplitudes and Feynman's rules"<n>Our methodology establishes clarity by separating axioms from mathematics, choices from physics, and deductions therefrom.
  arXiv  Detail & Related papers  (2025-08-20T16:12:11Z)
• Formations of generalized Wannier-Stark ladders: Theorem and applications [0.0]
  Wannier-Stark ladder (WSL) is a basic concept, supporting periodic oscillation. We investigate the formations of WSL in generalized systems, including strongly correlated and non-Hermitian systems. It is shown that the Bloch-Zener oscillations of correlated bosons are particularly remarkable under resonant conditions.
  arXiv  Detail & Related papers  (2024-11-10T10:29:51Z)
• Teaching Transformers Causal Reasoning through Axiomatic Training [33.77073807002369]
  We study to what extent a system can learn causal reasoning from symbolic demonstrations of causal axioms. A key question is whether the system would learn to generalize from the axiom demonstrations to more complex scenarios. To handle diverse text inputs, the same method is extended to finetune language models.
  arXiv  Detail & Related papers  (2024-07-10T12:50:44Z)
• Nondeterministic Causal Models [7.550566004119157]
  We generalize acyclic deterministic structural equation models to the nondeterministic case. We provide a sound and complete axiomatization of the resulting logic.
  arXiv  Detail & Related papers  (2024-05-22T21:17:52Z)
• Tempered Calculus for ML: Application to Hyperbolic Model Embedding [70.61101116794549]
  Most mathematical distortions used in ML are fundamentally integral in nature. In this paper, we unveil a grounded theory and tools which can help improve these distortions to better cope with ML requirements. We show how to apply it to a problem that has recently gained traction in ML: hyperbolic embeddings with a "cheap" and accurate encoding along the hyperbolic vsean scale.
  arXiv  Detail & Related papers  (2024-02-06T17:21:06Z)
• A Study of Neural Collapse Phenomenon: Grassmannian Frame, Symmetry and Generalization [91.95109845914267]
  We extend original Neural Collapse Phenomenon by proving Generalized Neural Collapse hypothesis. We obtain Grassmannian Frame structure from the optimization and generalization of classification. We provide a theorem to explain Symmetric Generalization of permutation.
  arXiv  Detail & Related papers  (2023-04-18T11:35:14Z)
• Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought [10.524051272257614]
  Large language models (LLMs) have shown remarkable reasoning capabilities given chain-of-thought prompts. We present a new synthetic question-answering dataset called PrOntoQA, where each example is generated as a synthetic world model. This allows us to parse the generated chain-of-thought into symbolic proofs for formal analysis.
  arXiv  Detail & Related papers  (2022-10-03T21:34:32Z)
• Quantum Mechanics as a Theory of Incompatible Symmetries [77.34726150561087]
  We show how classical probability theory can be extended to include any system with incompatible variables. We show that any probabilistic system (classical or quantal) that possesses incompatible variables will show not only uncertainty, but also interference in its probability patterns.
  arXiv  Detail & Related papers  (2022-05-31T16:04:59Z)
• Gleason's theorem for composite systems [0.0]
  Gleason's theorem is an important result in the foundations of quantum mechanics. We prove a generalisation of Gleason's theorem to composite systems.
  arXiv  Detail & Related papers  (2022-05-01T15:26:00Z)
• Compositional Generalization Requires Compositional Parsers [69.77216620997305]
  We compare sequence-to-sequence models and models guided by compositional principles on the recent COGS corpus. We show structural generalization is a key measure of compositional generalization and requires models that are aware of complex structure.
  arXiv  Detail & Related papers  (2022-02-24T07:36:35Z)
• Causal Modeling With Infinitely Many Variables [14.505867475659274]
  Structural-equations models (SEMs) are perhaps the most commonly used framework for modeling causality. We introduce GSEMs, a flexible generalization of SEMs that directly specify the results of interventions.
  arXiv  Detail & Related papers  (2021-12-16T19:41:42Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

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.