arXiv:1411.1557
Proof Supplement - Learning Sparse Causal Models is not NP-hard (UAI2013)
원문 초록
This article contains detailed proofs and additional examples related to the UAI-2013 submission `Learning Sparse Causal Models is not NP-hard'. It describes the FCI+ algorithm: a method for sound and complete causal model discovery in the presence of latent confounders and/or selection bias, that has worst case polynomial complexity of order $N^{2(k+1)}$ in the number of independence tests, for sparse graphs over $N$ nodes, bounded by node degree $k$. The algorithm is an adaptation of the well-known FCI algorithm by (Spirtes et al., 2000) that is also sound and complete, but has worst case complexity exponential in $N$.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLM-Generated Feedback Supports Learning If Learners Choose to Use It
Enhancing generalizability of model discovery across parameter space with multi-experiment equation learning (ME-EQL)
Addressing Correlated Latent Exogenous Variables in Debiased Recommender Systems
Understanding challenges to the interpretation of disaggregated evaluations of algorithmic fairness
Bi-Level optimization for parameter estimation of differential equations using interpolation
Automated Modeling Method for Pathloss Model Discovery
토론
이 논문과 연결된 포럼 글이 아직 없습니다.