Metraipolis › archive › dc_cd86e6c3d580

Nonnegative DAG Learning via Concomitant Estimation — arXiv:2609.34595

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.34595
License (as archived)
CC0-1.0
Archived
2026-10-07T23:02:50.147Z
SHA-256 of the archived text
9debd229c796f33a006a11c6b41a4945b0c909f91ec12b7ecaa7064032fa9364
Stable URL of this page
https://metraipolis.com/documento/dc_cd86e6c3d580

How to cite

Nonnegative DAG Learning via Concomitant Estimation — arXiv:2609.34595 — arXiv (en), https://arxiv.org/abs/2609.34595 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd86e6c3d580 (Metraipolis archive dc_cd86e6c3d580, sha256 9debd229c796f33a006a11c6b41a4945b0c909f91ec12b7ecaa7064032fa9364)
BibTeX
@misc{dccd86e6c3d580,
  title = {Nonnegative DAG Learning via Concomitant Estimation — arXiv:2609.34595},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34595},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd86e6c3d580; sha256 9debd229c796f33a006a11c6b41a4945b0c909f91ec12b7ecaa7064032fa9364},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34595. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the problem of learning directed acyclic graphs (DAGs) with nonnegative edge weights from observational data. We propose the Nonnegative and Concomitant (NoCo) DAG estimator, which jointly recovers the weighted graph structure and the exogenous noise variances in the linear structural equation model for the observations. Different from prior art, this noise-adaptive formulation blends a smoothed concomitant lasso criterion with a simpler log-determinant acyclicity constraint that exploits nonnegativity and yields a more benign optimization landscape. Specifically, nonnegative weights allow us to impose acyclicity directly on the adjacency matrix without elementwise squaring of its entries, thus avoiding the well-documented degeneracy of the Karush-Kuhn-Tucker conditions. Computationally, we develop a method of multipliers' algorithm that accommodates both homoscedastic and heteroscedastic noise profiles. Within each iteration, we use block successive convex approximation to minimize the augmented Lagrangian, alternating between proximal gradient steps for the adjacency matrix and closed-form updates for the noise scales. Simulated experiments demonstrate NoCo's improved structural and edge-weight recovery relative to competing methods in a variety of settings, highlighting the benefits of exploiting nonnegativity along with noise adaptivity.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-29 in stat.ML).
Categorie arXiv: Signal Processing (eess.SP) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.34595 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T22:41:13.214Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).