Hold-Out Scoring for Efficient Gaussian DAG Learning
arXiv:2610.02785v1 Announce Type: new Abstract: High-dimensional Gaussian DAG learning faces a statistical-computational gap: methods with sharp sample complexity rely on computationally expensive subset search and a supplied indegree bound, whereas polynomial-time alternatives have less favorable…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-05 04:00 · arXiv stat.ML
Hold-Out Scoring for Efficient Gaussian DAG Learning