Research map / Learning theory and algorithms / Matrix and tensor methods
Identifiability of Linear AMP Chain Graph Models
Yuhao Wang, Arnab Bhattacharyya
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use DCOV with known chain components instead of the compared baseline algorithms | AMP chain graph structure learning · Synthetic data, known chain components | SHD | Improved |
| Use DCOV with unknown chain components instead of LDCG or LCD | AMP chain graph structure learning · Synthetic data, unknown chain components | SHD | Improved |
| Use DCOV with unknown chain components instead of PC-Like | AMP chain graph structure learning · Synthetic data, unknown chain components | SHD | No clear effect |
Closest papers by meaning
- On the Complexity of Identification in Linear Structural Causal Models (NeurIPS 2024 · similarity 0.85)
- Markov Equivalence and Consistency in Differentiable Structure Learning (NeurIPS 2024 · similarity 0.85)
- CoLiDE: Concomitant Linear DAG Estimation (ICLR 2024 · similarity 0.84)
- Identifiability Analysis of Linear ODE Systems with Hidden Confounders (NeurIPS 2024 · similarity 0.84)
- Beyond ICA: Identifiability by Symmetry Breaking (NeurIPS 2026 · similarity 0.84)
- Identification for Tree-Shaped Structural Causal Models in Polynomial Time (AAAI 2024 · similarity 0.84)
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.
