On the Sparse DAG Structure Learning Based on Adaptive Lasso. (arXiv:2209.02946v1 [stat.ML])

Learning the underlying casual structure, represented by Directed Acyclic
Graphs (DAGs), of concerned events from fully-observational data is a crucial
part of causal reasoning, but it is challenging due to the combinatorial and
large search space. A recent flurry of developments recast this combinatorial
problem into a continuous optimization problem by leveraging an algebraic
equality characterization of acyclicity. However, these methods suffer from the
fixed-threshold step after optimization, which is not a flexible and systematic
way to rule out the …

arxiv dag lasso