paper-with-me

홈 › Papers

Graphical Representations for Algebraic Constraints of Linear Structural Equations Models

2022-08-01 · Thijs van Ommen, Mathias Drton

The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical for many purposes. In this paper, we present a graphical notation for many of these polynomial constraints. The expressive power of this notation is investigated both theoretically and empirically.

📄 PDF Abstract BibTeX arXiv:2208.00926

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Algebraic Equivalence of Linear Structural Equation Models

2018-07-10 · Thijs van Ommen, Joris M. Mooij

Despite their popularity, many questions about the algebraic constraints imposed by linear structural equation models remain open problems. For causal discovery, two of these problems are especially important: the enumer…

Causal DiscoveryModel Selection

Efficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams

2024-06-10 · Thijs van Ommen

For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not wel…

Causal Discovery

Compositional Structures in Neural Embedding and Interaction Decompositions

2024-07-12 · Matthew Trager, Alessandro Achille, Pramuditha Perera, Luca Zancato 외

We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these net…

The neighborhood lattice for encoding partial correlations in a Hilbert space

2017-11-03 · Arash A. Amini, Bryon Aragam, Qing Zhou

Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying…

Dimensionality Reductionregression

Structural Disentanglement in Bilinear MLPs via Architectural Inductive Bias

2026-02-05 · Ojasva Nema, Kaustubh Sharma, Aditya Chauhan, Parikshit Pareek arxiv

Selective unlearning and long-horizon extrapolation remain fragile in modern neural networks, even when tasks have underlying algebraic structure. In this work, we argue that these failures arise not solely from optimiza…