A finite-strength logit prior from a weighted knowledge graph lets Bayesian network structure learning recover directed edges under extreme sparsity where data-only methods fail.
Causal structure learning supervised by large language model
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
KG-SoftMAP: Soft Knowledge-Graph Priors for Bayesian Network Structure Learning from Sparse Discrete Data
A finite-strength logit prior from a weighted knowledge graph lets Bayesian network structure learning recover directed edges under extreme sparsity where data-only methods fail.