gcastle_notears
NO TEARS
Package |
|
Version |
1.0.3 |
Language |
|
Docs |
|
Paper |
Zheng et al.[1] |
Graph type |
|
Docker |
|
Module folder |
Description
This score-based method recasts the combinatorial problem of estimating a DAG into a purely continuous non-convex optimization problem over real matrices with a smooth constraint to ensure acyclicity.
Example JSON
[
{
"id": "gcastle_notears",
"lambda1": 0.1,
"loss_type": "l2",
"max_iter": 100,
"h_tol": "1e-8",
"rho_max": "1e+16",
"w_threshold": [
0.05,
0.1,
0.25
],
"timeout": null
}
]