Research map / Probabilistic and scientific modeling / Molecules and proteins
Structure Learning of Latent Factors via Clique Search on Correlation Thresholded Graphs
Dale Kim, Qing Zhou
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 |
|---|---|---|---|
| Replace support learning with the independent maximal clique search (CT) instead of EFA/penalized EFA support learning | factor analysis structure learning · Low-dimensional simulation | F1 score of support: near 1.0 vs EFA around 0.5 | Improved |
| Use CT clique search rather than penalized EFA for computational efficiency | factor analysis structure learning · Low-dimensional simulation | number of models estimated: CT estimates substantially fewer models than EFA-LASSO (30 per d) and EFA-MCP (270 per d) | Improved |
| Violating thresholdability (high-magnitude off-diagonals in Phi) with CT (ablation) | CT algorithm high-dimensional simulation · High-dimensional simulation (n=250-1000, p=1.5n) | F1 score | No clear effect |
| Violating the unique child condition for CT (ablation) | CT algorithm high-dimensional simulation · High-dimensional simulation | F1 score and estimated d | No clear effect |
| Use CT (clique-based structure) on real intelligence data instead of EFA | factor analysis on intelligence test data · Real data (n=301) | test-data log-likelihood: CT -3749.60 vs EFA-LASSO -3751.82 and EFA-MCP -3751.37; EFA much worse at -3823.14 | No clear effect |
Closest papers by meaning
- Bayesian group factor analysis with structured sparsity (JMLR 2016 · similarity 0.89)
- Fast structure learning with modular regularization (NeurIPS 2019 · similarity 0.86)
- Causal Discovery with Latent Confounders Based on Higher-Order Cumulants (ICML 2023 · similarity 0.86)
- Scores for Learning Discrete Causal Graphs with Unobserved Confounders (AAAI 2024 · similarity 0.85)
- Local Causal Structure Learning in the Presence of Latent Variables (ICML 2024 · similarity 0.85)
- Unconstrained Stochastic CCA: Unifying Multiview and Self-Supervised Learning (ICLR 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.
