AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Learning a High-dimensional Linear Structural Equation Model via l1-Regularized Regression

Gunwoong Park, Sang Jun Moon, Sion Park, Jong-June Jeon

JMLR 2021 · Learning theory and algorithms › Sample complexity · approach: Coresets and sublinear estimation · 5 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
increase sample size n for structure recovery with HLSMHLSM · Gaussian linear SEMs, p in {25,50,100}Hamming distanceImproved
sparse graph (d = 5) instead of dense graph (d = 8)HLSM · Gaussian linear SEMsHamming distance / recovery probabilityImproved
use non-Gaussian errors (Uniform, Student's t, Beta) instead of GaussianHLSM · linear SEMs with different error distributionsprobability of successful recoveryNo clear effect
HLSM versus US, GDS, LISTEN and TD baselinesHLSM · Gaussian and non-Gaussian linear SEMsHamming distanceImproved
HLSM versus TD and LISTEN in run time with growing nodesHLSM · Gaussian SEMs, n = 1000, p up to 200run time: TD takes over 10 hours on a 200-node dense graphImproved

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