arXiv (All)
open access
Directional Evidence Guided Search-Space Reduction for Exact DAG Learning
Learning a directed acyclic graph (DAG) from observational data is a challenging combinatorial problem due to the exponential growth in the number of candidate parent-set configurations. Existing exact score-based methods often require computationally intensive combinatorial search, whereas constrai
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exploiting Non-Negativity in DAG Structure Learning#1326290
- Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework#1326068
- PISA: Prioritized Invariant Subgraph Aggregation for Out-of-Distribution Generalization on Graphs#1141459
- Effects of relational graph modularity and depth on the learning performance of neural networks#986785
- PyAPX: Python toolkit for atomic configuration pattern exploration#821744
Record · ID 1233175
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive