AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Identification and Overidentification of Linear Structural Equation Models

Bryant Chen

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Extend half-trek criterion to general half-trek criterion (g-HTC) that identifies arbitrary subsets of a node's edgeslinear SEMs (Figure 1 model) · Figure 1 example modelidentifiability of modelImproved
Recursive c-component decomposition (removing descendant sets and repeating) added to g-HTC identificationsemi-Markovian linear SEMs · Figure 2a example graphnumber of identified coefficientsImproved
Recursive decomposition added to HT-constraint discoverylinear SEM constraint discovery · Figure 3a graphnumber of testable constraintsImproved
Removing descendant set v2 from Figure 2a model (ablation)c-component decomposition · Figure 2a graphc-component structureNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy