arXiv (All)
open access
Exploiting Non-Negativity in DAG Structure Learning
This work addresses the problem of learning directed acyclic graphs (DAGs) from nodal observations adhering to a linear structural equation model. DAG structure learning is a central task in signal processing, machine learning, and causal inference, but it remains challenging because acyclicity is a
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
- Directional Evidence Guided Search-Space Reduction for Exact DAG Learning#1233175
- Graph Homomorphism Distortion: A structural (pseudo)-metric for attributed graphs#1357057
- LLaTA: Unlocking Graph Structure Learning with Tree-Guided Large Language Models#1233684
- THGFM: Dual-Branch Temporal Heterogeneous Graph Fusion Model#1129345
- The Cambridge Structural Database#6536
Record · ID 1326290
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